About the Execution of ITS-Tools for Parking-PT-432
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1689.508 | 278579.00 | 611023.00 | 966.50 | FFFFFFFFFFFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r261-smll-167863536400436.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Parking-PT-432, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536400436
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 15:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 15:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 192K Mar 5 18:23 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 Parking-PT-432-LTLFireability-00
FORMULA_NAME Parking-PT-432-LTLFireability-01
FORMULA_NAME Parking-PT-432-LTLFireability-02
FORMULA_NAME Parking-PT-432-LTLFireability-03
FORMULA_NAME Parking-PT-432-LTLFireability-04
FORMULA_NAME Parking-PT-432-LTLFireability-05
FORMULA_NAME Parking-PT-432-LTLFireability-06
FORMULA_NAME Parking-PT-432-LTLFireability-07
FORMULA_NAME Parking-PT-432-LTLFireability-08
FORMULA_NAME Parking-PT-432-LTLFireability-09
FORMULA_NAME Parking-PT-432-LTLFireability-10
FORMULA_NAME Parking-PT-432-LTLFireability-11
FORMULA_NAME Parking-PT-432-LTLFireability-12
FORMULA_NAME Parking-PT-432-LTLFireability-13
FORMULA_NAME Parking-PT-432-LTLFireability-14
FORMULA_NAME Parking-PT-432-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678928613841
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-432
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 01:03:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 01:03:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 01:03:37] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2023-03-16 01:03:37] [INFO ] Transformed 529 places.
[2023-03-16 01:03:37] [INFO ] Transformed 785 transitions.
[2023-03-16 01:03:37] [INFO ] Found NUPN structural information;
[2023-03-16 01:03:37] [INFO ] Parsed PT model containing 529 places and 785 transitions and 2329 arcs in 543 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
FORMULA Parking-PT-432-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 457/457 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 525 transition count 453
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 525 transition count 453
Applied a total of 8 rules in 142 ms. Remains 525 /529 variables (removed 4) and now considering 453/457 (removed 4) transitions.
// Phase 1: matrix 453 rows 525 cols
[2023-03-16 01:03:37] [INFO ] Computed 124 place invariants in 44 ms
[2023-03-16 01:03:38] [INFO ] Implicit Places using invariants in 1078 ms returned [64, 72, 80, 88, 96, 104, 112, 120, 144, 146, 189, 197, 205, 213, 221, 229, 237, 245, 269, 314, 322, 330, 338, 346, 354, 362, 370, 394, 396, 439, 447, 455, 463, 471, 479, 487, 495, 519]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1142 ms to find 38 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 487/529 places, 453/457 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 457 transition count 423
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 457 transition count 423
Applied a total of 60 rules in 112 ms. Remains 457 /487 variables (removed 30) and now considering 423/453 (removed 30) transitions.
// Phase 1: matrix 423 rows 457 cols
[2023-03-16 01:03:39] [INFO ] Computed 86 place invariants in 5 ms
[2023-03-16 01:03:39] [INFO ] Implicit Places using invariants in 492 ms returned []
[2023-03-16 01:03:39] [INFO ] Invariant cache hit.
[2023-03-16 01:03:39] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-16 01:03:40] [INFO ] Implicit Places using invariants and state equation in 1002 ms returned []
Implicit Place search using SMT with State Equation took 1512 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 457/529 places, 423/457 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2912 ms. Remains : 457/529 places, 423/457 transitions.
Support contains 36 out of 457 places after structural reductions.
[2023-03-16 01:03:40] [INFO ] Flatten gal took : 124 ms
[2023-03-16 01:03:41] [INFO ] Flatten gal took : 49 ms
[2023-03-16 01:03:41] [INFO ] Input system was already deterministic with 423 transitions.
Support contains 35 out of 457 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 761 ms. (steps per millisecond=13 ) properties (out of 23) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-16 01:03:42] [INFO ] Invariant cache hit.
[2023-03-16 01:03:42] [INFO ] [Real]Absence check using 86 positive place invariants in 34 ms returned sat
[2023-03-16 01:03:42] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-16 01:03:42] [INFO ] [Nat]Absence check using 86 positive place invariants in 37 ms returned sat
[2023-03-16 01:03:43] [INFO ] After 538ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-16 01:03:43] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-16 01:03:43] [INFO ] After 458ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-16 01:03:43] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 6 ms to minimize.
[2023-03-16 01:03:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-03-16 01:03:44] [INFO ] After 1035ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 306 ms.
[2023-03-16 01:03:44] [INFO ] After 2278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 5 properties in 112 ms.
Support contains 5 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 423/423 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 457 transition count 408
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 442 transition count 408
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 442 transition count 393
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 427 transition count 393
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 425 transition count 391
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 425 transition count 391
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 106 place count 404 transition count 370
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 108 place count 403 transition count 377
Free-agglomeration rule applied 96 times.
Iterating global reduction 2 with 96 rules applied. Total rules applied 204 place count 403 transition count 281
Reduce places removed 96 places and 0 transitions.
Graph (complete) has 640 edges and 307 vertex of which 90 are kept as prefixes of interest. Removing 217 places using SCC suffix rule.3 ms
Discarding 217 places :
Also discarding 189 output transitions
Drop transitions removed 189 transitions
Iterating post reduction 2 with 97 rules applied. Total rules applied 301 place count 90 transition count 92
Drop transitions removed 6 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 315 place count 90 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 317 place count 89 transition count 85
Applied a total of 317 rules in 241 ms. Remains 89 /457 variables (removed 368) and now considering 85/423 (removed 338) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 89/457 places, 85/423 transitions.
Incomplete random walk after 10000 steps, including 685 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :2
Finished Best-First random walk after 2188 steps, including 26 resets, run visited all 1 properties in 5 ms. (steps per millisecond=437 )
FORMULA Parking-PT-432-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((G(p0) U p1)&&X(G(p2)))))))'
Support contains 5 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 455 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 455 transition count 421
Applied a total of 4 rules in 20 ms. Remains 455 /457 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 455 cols
[2023-03-16 01:03:45] [INFO ] Computed 86 place invariants in 4 ms
[2023-03-16 01:03:46] [INFO ] Implicit Places using invariants in 374 ms returned [236, 451]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 379 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/457 places, 421/423 transitions.
Applied a total of 0 rules in 9 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 408 ms. Remains : 453/457 places, 421/423 transitions.
Stuttering acceptance computed with spot in 585 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Parking-PT-432-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 4}, { cond=(OR p1 p0), acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=3 dest: 5}, { cond=(AND p1 p0), acceptance={1} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=5 dest: 4}, { cond=p2, acceptance={0} source=5 dest: 5}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1} source=6 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s268 1) (EQ s314 1)), p0:(AND (EQ s355 1) (EQ s391 1)), p2:(EQ s185 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 6 ms.
FORMULA Parking-PT-432-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-00 finished in 1106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p0))||G(p1)) U p2))'
Support contains 5 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 455 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 455 transition count 421
Applied a total of 4 rules in 20 ms. Remains 455 /457 variables (removed 2) and now considering 421/423 (removed 2) transitions.
[2023-03-16 01:03:46] [INFO ] Invariant cache hit.
[2023-03-16 01:03:47] [INFO ] Implicit Places using invariants in 339 ms returned [236, 451]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 341 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/457 places, 421/423 transitions.
Applied a total of 0 rules in 12 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 375 ms. Remains : 453/457 places, 421/423 transitions.
Stuttering acceptance computed with spot in 282 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s270 1) (EQ s312 1) (EQ s345 1)), p1:(EQ s102 1), p0:(AND (EQ s377 1) (EQ s270 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 64 steps with 15 reset in 9 ms.
FORMULA Parking-PT-432-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-02 finished in 697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X(G(p0))))'
Support contains 4 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 455 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 455 transition count 421
Applied a total of 4 rules in 34 ms. Remains 455 /457 variables (removed 2) and now considering 421/423 (removed 2) transitions.
[2023-03-16 01:03:47] [INFO ] Invariant cache hit.
[2023-03-16 01:03:47] [INFO ] Implicit Places using invariants in 402 ms returned [236, 451]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 408 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/457 places, 421/423 transitions.
Applied a total of 0 rules in 13 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 458 ms. Remains : 453/457 places, 421/423 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s288 1) (EQ s345 1)), p0:(AND (EQ s367 1) (EQ s410 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-03 finished in 671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 3 out of 457 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 456 transition count 406
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 440 transition count 406
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 440 transition count 390
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 424 transition count 390
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 422 transition count 388
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 422 transition count 388
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 110 place count 401 transition count 367
Applied a total of 110 rules in 97 ms. Remains 401 /457 variables (removed 56) and now considering 367/423 (removed 56) transitions.
// Phase 1: matrix 367 rows 401 cols
[2023-03-16 01:03:48] [INFO ] Computed 86 place invariants in 3 ms
[2023-03-16 01:03:48] [INFO ] Implicit Places using invariants in 322 ms returned [209, 398]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 325 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 399/457 places, 367/423 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 397 transition count 365
Applied a total of 4 rules in 45 ms. Remains 397 /399 variables (removed 2) and now considering 365/367 (removed 2) transitions.
// Phase 1: matrix 365 rows 397 cols
[2023-03-16 01:03:48] [INFO ] Computed 84 place invariants in 3 ms
[2023-03-16 01:03:48] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-16 01:03:48] [INFO ] Invariant cache hit.
[2023-03-16 01:03:49] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 397/457 places, 365/423 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1450 ms. Remains : 397/457 places, 365/423 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s50 1) (EQ s87 1))) (NEQ s342 1)), p0:(AND (EQ s50 1) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 959 reset in 655 ms.
Product exploration explored 100000 steps with 963 reset in 692 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 4 factoid took 235 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 1643 steps, including 14 resets, run visited all 2 properties in 36 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 290 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 397/397 places, 365/365 transitions.
Applied a total of 0 rules in 32 ms. Remains 397 /397 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2023-03-16 01:03:51] [INFO ] Invariant cache hit.
[2023-03-16 01:03:52] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-16 01:03:52] [INFO ] Invariant cache hit.
[2023-03-16 01:03:53] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
[2023-03-16 01:03:53] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-16 01:03:53] [INFO ] Invariant cache hit.
[2023-03-16 01:03:53] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1613 ms. Remains : 397/397 places, 365/365 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 261 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 597 steps, including 5 resets, run visited all 2 properties in 9 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 303 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 961 reset in 708 ms.
Product exploration explored 100000 steps with 970 reset in 547 ms.
Built C files in :
/tmp/ltsmin11794967278235702154
[2023-03-16 01:03:55] [INFO ] Computing symmetric may disable matrix : 365 transitions.
[2023-03-16 01:03:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 01:03:55] [INFO ] Computing symmetric may enable matrix : 365 transitions.
[2023-03-16 01:03:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 01:03:55] [INFO ] Computing Do-Not-Accords matrix : 365 transitions.
[2023-03-16 01:03:55] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 01:03:55] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11794967278235702154
Running compilation step : cd /tmp/ltsmin11794967278235702154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1631 ms.
Running link step : cd /tmp/ltsmin11794967278235702154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin11794967278235702154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7119192342488703400.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 397/397 places, 365/365 transitions.
Applied a total of 0 rules in 14 ms. Remains 397 /397 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2023-03-16 01:04:10] [INFO ] Invariant cache hit.
[2023-03-16 01:04:11] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-16 01:04:11] [INFO ] Invariant cache hit.
[2023-03-16 01:04:12] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
[2023-03-16 01:04:12] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-16 01:04:12] [INFO ] Invariant cache hit.
[2023-03-16 01:04:12] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1586 ms. Remains : 397/397 places, 365/365 transitions.
Built C files in :
/tmp/ltsmin10905736235008272214
[2023-03-16 01:04:12] [INFO ] Computing symmetric may disable matrix : 365 transitions.
[2023-03-16 01:04:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 01:04:12] [INFO ] Computing symmetric may enable matrix : 365 transitions.
[2023-03-16 01:04:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 01:04:12] [INFO ] Computing Do-Not-Accords matrix : 365 transitions.
[2023-03-16 01:04:12] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 01:04:12] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10905736235008272214
Running compilation step : cd /tmp/ltsmin10905736235008272214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1220 ms.
Running link step : cd /tmp/ltsmin10905736235008272214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10905736235008272214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6162921721669210621.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 01:04:27] [INFO ] Flatten gal took : 43 ms
[2023-03-16 01:04:27] [INFO ] Flatten gal took : 42 ms
[2023-03-16 01:04:27] [INFO ] Time to serialize gal into /tmp/LTL18214912456711664130.gal : 10 ms
[2023-03-16 01:04:27] [INFO ] Time to serialize properties into /tmp/LTL4654588435187520934.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18214912456711664130.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9660432360886209922.hoa' '-atoms' '/tmp/LTL4654588435187520934.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4654588435187520934.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9660432360886209922.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.50062e+06 deadlock states
Detected timeout of ITS tools.
[2023-03-16 01:04:42] [INFO ] Flatten gal took : 38 ms
[2023-03-16 01:04:42] [INFO ] Flatten gal took : 27 ms
[2023-03-16 01:04:42] [INFO ] Time to serialize gal into /tmp/LTL18177602931910089979.gal : 4 ms
[2023-03-16 01:04:43] [INFO ] Time to serialize properties into /tmp/LTL2259410756864519203.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18177602931910089979.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2259410756864519203.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((p51==1)&&(p111==1))"))U((G(!("((p51==1)&&(p111==1))")))||("((!((p51==1)&&(p111==1)))&&(p446!=1))"))))))
Formula 0 simplified : FG("((p51==1)&&(p111==1))" M !"((!((p51==1)&&(p111==1)))&&(p446!=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.50062e+06 deadlock states
Detected timeout of ITS tools.
[2023-03-16 01:04:58] [INFO ] Flatten gal took : 20 ms
[2023-03-16 01:04:58] [INFO ] Applying decomposition
[2023-03-16 01:04:58] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14581414062571350933.txt' '-o' '/tmp/graph14581414062571350933.bin' '-w' '/tmp/graph14581414062571350933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14581414062571350933.bin' '-l' '-1' '-v' '-w' '/tmp/graph14581414062571350933.weights' '-q' '0' '-e' '0.001'
[2023-03-16 01:04:58] [INFO ] Decomposing Gal with order
[2023-03-16 01:04:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 01:04:58] [INFO ] Removed a total of 119 redundant transitions.
[2023-03-16 01:04:58] [INFO ] Flatten gal took : 93 ms
[2023-03-16 01:04:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 16 ms.
[2023-03-16 01:04:58] [INFO ] Time to serialize gal into /tmp/LTL9536777455920185327.gal : 19 ms
[2023-03-16 01:04:58] [INFO ] Time to serialize properties into /tmp/LTL15283479208936711941.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9536777455920185327.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15283479208936711941.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((i4.i0.u25.p51==1)&&(i5.i2.u45.p111==1))"))U((G(!("((i4.i0.u25.p51==1)&&(i5.i2.u45.p111==1))")))||("((!((i4.i0.u25.p51==1)...209
Formula 0 simplified : FG("((i4.i0.u25.p51==1)&&(i5.i2.u45.p111==1))" M !"((!((i4.i0.u25.p51==1)&&(i5.i2.u45.p111==1)))&&(i12.i0.u134.p446!=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.50062e+06 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
214 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.20811,81688,1,0,136100,1230,3429,360628,274,4138,185010
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-432-LTLFireability-05 finished in 73090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 457 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 457 transition count 408
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 442 transition count 408
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 30 place count 442 transition count 392
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 62 place count 426 transition count 392
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 424 transition count 390
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 424 transition count 390
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 108 place count 403 transition count 369
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 110 place count 402 transition count 376
Applied a total of 110 rules in 58 ms. Remains 402 /457 variables (removed 55) and now considering 376/423 (removed 47) transitions.
// Phase 1: matrix 376 rows 402 cols
[2023-03-16 01:05:01] [INFO ] Computed 86 place invariants in 4 ms
[2023-03-16 01:05:01] [INFO ] Implicit Places using invariants in 291 ms returned [209, 398]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 298 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/457 places, 376/423 transitions.
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 2 place count 399 transition count 375
Applied a total of 2 rules in 29 ms. Remains 399 /400 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 399 cols
[2023-03-16 01:05:01] [INFO ] Computed 84 place invariants in 2 ms
[2023-03-16 01:05:01] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-16 01:05:01] [INFO ] Invariant cache hit.
[2023-03-16 01:05:02] [INFO ] State equation strengthened by 144 read => feed constraints.
[2023-03-16 01:05:02] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 399/457 places, 375/423 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1457 ms. Remains : 399/457 places, 375/423 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s347 1) (EQ s398 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-06 finished in 1533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||(G(p1)&&(p2||X((p1 U p2)))))))))'
Support contains 5 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 455 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 455 transition count 421
Applied a total of 4 rules in 15 ms. Remains 455 /457 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 455 cols
[2023-03-16 01:05:02] [INFO ] Computed 86 place invariants in 4 ms
[2023-03-16 01:05:02] [INFO ] Implicit Places using invariants in 266 ms returned [236, 451]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 269 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/457 places, 421/423 transitions.
Applied a total of 0 rules in 22 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 306 ms. Remains : 453/457 places, 421/423 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (AND p0 (NOT p1)), (NOT p2)]
Running random walk in product with property : Parking-PT-432-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s46 1) (EQ s88 1)), p1:(AND (EQ s198 1) (EQ s238 1)), p2:(EQ s97 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-09 finished in 586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 457 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 457 transition count 408
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 442 transition count 408
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 442 transition count 393
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 427 transition count 393
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 425 transition count 391
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 425 transition count 391
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 108 place count 403 transition count 369
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 110 place count 402 transition count 376
Applied a total of 110 rules in 57 ms. Remains 402 /457 variables (removed 55) and now considering 376/423 (removed 47) transitions.
// Phase 1: matrix 376 rows 402 cols
[2023-03-16 01:05:03] [INFO ] Computed 86 place invariants in 8 ms
[2023-03-16 01:05:03] [INFO ] Implicit Places using invariants in 365 ms returned [209, 399]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 367 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/457 places, 376/423 transitions.
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 2 place count 399 transition count 375
Applied a total of 2 rules in 38 ms. Remains 399 /400 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 399 cols
[2023-03-16 01:05:03] [INFO ] Computed 84 place invariants in 3 ms
[2023-03-16 01:05:04] [INFO ] Implicit Places using invariants in 454 ms returned []
[2023-03-16 01:05:04] [INFO ] Invariant cache hit.
[2023-03-16 01:05:04] [INFO ] State equation strengthened by 156 read => feed constraints.
[2023-03-16 01:05:04] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 399/457 places, 375/423 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1742 ms. Remains : 399/457 places, 375/423 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s333 1), p1:(EQ s277 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 104 steps with 3 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-10 finished in 1898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 456 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 456 transition count 422
Applied a total of 2 rules in 15 ms. Remains 456 /457 variables (removed 1) and now considering 422/423 (removed 1) transitions.
// Phase 1: matrix 422 rows 456 cols
[2023-03-16 01:05:05] [INFO ] Computed 86 place invariants in 3 ms
[2023-03-16 01:05:05] [INFO ] Implicit Places using invariants in 453 ms returned [236]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 455 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 455/457 places, 422/423 transitions.
Applied a total of 0 rules in 7 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 479 ms. Remains : 455/457 places, 422/423 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s378 1) (EQ s451 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-12 finished in 647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U G(p1)))))'
Support contains 2 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 455 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 455 transition count 421
Applied a total of 4 rules in 16 ms. Remains 455 /457 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 455 cols
[2023-03-16 01:05:05] [INFO ] Computed 86 place invariants in 3 ms
[2023-03-16 01:05:06] [INFO ] Implicit Places using invariants in 461 ms returned [236, 451]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 468 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/457 places, 421/423 transitions.
Applied a total of 0 rules in 8 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 492 ms. Remains : 453/457 places, 421/423 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s393 1), p0:(NEQ s286 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 914 reset in 596 ms.
Product exploration explored 100000 steps with 905 reset in 627 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 307 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 89 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 421 rows 453 cols
[2023-03-16 01:05:08] [INFO ] Computed 84 place invariants in 3 ms
[2023-03-16 01:05:08] [INFO ] [Real]Absence check using 84 positive place invariants in 30 ms returned sat
[2023-03-16 01:05:09] [INFO ] After 277ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-16 01:05:09] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-16 01:05:09] [INFO ] After 81ms SMT Verify possible using 108 Read/Feed constraints in real domain returned unsat :0 sat :2 real:1
[2023-03-16 01:05:09] [INFO ] After 187ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 01:05:09] [INFO ] After 672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 01:05:09] [INFO ] [Nat]Absence check using 84 positive place invariants in 34 ms returned sat
[2023-03-16 01:05:09] [INFO ] After 308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 01:05:10] [INFO ] After 138ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 01:05:10] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-16 01:05:10] [INFO ] After 925ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 421/421 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 453 transition count 407
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 439 transition count 407
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 28 place count 439 transition count 393
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 56 place count 425 transition count 393
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 104 place count 401 transition count 369
Free-agglomeration rule applied 116 times.
Iterating global reduction 2 with 116 rules applied. Total rules applied 220 place count 401 transition count 253
Reduce places removed 116 places and 0 transitions.
Graph (complete) has 584 edges and 285 vertex of which 149 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.1 ms
Discarding 136 places :
Also discarding 116 output transitions
Drop transitions removed 116 transitions
Iterating post reduction 2 with 117 rules applied. Total rules applied 337 place count 149 transition count 137
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 345 place count 149 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 346 place count 148 transition count 128
Reduce places removed 44 places and 0 transitions.
Graph (trivial) has 124 edges and 104 vertex of which 94 / 104 are part of one of the 2 SCC in 4 ms
Free SCC test removed 92 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 49 rules applied. Total rules applied 395 place count 12 transition count 124
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 122 rules applied. Total rules applied 517 place count 8 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 519 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 519 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 523 place count 4 transition count 4
Applied a total of 523 rules in 51 ms. Remains 4 /453 variables (removed 449) and now considering 4/421 (removed 417) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 4/453 places, 4/421 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 446 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Applied a total of 0 rules in 7 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2023-03-16 01:05:11] [INFO ] Invariant cache hit.
[2023-03-16 01:05:11] [INFO ] Implicit Places using invariants in 520 ms returned []
[2023-03-16 01:05:11] [INFO ] Invariant cache hit.
[2023-03-16 01:05:12] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-16 01:05:12] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
[2023-03-16 01:05:12] [INFO ] Invariant cache hit.
[2023-03-16 01:05:13] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1804 ms. Remains : 453/453 places, 421/421 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 92 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:05:13] [INFO ] Invariant cache hit.
[2023-03-16 01:05:13] [INFO ] [Real]Absence check using 84 positive place invariants in 34 ms returned sat
[2023-03-16 01:05:14] [INFO ] After 284ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 01:05:14] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-16 01:05:14] [INFO ] After 69ms SMT Verify possible using 108 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-16 01:05:14] [INFO ] After 118ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-16 01:05:14] [INFO ] After 605ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:14] [INFO ] [Nat]Absence check using 84 positive place invariants in 33 ms returned sat
[2023-03-16 01:05:14] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:14] [INFO ] After 75ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:14] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-16 01:05:14] [INFO ] After 601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 421/421 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 453 transition count 407
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 439 transition count 407
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 28 place count 439 transition count 393
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 56 place count 425 transition count 393
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 104 place count 401 transition count 369
Free-agglomeration rule applied 116 times.
Iterating global reduction 2 with 116 rules applied. Total rules applied 220 place count 401 transition count 253
Reduce places removed 116 places and 0 transitions.
Graph (complete) has 584 edges and 285 vertex of which 149 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.1 ms
Discarding 136 places :
Also discarding 116 output transitions
Drop transitions removed 116 transitions
Iterating post reduction 2 with 117 rules applied. Total rules applied 337 place count 149 transition count 137
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 345 place count 149 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 346 place count 148 transition count 128
Reduce places removed 44 places and 0 transitions.
Graph (trivial) has 124 edges and 104 vertex of which 94 / 104 are part of one of the 2 SCC in 0 ms
Free SCC test removed 92 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 49 rules applied. Total rules applied 395 place count 12 transition count 124
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 122 rules applied. Total rules applied 517 place count 8 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 519 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 519 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 523 place count 4 transition count 4
Applied a total of 523 rules in 44 ms. Remains 4 /453 variables (removed 449) and now considering 4/421 (removed 417) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 4/453 places, 4/421 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 437 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 909 reset in 713 ms.
Product exploration explored 100000 steps with 908 reset in 601 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 453 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 453 transition count 421
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 14 place count 453 transition count 421
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 28 place count 453 transition count 421
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 42 place count 439 transition count 407
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 56 place count 439 transition count 407
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 80 place count 439 transition count 423
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 80 rules in 75 ms. Remains 439 /453 variables (removed 14) and now considering 423/421 (removed -2) transitions.
[2023-03-16 01:05:17] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 423 rows 439 cols
[2023-03-16 01:05:17] [INFO ] Computed 84 place invariants in 2 ms
[2023-03-16 01:05:17] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 439/453 places, 423/421 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 509 ms. Remains : 439/453 places, 423/421 transitions.
Built C files in :
/tmp/ltsmin670256228704662494
[2023-03-16 01:05:18] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin670256228704662494
Running compilation step : cd /tmp/ltsmin670256228704662494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1055 ms.
Running link step : cd /tmp/ltsmin670256228704662494;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin670256228704662494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10333820816262046870.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Applied a total of 0 rules in 7 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 453 cols
[2023-03-16 01:05:33] [INFO ] Computed 84 place invariants in 2 ms
[2023-03-16 01:05:33] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-16 01:05:33] [INFO ] Invariant cache hit.
[2023-03-16 01:05:33] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-16 01:05:34] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
[2023-03-16 01:05:34] [INFO ] Invariant cache hit.
[2023-03-16 01:05:34] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1416 ms. Remains : 453/453 places, 421/421 transitions.
Built C files in :
/tmp/ltsmin14369021279419951632
[2023-03-16 01:05:34] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14369021279419951632
Running compilation step : cd /tmp/ltsmin14369021279419951632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1044 ms.
Running link step : cd /tmp/ltsmin14369021279419951632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14369021279419951632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14872524929678544283.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 01:05:49] [INFO ] Flatten gal took : 86 ms
[2023-03-16 01:05:49] [INFO ] Flatten gal took : 31 ms
[2023-03-16 01:05:49] [INFO ] Time to serialize gal into /tmp/LTL12824830840120688218.gal : 5 ms
[2023-03-16 01:05:49] [INFO ] Time to serialize properties into /tmp/LTL11490835830103518670.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12824830840120688218.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2258724867219159360.hoa' '-atoms' '/tmp/LTL11490835830103518670.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11490835830103518670.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2258724867219159360.hoa
Detected timeout of ITS tools.
[2023-03-16 01:06:04] [INFO ] Flatten gal took : 18 ms
[2023-03-16 01:06:04] [INFO ] Flatten gal took : 18 ms
[2023-03-16 01:06:04] [INFO ] Time to serialize gal into /tmp/LTL15404373207745282133.gal : 3 ms
[2023-03-16 01:06:04] [INFO ] Time to serialize properties into /tmp/LTL6791742100310890664.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15404373207745282133.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6791742100310890664.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(("(p328!=1)")U(G("(p454!=1)"))))))
Formula 0 simplified : XX(!"(p328!=1)" R F!"(p454!=1)")
Detected timeout of ITS tools.
[2023-03-16 01:06:20] [INFO ] Flatten gal took : 17 ms
[2023-03-16 01:06:20] [INFO ] Applying decomposition
[2023-03-16 01:06:20] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14008264385828070724.txt' '-o' '/tmp/graph14008264385828070724.bin' '-w' '/tmp/graph14008264385828070724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14008264385828070724.bin' '-l' '-1' '-v' '-w' '/tmp/graph14008264385828070724.weights' '-q' '0' '-e' '0.001'
[2023-03-16 01:06:20] [INFO ] Decomposing Gal with order
[2023-03-16 01:06:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 01:06:20] [INFO ] Removed a total of 58 redundant transitions.
[2023-03-16 01:06:20] [INFO ] Flatten gal took : 45 ms
[2023-03-16 01:06:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2023-03-16 01:06:20] [INFO ] Time to serialize gal into /tmp/LTL7700872676928276700.gal : 14 ms
[2023-03-16 01:06:20] [INFO ] Time to serialize properties into /tmp/LTL629606550754648068.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7700872676928276700.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL629606550754648068.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X(("(i8.u101.p328!=1)")U(G("(i14.i1.i3.u138.p454!=1)"))))))
Formula 0 simplified : XX(!"(i8.u101.p328!=1)" R F!"(i14.i1.i3.u138.p454!=1)")
Reverse transition relation is NOT exact ! Due to transitions i3.u46.t104, i5.u81.t70, i8.u118.t36, i14.i1.i3.u154.t2, Intersection with reachable at each...218
Computing Next relation with stutter on 1.50062e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13277438459868151600
[2023-03-16 01:06:35] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13277438459868151600
Running compilation step : cd /tmp/ltsmin13277438459868151600;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1014 ms.
Running link step : cd /tmp/ltsmin13277438459868151600;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13277438459868151600;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(((LTLAPp0==true) U []((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Parking-PT-432-LTLFireability-14 finished in 104567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 3 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 455 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 455 transition count 421
Applied a total of 4 rules in 31 ms. Remains 455 /457 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 455 cols
[2023-03-16 01:06:50] [INFO ] Computed 86 place invariants in 2 ms
[2023-03-16 01:06:50] [INFO ] Implicit Places using invariants in 357 ms returned [236, 451]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 364 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/457 places, 421/423 transitions.
Applied a total of 0 rules in 30 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 426 ms. Remains : 453/457 places, 421/423 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (NEQ s281 1) (NEQ s345 1)), p0:(EQ s262 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 868 steps with 7 reset in 4 ms.
FORMULA Parking-PT-432-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-15 finished in 626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U G(p1)))))'
Found a Lengthening insensitive property : Parking-PT-432-LTLFireability-14
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 457 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 456 transition count 408
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 442 transition count 408
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 28 place count 442 transition count 394
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 56 place count 428 transition count 394
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 426 transition count 392
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 426 transition count 392
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 104 place count 404 transition count 370
Applied a total of 104 rules in 32 ms. Remains 404 /457 variables (removed 53) and now considering 370/423 (removed 53) transitions.
// Phase 1: matrix 370 rows 404 cols
[2023-03-16 01:06:51] [INFO ] Computed 86 place invariants in 3 ms
[2023-03-16 01:06:51] [INFO ] Implicit Places using invariants in 339 ms returned [209, 401]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 341 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 402/457 places, 370/423 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 400 transition count 368
Applied a total of 4 rules in 15 ms. Remains 400 /402 variables (removed 2) and now considering 368/370 (removed 2) transitions.
// Phase 1: matrix 368 rows 400 cols
[2023-03-16 01:06:51] [INFO ] Computed 84 place invariants in 2 ms
[2023-03-16 01:06:52] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-16 01:06:52] [INFO ] Invariant cache hit.
[2023-03-16 01:06:52] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 911 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 400/457 places, 368/423 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1299 ms. Remains : 400/457 places, 368/423 transitions.
Running random walk in product with property : Parking-PT-432-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s349 1), p0:(NEQ s254 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 928 reset in 482 ms.
Product exploration explored 100000 steps with 938 reset in 558 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 399 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 01:06:54] [INFO ] Invariant cache hit.
[2023-03-16 01:06:54] [INFO ] [Real]Absence check using 84 positive place invariants in 30 ms returned sat
[2023-03-16 01:06:54] [INFO ] After 399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 01:06:55] [INFO ] [Nat]Absence check using 84 positive place invariants in 21 ms returned sat
[2023-03-16 01:06:55] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 01:06:55] [INFO ] After 258ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-16 01:06:55] [INFO ] After 409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 368/368 transitions.
Free-agglomeration rule applied 116 times.
Iterating global reduction 0 with 116 rules applied. Total rules applied 116 place count 400 transition count 252
Reduce places removed 196 places and 0 transitions.
Graph (complete) has 252 edges and 204 vertex of which 104 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.0 ms
Discarding 100 places :
Also discarding 124 output transitions
Drop transitions removed 124 transitions
Graph (trivial) has 124 edges and 104 vertex of which 94 / 104 are part of one of the 2 SCC in 0 ms
Free SCC test removed 92 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 202 rules applied. Total rules applied 318 place count 12 transition count 124
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 122 rules applied. Total rules applied 440 place count 8 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 442 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 442 place count 6 transition count 4
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 446 place count 4 transition count 4
Applied a total of 446 rules in 19 ms. Remains 4 /400 variables (removed 396) and now considering 4/368 (removed 364) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 4/400 places, 4/368 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 345 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 368/368 transitions.
Applied a total of 0 rules in 6 ms. Remains 400 /400 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2023-03-16 01:06:56] [INFO ] Invariant cache hit.
[2023-03-16 01:06:56] [INFO ] Implicit Places using invariants in 341 ms returned []
[2023-03-16 01:06:56] [INFO ] Invariant cache hit.
[2023-03-16 01:06:57] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
[2023-03-16 01:06:57] [INFO ] Invariant cache hit.
[2023-03-16 01:06:57] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1285 ms. Remains : 400/400 places, 368/368 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 273 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 01:06:58] [INFO ] Invariant cache hit.
[2023-03-16 01:06:58] [INFO ] [Real]Absence check using 84 positive place invariants in 29 ms returned sat
[2023-03-16 01:06:58] [INFO ] After 384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 01:06:58] [INFO ] [Nat]Absence check using 84 positive place invariants in 27 ms returned sat
[2023-03-16 01:06:58] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 01:06:58] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-16 01:06:59] [INFO ] After 509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 368/368 transitions.
Free-agglomeration rule applied 116 times.
Iterating global reduction 0 with 116 rules applied. Total rules applied 116 place count 400 transition count 252
Reduce places removed 196 places and 0 transitions.
Graph (complete) has 252 edges and 204 vertex of which 104 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.0 ms
Discarding 100 places :
Also discarding 124 output transitions
Drop transitions removed 124 transitions
Graph (trivial) has 124 edges and 104 vertex of which 94 / 104 are part of one of the 2 SCC in 0 ms
Free SCC test removed 92 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 202 rules applied. Total rules applied 318 place count 12 transition count 124
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 122 rules applied. Total rules applied 440 place count 8 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 442 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 442 place count 6 transition count 4
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 446 place count 4 transition count 4
Applied a total of 446 rules in 26 ms. Remains 4 /400 variables (removed 396) and now considering 4/368 (removed 364) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 4/400 places, 4/368 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 512 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 934 reset in 495 ms.
Product exploration explored 100000 steps with 929 reset in 579 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 368/368 transitions.
Applied a total of 0 rules in 7 ms. Remains 400 /400 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2023-03-16 01:07:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-16 01:07:01] [INFO ] Invariant cache hit.
[2023-03-16 01:07:01] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 371 ms. Remains : 400/400 places, 368/368 transitions.
Built C files in :
/tmp/ltsmin15412024904082643238
[2023-03-16 01:07:02] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15412024904082643238
Running compilation step : cd /tmp/ltsmin15412024904082643238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 859 ms.
Running link step : cd /tmp/ltsmin15412024904082643238;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15412024904082643238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15277564070622767463.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 368/368 transitions.
Applied a total of 0 rules in 4 ms. Remains 400 /400 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2023-03-16 01:07:17] [INFO ] Invariant cache hit.
[2023-03-16 01:07:17] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-16 01:07:17] [INFO ] Invariant cache hit.
[2023-03-16 01:07:17] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
[2023-03-16 01:07:17] [INFO ] Invariant cache hit.
[2023-03-16 01:07:18] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1102 ms. Remains : 400/400 places, 368/368 transitions.
Built C files in :
/tmp/ltsmin16998987026340311640
[2023-03-16 01:07:18] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16998987026340311640
Running compilation step : cd /tmp/ltsmin16998987026340311640;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1150 ms.
Running link step : cd /tmp/ltsmin16998987026340311640;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16998987026340311640;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16176580821396385683.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 01:07:33] [INFO ] Flatten gal took : 26 ms
[2023-03-16 01:07:33] [INFO ] Flatten gal took : 12 ms
[2023-03-16 01:07:33] [INFO ] Time to serialize gal into /tmp/LTL16201854438408293717.gal : 3 ms
[2023-03-16 01:07:33] [INFO ] Time to serialize properties into /tmp/LTL9504508585322339699.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16201854438408293717.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16496236584895101569.hoa' '-atoms' '/tmp/LTL9504508585322339699.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9504508585322339699.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16496236584895101569.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.50062e+06 deadlock states
Detected timeout of ITS tools.
[2023-03-16 01:07:48] [INFO ] Flatten gal took : 19 ms
[2023-03-16 01:07:48] [INFO ] Flatten gal took : 20 ms
[2023-03-16 01:07:48] [INFO ] Time to serialize gal into /tmp/LTL9945411851459111574.gal : 4 ms
[2023-03-16 01:07:48] [INFO ] Time to serialize properties into /tmp/LTL4849578231458986005.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9945411851459111574.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4849578231458986005.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(("(p328!=1)")U(G("(p454!=1)"))))))
Formula 0 simplified : XX(!"(p328!=1)" R F!"(p454!=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.50062e+06 deadlock states
Detected timeout of ITS tools.
[2023-03-16 01:08:03] [INFO ] Flatten gal took : 21 ms
[2023-03-16 01:08:03] [INFO ] Applying decomposition
[2023-03-16 01:08:03] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13392297152220138819.txt' '-o' '/tmp/graph13392297152220138819.bin' '-w' '/tmp/graph13392297152220138819.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13392297152220138819.bin' '-l' '-1' '-v' '-w' '/tmp/graph13392297152220138819.weights' '-q' '0' '-e' '0.001'
[2023-03-16 01:08:03] [INFO ] Decomposing Gal with order
[2023-03-16 01:08:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 01:08:03] [INFO ] Removed a total of 120 redundant transitions.
[2023-03-16 01:08:03] [INFO ] Flatten gal took : 24 ms
[2023-03-16 01:08:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 6 ms.
[2023-03-16 01:08:03] [INFO ] Time to serialize gal into /tmp/LTL6854492289636063807.gal : 5 ms
[2023-03-16 01:08:03] [INFO ] Time to serialize properties into /tmp/LTL14594099933451571130.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6854492289636063807.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14594099933451571130.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(("(i10.i1.u100.p328!=1)")U(G("(i11.i3.u135.p454!=1)"))))))
Formula 0 simplified : XX(!"(i10.i1.u100.p328!=1)" R F!"(i11.i3.u135.p454!=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.50062e+06 deadlock states
5 unique states visited
4 strongly connected components in search stack
7 transitions explored
5 items max in DFS search stack
632 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.37888,195496,1,0,261331,1186,3400,1.41362e+06,263,4421,153677
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property Parking-PT-432-LTLFireability-14 finished in 80339 ms.
FORMULA Parking-PT-432-LTLFireability-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-16 01:08:11] [INFO ] Flatten gal took : 12 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 274565 ms.
BK_STOP 1678928892420
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Parking-PT-432"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Parking-PT-432, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r261-smll-167863536400436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-432.tgz
mv Parking-PT-432 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;