About the Execution of 2023-gold for ShieldPPPt-PT-100A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5861.899 | 1585931.00 | 2634772.00 | 9830.20 | FFTTFFFTFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789300433.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldPPPt-PT-100A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789300433
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 11 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 685K May 18 16:43 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 ShieldPPPt-PT-100A-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716991866356
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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 14:11:08] [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]
[2024-05-29 14:11:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:11:08] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2024-05-29 14:11:08] [INFO ] Transformed 2503 places.
[2024-05-29 14:11:08] [INFO ] Transformed 1803 transitions.
[2024-05-29 14:11:08] [INFO ] Found NUPN structural information;
[2024-05-29 14:11:08] [INFO ] Parsed PT model containing 2503 places and 1803 transitions and 7206 arcs in 343 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-100A-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 234 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2024-05-29 14:11:09] [INFO ] Computed 1101 invariants in 36 ms
[2024-05-29 14:11:10] [INFO ] Implicit Places using invariants in 1811 ms returned []
[2024-05-29 14:11:10] [INFO ] Invariant cache hit.
[2024-05-29 14:11:12] [INFO ] Implicit Places using invariants and state equation in 1983 ms returned []
Implicit Place search using SMT with State Equation took 3857 ms to find 0 implicit places.
[2024-05-29 14:11:12] [INFO ] Invariant cache hit.
[2024-05-29 14:11:14] [INFO ] Dead Transitions using invariants and state equation in 1214 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5308 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Support contains 54 out of 2503 places after structural reductions.
[2024-05-29 14:11:14] [INFO ] Flatten gal took : 356 ms
[2024-05-29 14:11:14] [INFO ] Flatten gal took : 231 ms
[2024-05-29 14:11:15] [INFO ] Input system was already deterministic with 1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 30) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2024-05-29 14:11:16] [INFO ] Invariant cache hit.
[2024-05-29 14:11:18] [INFO ] [Real]Absence check using 1101 positive place invariants in 234 ms returned sat
[2024-05-29 14:11:22] [INFO ] After 6501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2024-05-29 14:11:24] [INFO ] [Nat]Absence check using 1101 positive place invariants in 205 ms returned sat
[2024-05-29 14:11:42] [INFO ] After 17426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2024-05-29 14:11:47] [INFO ] After 22755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-29 14:11:47] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 19 properties in 6226 ms.
Support contains 10 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 397 times.
Drop transitions removed 397 transitions
Iterating global reduction 0 with 397 rules applied. Total rules applied 401 place count 2501 transition count 1800
Applied a total of 401 rules in 467 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 468 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 88115 steps, run timeout after 3002 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88115 steps, saw 84262 distinct states, run finished after 3007 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:11:58] [INFO ] Computed 1101 invariants in 21 ms
[2024-05-29 14:11:59] [INFO ] [Real]Absence check using 1101 positive place invariants in 235 ms returned sat
[2024-05-29 14:12:01] [INFO ] After 2672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 14:12:02] [INFO ] [Nat]Absence check using 1101 positive place invariants in 217 ms returned sat
[2024-05-29 14:12:07] [INFO ] After 4895ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 14:12:07] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-29 14:12:12] [INFO ] After 5473ms SMT Verify possible using 101 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 14:12:14] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 4 ms to minimize.
[2024-05-29 14:12:14] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 1 ms to minimize.
[2024-05-29 14:12:14] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 1 ms to minimize.
[2024-05-29 14:12:15] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 2 ms to minimize.
[2024-05-29 14:12:15] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2024-05-29 14:12:16] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2024-05-29 14:12:17] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:12:17] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 1 ms to minimize.
[2024-05-29 14:12:17] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:12:17] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:12:17] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 2 ms to minimize.
[2024-05-29 14:12:18] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:12:19] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2024-05-29 14:12:19] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:12:19] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 3 ms to minimize.
[2024-05-29 14:12:19] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2024-05-29 14:12:19] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2024-05-29 14:12:20] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 0 ms to minimize.
[2024-05-29 14:12:20] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:12:20] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:12:20] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6461 ms
[2024-05-29 14:12:21] [INFO ] After 14768ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 635 ms.
[2024-05-29 14:12:22] [INFO ] After 21275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1249 ms.
Support contains 10 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 153 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 126 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2024-05-29 14:12:24] [INFO ] Invariant cache hit.
[2024-05-29 14:12:25] [INFO ] Implicit Places using invariants in 1440 ms returned []
[2024-05-29 14:12:25] [INFO ] Invariant cache hit.
[2024-05-29 14:12:26] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-29 14:12:27] [INFO ] Implicit Places using invariants and state equation in 2349 ms returned []
Implicit Place search using SMT with State Equation took 3790 ms to find 0 implicit places.
[2024-05-29 14:12:28] [INFO ] Redundant transitions in 140 ms returned []
[2024-05-29 14:12:28] [INFO ] Invariant cache hit.
[2024-05-29 14:12:29] [INFO ] Dead Transitions using invariants and state equation in 1251 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5319 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Graph (complete) has 7289 edges and 2501 vertex of which 2500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2498 transition count 1798
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 104 place count 2498 transition count 1798
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 203 place count 2498 transition count 1699
Applied a total of 203 rules in 391 ms. Remains 2498 /2501 variables (removed 3) and now considering 1699/1800 (removed 101) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1699 rows 2498 cols
[2024-05-29 14:12:29] [INFO ] Computed 1100 invariants in 7 ms
[2024-05-29 14:12:30] [INFO ] [Real]Absence check using 1100 positive place invariants in 223 ms returned sat
[2024-05-29 14:12:32] [INFO ] After 2796ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 14:12:33] [INFO ] [Nat]Absence check using 1100 positive place invariants in 220 ms returned sat
[2024-05-29 14:12:40] [INFO ] After 6877ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 14:12:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:12:45] [INFO ] After 5308ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 14:12:50] [INFO ] After 10285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 3689 ms.
[2024-05-29 14:12:54] [INFO ] After 21822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(p0)||X(!p1)) U p0)))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 226 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:12:56] [INFO ] Computed 1101 invariants in 10 ms
[2024-05-29 14:12:57] [INFO ] Implicit Places using invariants in 1415 ms returned []
[2024-05-29 14:12:57] [INFO ] Invariant cache hit.
[2024-05-29 14:12:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:12:59] [INFO ] Implicit Places using invariants and state equation in 2073 ms returned []
Implicit Place search using SMT with State Equation took 3490 ms to find 0 implicit places.
[2024-05-29 14:13:00] [INFO ] Redundant transitions in 40 ms returned []
[2024-05-29 14:13:00] [INFO ] Invariant cache hit.
[2024-05-29 14:13:01] [INFO ] Dead Transitions using invariants and state equation in 1269 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 1800/1802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5038 ms. Remains : 2501/2503 places, 1800/1802 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s611 1) (EQ s621 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1514 ms.
Stack based approach found an accepted trace after 54 steps with 0 reset with depth 55 and stack size 55 in 2 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-00 finished in 8431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (G(!p0)||(!p0&&(p1 U p2)))))))))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 80 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2024-05-29 14:13:03] [INFO ] Computed 1101 invariants in 14 ms
[2024-05-29 14:13:04] [INFO ] Implicit Places using invariants in 1355 ms returned []
[2024-05-29 14:13:04] [INFO ] Invariant cache hit.
[2024-05-29 14:13:06] [INFO ] Implicit Places using invariants and state equation in 1894 ms returned []
Implicit Place search using SMT with State Equation took 3251 ms to find 0 implicit places.
[2024-05-29 14:13:06] [INFO ] Invariant cache hit.
[2024-05-29 14:13:07] [INFO ] Dead Transitions using invariants and state equation in 1257 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4590 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 1804 ms :[p0, p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s168 1) (EQ s175 1)), p2:(EQ s2370 1), p1:(AND (EQ s2342 1) (EQ s2344 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 107 reset in 1497 ms.
Product exploration explored 100000 steps with 94 reset in 1888 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 (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 1169 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[p0, p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 14:13:14] [INFO ] Invariant cache hit.
[2024-05-29 14:13:15] [INFO ] [Real]Absence check using 1101 positive place invariants in 225 ms returned sat
[2024-05-29 14:13:17] [INFO ] After 2119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:13:17] [INFO ] [Nat]Absence check using 1101 positive place invariants in 225 ms returned sat
[2024-05-29 14:13:21] [INFO ] After 3546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:13:21] [INFO ] After 4019ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 315 ms.
[2024-05-29 14:13:22] [INFO ] After 5167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 843 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 402 place count 2501 transition count 1800
Applied a total of 402 rules in 262 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 104397 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104397 steps, saw 101113 distinct states, run finished after 3003 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:13:26] [INFO ] Computed 1101 invariants in 16 ms
[2024-05-29 14:13:27] [INFO ] [Real]Absence check using 1101 positive place invariants in 232 ms returned sat
[2024-05-29 14:13:28] [INFO ] After 2046ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:13:29] [INFO ] [Nat]Absence check using 1101 positive place invariants in 224 ms returned sat
[2024-05-29 14:13:32] [INFO ] After 2496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:13:32] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 14:13:36] [INFO ] After 4433ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 14:13:37] [INFO ] After 4914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 312 ms.
[2024-05-29 14:13:37] [INFO ] After 8559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 679 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 91 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 85 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2024-05-29 14:13:38] [INFO ] Invariant cache hit.
[2024-05-29 14:13:39] [INFO ] Implicit Places using invariants in 1492 ms returned []
[2024-05-29 14:13:39] [INFO ] Invariant cache hit.
[2024-05-29 14:13:40] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 14:13:42] [INFO ] Implicit Places using invariants and state equation in 2387 ms returned []
Implicit Place search using SMT with State Equation took 3882 ms to find 0 implicit places.
[2024-05-29 14:13:42] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-29 14:13:42] [INFO ] Invariant cache hit.
[2024-05-29 14:13:43] [INFO ] Dead Transitions using invariants and state equation in 1177 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5200 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Graph (complete) has 7289 edges and 2501 vertex of which 2500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2498 transition count 1798
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 105 place count 2498 transition count 1798
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 205 place count 2498 transition count 1698
Applied a total of 205 rules in 261 ms. Remains 2498 /2501 variables (removed 3) and now considering 1698/1800 (removed 102) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1698 rows 2498 cols
[2024-05-29 14:13:43] [INFO ] Computed 1100 invariants in 7 ms
[2024-05-29 14:13:44] [INFO ] [Real]Absence check using 1100 positive place invariants in 208 ms returned sat
[2024-05-29 14:13:45] [INFO ] After 2135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:13:46] [INFO ] [Nat]Absence check using 1100 positive place invariants in 225 ms returned sat
[2024-05-29 14:13:51] [INFO ] After 4754ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:13:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:13:53] [INFO ] After 1741ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 14:13:53] [INFO ] After 2199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 307 ms.
[2024-05-29 14:13:53] [INFO ] After 8067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 197 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[p0, p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 188 ms :[p0, p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 74 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2024-05-29 14:13:54] [INFO ] Computed 1101 invariants in 6 ms
[2024-05-29 14:13:56] [INFO ] Implicit Places using invariants in 1338 ms returned []
[2024-05-29 14:13:56] [INFO ] Invariant cache hit.
[2024-05-29 14:13:57] [INFO ] Implicit Places using invariants and state equation in 1779 ms returned []
Implicit Place search using SMT with State Equation took 3121 ms to find 0 implicit places.
[2024-05-29 14:13:57] [INFO ] Invariant cache hit.
[2024-05-29 14:13:58] [INFO ] Dead Transitions using invariants and state equation in 1174 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4372 ms. Remains : 2503/2503 places, 1802/1802 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 (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 119 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[p0, p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 14:13:59] [INFO ] Invariant cache hit.
[2024-05-29 14:14:00] [INFO ] [Real]Absence check using 1101 positive place invariants in 235 ms returned sat
[2024-05-29 14:14:02] [INFO ] After 2188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:14:02] [INFO ] [Nat]Absence check using 1101 positive place invariants in 224 ms returned sat
[2024-05-29 14:14:06] [INFO ] After 3448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:14:06] [INFO ] After 3928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 321 ms.
[2024-05-29 14:14:07] [INFO ] After 4969ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 782 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 402 place count 2501 transition count 1800
Applied a total of 402 rules in 240 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 102663 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102663 steps, saw 99411 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:14:11] [INFO ] Computed 1101 invariants in 5 ms
[2024-05-29 14:14:12] [INFO ] [Real]Absence check using 1101 positive place invariants in 226 ms returned sat
[2024-05-29 14:14:13] [INFO ] After 2001ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:14:14] [INFO ] [Nat]Absence check using 1101 positive place invariants in 233 ms returned sat
[2024-05-29 14:14:16] [INFO ] After 2445ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:14:16] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 14:14:21] [INFO ] After 4667ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 14:14:22] [INFO ] After 5149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 319 ms.
[2024-05-29 14:14:22] [INFO ] After 8749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 647 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 78 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 78 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2024-05-29 14:14:23] [INFO ] Invariant cache hit.
[2024-05-29 14:14:24] [INFO ] Implicit Places using invariants in 1440 ms returned []
[2024-05-29 14:14:24] [INFO ] Invariant cache hit.
[2024-05-29 14:14:25] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 14:14:27] [INFO ] Implicit Places using invariants and state equation in 2389 ms returned []
Implicit Place search using SMT with State Equation took 3831 ms to find 0 implicit places.
[2024-05-29 14:14:27] [INFO ] Redundant transitions in 40 ms returned []
[2024-05-29 14:14:27] [INFO ] Invariant cache hit.
[2024-05-29 14:14:28] [INFO ] Dead Transitions using invariants and state equation in 1175 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5132 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Graph (complete) has 7289 edges and 2501 vertex of which 2500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2498 transition count 1798
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 105 place count 2498 transition count 1798
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 205 place count 2498 transition count 1698
Applied a total of 205 rules in 242 ms. Remains 2498 /2501 variables (removed 3) and now considering 1698/1800 (removed 102) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1698 rows 2498 cols
[2024-05-29 14:14:28] [INFO ] Computed 1100 invariants in 8 ms
[2024-05-29 14:14:29] [INFO ] [Real]Absence check using 1100 positive place invariants in 218 ms returned sat
[2024-05-29 14:14:30] [INFO ] After 2105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:14:31] [INFO ] [Nat]Absence check using 1100 positive place invariants in 248 ms returned sat
[2024-05-29 14:14:36] [INFO ] After 4620ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:14:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:14:37] [INFO ] After 1599ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 14:14:38] [INFO ] After 2058ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 312 ms.
[2024-05-29 14:14:38] [INFO ] After 7861ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 190 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[p0, p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 197 ms :[p0, p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 181 ms :[p0, p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 88 reset in 1420 ms.
Product exploration explored 100000 steps with 96 reset in 1850 ms.
Built C files in :
/tmp/ltsmin13693195843153275290
[2024-05-29 14:14:42] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13693195843153275290
Running compilation step : cd /tmp/ltsmin13693195843153275290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13693195843153275290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13693195843153275290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 71 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2024-05-29 14:14:45] [INFO ] Computed 1101 invariants in 10 ms
[2024-05-29 14:14:47] [INFO ] Implicit Places using invariants in 1355 ms returned []
[2024-05-29 14:14:47] [INFO ] Invariant cache hit.
[2024-05-29 14:14:48] [INFO ] Implicit Places using invariants and state equation in 1398 ms returned []
Implicit Place search using SMT with State Equation took 2755 ms to find 0 implicit places.
[2024-05-29 14:14:48] [INFO ] Invariant cache hit.
[2024-05-29 14:14:49] [INFO ] Dead Transitions using invariants and state equation in 1206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4037 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Built C files in :
/tmp/ltsmin12443986939008925157
[2024-05-29 14:14:49] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12443986939008925157
Running compilation step : cd /tmp/ltsmin12443986939008925157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12443986939008925157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12443986939008925157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:14:53] [INFO ] Flatten gal took : 124 ms
[2024-05-29 14:14:53] [INFO ] Flatten gal took : 118 ms
[2024-05-29 14:14:53] [INFO ] Time to serialize gal into /tmp/LTL7522888664480186010.gal : 27 ms
[2024-05-29 14:14:53] [INFO ] Time to serialize properties into /tmp/LTL4855724355295445550.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7522888664480186010.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9194269183275875588.hoa' '-atoms' '/tmp/LTL4855724355295445550.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4855724355295445550.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9194269183275875588.hoa
Detected timeout of ITS tools.
[2024-05-29 14:15:08] [INFO ] Flatten gal took : 113 ms
[2024-05-29 14:15:08] [INFO ] Flatten gal took : 126 ms
[2024-05-29 14:15:08] [INFO ] Time to serialize gal into /tmp/LTL38768649270355010.gal : 15 ms
[2024-05-29 14:15:08] [INFO ] Time to serialize properties into /tmp/LTL16262939493893811361.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL38768649270355010.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16262939493893811361.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("((p168==1)&&(p175==1))"))U((G(!("((p168==1)&&(p175==1))")))||((!("((p168==1)&&(p175==1))"))&&(("((p2342==1)&&(p2344==1))...209
Formula 0 simplified : FG(!"((p168==0)||(p175==0))" | X((!"((p2342==1)&&(p2344==1))" R !"(p2370==1)") U "((p168==1)&&(p175==1))"))
Detected timeout of ITS tools.
[2024-05-29 14:15:23] [INFO ] Flatten gal took : 117 ms
[2024-05-29 14:15:23] [INFO ] Applying decomposition
[2024-05-29 14:15:24] [INFO ] Flatten gal took : 112 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1819639826760503706.txt' '-o' '/tmp/graph1819639826760503706.bin' '-w' '/tmp/graph1819639826760503706.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1819639826760503706.bin' '-l' '-1' '-v' '-w' '/tmp/graph1819639826760503706.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:15:24] [INFO ] Decomposing Gal with order
[2024-05-29 14:15:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:15:24] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-29 14:15:24] [INFO ] Flatten gal took : 191 ms
[2024-05-29 14:15:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 407 ms.
[2024-05-29 14:15:25] [INFO ] Time to serialize gal into /tmp/LTL10201745530244325512.gal : 43 ms
[2024-05-29 14:15:25] [INFO ] Time to serialize properties into /tmp/LTL7258033926708048036.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10201745530244325512.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7258033926708048036.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("((i3.i1.i1.i2.u52.p168==1)&&(i3.i1.i0.i3.u55.p175==1))"))U((G(!("((i3.i1.i1.i2.u52.p168==1)&&(i3.i1.i0.i3.u55.p175==1))"...364
Formula 0 simplified : FG(!"((i3.i1.i1.i2.u52.p168==0)||(i3.i1.i0.i3.u55.p175==0))" | X((!"((i30.u748.p2342==1)&&(i30.u748.p2344==1))" R !"(i30.u757.p2370=...221
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3740683425338473297
[2024-05-29 14:15:40] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3740683425338473297
Running compilation step : cd /tmp/ltsmin3740683425338473297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3740683425338473297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3740683425338473297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100A-LTLFireability-01 finished in 160359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F((p1&&X((p1 U (p2||G(p1)))))))))'
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 70 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2024-05-29 14:15:43] [INFO ] Invariant cache hit.
[2024-05-29 14:15:44] [INFO ] Implicit Places using invariants in 1408 ms returned []
[2024-05-29 14:15:44] [INFO ] Invariant cache hit.
[2024-05-29 14:15:46] [INFO ] Implicit Places using invariants and state equation in 1938 ms returned []
Implicit Place search using SMT with State Equation took 3347 ms to find 0 implicit places.
[2024-05-29 14:15:46] [INFO ] Invariant cache hit.
[2024-05-29 14:15:48] [INFO ] Dead Transitions using invariants and state equation in 1214 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4632 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s724 0), p1:(OR (NEQ s676 1) (NEQ s495 1)), p2:(NEQ s676 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 5386 ms.
Product exploration explored 100000 steps with 33333 reset in 5679 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 p0 p1 p2), (X p1), (X p0), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 94 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-100A-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100A-LTLFireability-03 finished in 16024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U X(p1)))))'
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 164 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:15:59] [INFO ] Computed 1101 invariants in 9 ms
[2024-05-29 14:16:01] [INFO ] Implicit Places using invariants in 1432 ms returned []
[2024-05-29 14:16:01] [INFO ] Invariant cache hit.
[2024-05-29 14:16:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:16:02] [INFO ] Implicit Places using invariants and state equation in 1966 ms returned []
Implicit Place search using SMT with State Equation took 3399 ms to find 0 implicit places.
[2024-05-29 14:16:03] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-29 14:16:03] [INFO ] Invariant cache hit.
[2024-05-29 14:16:04] [INFO ] Dead Transitions using invariants and state equation in 1210 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 1800/1802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4819 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}, { cond=p0, acceptance={1} source=0 dest: 2}, { cond=p0, acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s2063 1) (EQ s2077 1)), p1:(EQ s1474 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1381 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 66 in 1 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-04 finished in 6410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 164 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
[2024-05-29 14:16:05] [INFO ] Invariant cache hit.
[2024-05-29 14:16:07] [INFO ] Implicit Places using invariants in 1342 ms returned []
[2024-05-29 14:16:07] [INFO ] Invariant cache hit.
[2024-05-29 14:16:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:16:09] [INFO ] Implicit Places using invariants and state equation in 1991 ms returned []
Implicit Place search using SMT with State Equation took 3348 ms to find 0 implicit places.
[2024-05-29 14:16:09] [INFO ] Redundant transitions in 42 ms returned []
[2024-05-29 14:16:09] [INFO ] Invariant cache hit.
[2024-05-29 14:16:10] [INFO ] Dead Transitions using invariants and state equation in 1187 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 1800/1802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4751 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s2286 1) (EQ s2296 1)), p1:(AND (EQ s515 1) (EQ s549 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8 reset in 1362 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-05 finished in 6206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(X(G(p1))&&G(p2))))'
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 75 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2024-05-29 14:16:12] [INFO ] Computed 1101 invariants in 8 ms
[2024-05-29 14:16:13] [INFO ] Implicit Places using invariants in 1387 ms returned []
[2024-05-29 14:16:13] [INFO ] Invariant cache hit.
[2024-05-29 14:16:15] [INFO ] Implicit Places using invariants and state equation in 1907 ms returned []
Implicit Place search using SMT with State Equation took 3296 ms to find 0 implicit places.
[2024-05-29 14:16:15] [INFO ] Invariant cache hit.
[2024-05-29 14:16:16] [INFO ] Dead Transitions using invariants and state equation in 1171 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4544 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s454 1) (EQ s473 1)), p2:(OR (EQ s1566 0) (EQ s1577 0)), p1:(OR (EQ s2136 0) (EQ s2146 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1532 ms.
Product exploration explored 100000 steps with 0 reset in 1995 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 (NOT p0) p2 p1), (X (NOT p0)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (AND (NOT p0) p2 p1)), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p0) p2 p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 101 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
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))), (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))), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 92115 steps, run timeout after 3008 ms. (steps per millisecond=30 ) properties seen :{2=1, 5=1}
Probabilistic random walk after 92115 steps, saw 91178 distinct states, run finished after 3008 ms. (steps per millisecond=30 ) properties seen :2
Running SMT prover for 5 properties.
[2024-05-29 14:16:24] [INFO ] Invariant cache hit.
[2024-05-29 14:16:25] [INFO ] [Real]Absence check using 1101 positive place invariants in 223 ms returned sat
[2024-05-29 14:16:27] [INFO ] After 2977ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 14:16:28] [INFO ] [Nat]Absence check using 1101 positive place invariants in 228 ms returned sat
[2024-05-29 14:16:33] [INFO ] After 4644ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 14:16:34] [INFO ] After 5444ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 534 ms.
[2024-05-29 14:16:34] [INFO ] After 6954ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1348 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 402 place count 2501 transition count 1800
Applied a total of 402 rules in 250 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 86218 steps, run timeout after 3002 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86218 steps, saw 82414 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:16:40] [INFO ] Computed 1101 invariants in 4 ms
[2024-05-29 14:16:41] [INFO ] [Real]Absence check using 1101 positive place invariants in 232 ms returned sat
[2024-05-29 14:16:43] [INFO ] After 2672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 14:16:43] [INFO ] [Nat]Absence check using 1101 positive place invariants in 230 ms returned sat
[2024-05-29 14:16:48] [INFO ] After 4783ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 14:16:48] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-29 14:16:53] [INFO ] After 4166ms SMT Verify possible using 101 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 14:16:55] [INFO ] After 6541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2692 ms.
[2024-05-29 14:16:58] [INFO ] After 15011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 8513 steps, including 3 resets, run visited all 5 properties in 224 ms. (steps per millisecond=38 )
Parikh walk visited 5 properties in 223 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (AND (NOT p0) p2 p1)), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p0) p2 p1)))]
False Knowledge obtained : [(F (AND p1 p0 p2)), (F (AND p1 p0 (NOT p2))), (F p0), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))), (F (AND (NOT p1) p0 (NOT p2))), (F (NOT (AND p1 (NOT p0) p2))), (F (AND (NOT p1) p0 p2))]
Knowledge based reduction with 7 factoid took 332 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 254 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))), (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))), (NOT p0)]
Stuttering acceptance computed with spot in 252 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))), (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))), (NOT p0)]
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 168 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:16:59] [INFO ] Computed 1101 invariants in 8 ms
[2024-05-29 14:17:00] [INFO ] Implicit Places using invariants in 1406 ms returned []
[2024-05-29 14:17:00] [INFO ] Invariant cache hit.
[2024-05-29 14:17:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:17:02] [INFO ] Implicit Places using invariants and state equation in 2017 ms returned []
Implicit Place search using SMT with State Equation took 3425 ms to find 0 implicit places.
[2024-05-29 14:17:02] [INFO ] Redundant transitions in 40 ms returned []
[2024-05-29 14:17:02] [INFO ] Invariant cache hit.
[2024-05-29 14:17:04] [INFO ] Dead Transitions using invariants and state equation in 1212 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 1800/1802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4851 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p0 p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 141 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 245 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))), (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))), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 95912 steps, run timeout after 3003 ms. (steps per millisecond=31 ) properties seen :{2=1, 5=1}
Probabilistic random walk after 95912 steps, saw 94757 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :2
Running SMT prover for 5 properties.
[2024-05-29 14:17:08] [INFO ] Invariant cache hit.
[2024-05-29 14:17:09] [INFO ] [Real]Absence check using 1101 positive place invariants in 230 ms returned sat
[2024-05-29 14:17:11] [INFO ] After 2694ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 14:17:12] [INFO ] [Nat]Absence check using 1101 positive place invariants in 229 ms returned sat
[2024-05-29 14:17:15] [INFO ] After 3060ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 14:17:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:17:15] [INFO ] After 521ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 14:17:16] [INFO ] After 1287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 545 ms.
[2024-05-29 14:17:17] [INFO ] After 5910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1510 ms.
Support contains 6 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2501 transition count 1800
Applied a total of 398 rules in 157 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 84500 steps, run timeout after 3002 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84500 steps, saw 80741 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:17:22] [INFO ] Computed 1101 invariants in 16 ms
[2024-05-29 14:17:23] [INFO ] [Real]Absence check using 1101 positive place invariants in 229 ms returned sat
[2024-05-29 14:17:25] [INFO ] After 2699ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 14:17:26] [INFO ] [Nat]Absence check using 1101 positive place invariants in 225 ms returned sat
[2024-05-29 14:17:30] [INFO ] After 4500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 14:17:30] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-29 14:17:35] [INFO ] After 4164ms SMT Verify possible using 101 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 14:17:37] [INFO ] After 6558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2704 ms.
[2024-05-29 14:17:40] [INFO ] After 14744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 8693 steps, including 2 resets, run visited all 5 properties in 241 ms. (steps per millisecond=36 )
Parikh walk visited 5 properties in 241 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p0 p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p0 p2))))]
False Knowledge obtained : [(F (AND p1 p0 p2)), (F (AND p1 p0 (NOT p2))), (F p0), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))), (F (AND (NOT p1) p0 (NOT p2))), (F (NOT (AND p1 (NOT p0) p2))), (F (AND (NOT p1) p0 p2))]
Knowledge based reduction with 15 factoid took 432 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 281 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))), (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))), (NOT p0)]
Stuttering acceptance computed with spot in 280 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))), (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))), (NOT p0)]
Stuttering acceptance computed with spot in 255 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))), (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))), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1377 ms.
Stack based approach found an accepted trace after 60227 steps with 0 reset with depth 60228 and stack size 32359 in 1107 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-06 finished in 92235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(p1)||(!p2 U (G((!p2||G(!p1)))||(p3&&(!p2||G(!p1))))))))'
Support contains 7 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 74 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2024-05-29 14:17:44] [INFO ] Computed 1101 invariants in 12 ms
[2024-05-29 14:17:45] [INFO ] Implicit Places using invariants in 1396 ms returned []
[2024-05-29 14:17:45] [INFO ] Invariant cache hit.
[2024-05-29 14:17:47] [INFO ] Implicit Places using invariants and state equation in 1939 ms returned []
Implicit Place search using SMT with State Equation took 3339 ms to find 0 implicit places.
[2024-05-29 14:17:47] [INFO ] Invariant cache hit.
[2024-05-29 14:17:48] [INFO ] Dead Transitions using invariants and state equation in 1224 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4639 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 273 ms :[true, (NOT p1), false, false, false, false, p1, (AND p1 p2)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(OR (AND p2 p0) (AND (NOT p3) p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(OR (AND p2 (NOT p1) p0) (AND (NOT p1) (NOT p3) p0)), acceptance={} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 0}, { cond=(NOT p1), acceptance={} source=6 dest: 6}], [{ cond=(AND p2 p1), acceptance={} source=7 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 7}]], initial=2, aps=[p1:(EQ s722 1), p2:(AND (EQ s1181 1) (EQ s1196 1)), p0:(AND (EQ s908 1) (EQ s925 1)), p3:(OR (AND (EQ s1181 1) (EQ s1196 1)) (AND (EQ s1918 1) (EQ s1925 1...], 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, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1450 ms.
Product exploration explored 100000 steps with 0 reset in 1828 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 (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p1)), (X (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0))), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (NOT (OR (AND p2 (NOT p1) p0) (AND (NOT p1) (NOT p3) p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), true, (X (X (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (OR (AND p2 (NOT p1) p0) (AND (NOT p1) (NOT p3) p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 107 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[true, (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 106265 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{1=1, 2=1, 3=1}
Probabilistic random walk after 106265 steps, saw 105271 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :3
Running SMT prover for 3 properties.
[2024-05-29 14:17:56] [INFO ] Invariant cache hit.
[2024-05-29 14:17:57] [INFO ] [Real]Absence check using 1101 positive place invariants in 234 ms returned sat
[2024-05-29 14:17:58] [INFO ] After 1932ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:17:59] [INFO ] [Nat]Absence check using 1101 positive place invariants in 222 ms returned sat
[2024-05-29 14:18:02] [INFO ] After 2619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:18:03] [INFO ] After 3939ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 298 ms.
[2024-05-29 14:18:03] [INFO ] After 5031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 679 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 402 place count 2501 transition count 1800
Applied a total of 402 rules in 232 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 110139 steps, run timeout after 3018 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110139 steps, saw 105740 distinct states, run finished after 3018 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:18:08] [INFO ] Computed 1101 invariants in 4 ms
[2024-05-29 14:18:08] [INFO ] [Real]Absence check using 1101 positive place invariants in 215 ms returned sat
[2024-05-29 14:18:10] [INFO ] After 1886ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:18:10] [INFO ] [Nat]Absence check using 1101 positive place invariants in 230 ms returned sat
[2024-05-29 14:18:13] [INFO ] After 2195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:18:13] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-29 14:18:14] [INFO ] After 1088ms SMT Verify possible using 101 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 14:18:14] [INFO ] After 1529ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 301 ms.
[2024-05-29 14:18:15] [INFO ] After 4852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 515 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 80 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 78 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2024-05-29 14:18:15] [INFO ] Invariant cache hit.
[2024-05-29 14:18:17] [INFO ] Implicit Places using invariants in 1444 ms returned []
[2024-05-29 14:18:17] [INFO ] Invariant cache hit.
[2024-05-29 14:18:17] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-29 14:18:19] [INFO ] Implicit Places using invariants and state equation in 2452 ms returned []
Implicit Place search using SMT with State Equation took 3897 ms to find 0 implicit places.
[2024-05-29 14:18:19] [INFO ] Redundant transitions in 42 ms returned []
[2024-05-29 14:18:19] [INFO ] Invariant cache hit.
[2024-05-29 14:18:20] [INFO ] Dead Transitions using invariants and state equation in 1183 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5205 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Graph (complete) has 7293 edges and 2501 vertex of which 2500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2498 transition count 1798
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 104 place count 2498 transition count 1798
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 203 place count 2498 transition count 1699
Applied a total of 203 rules in 263 ms. Remains 2498 /2501 variables (removed 3) and now considering 1699/1800 (removed 101) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1699 rows 2498 cols
[2024-05-29 14:18:21] [INFO ] Computed 1100 invariants in 9 ms
[2024-05-29 14:18:21] [INFO ] [Real]Absence check using 1100 positive place invariants in 230 ms returned sat
[2024-05-29 14:18:23] [INFO ] After 1916ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:18:23] [INFO ] [Nat]Absence check using 1100 positive place invariants in 227 ms returned sat
[2024-05-29 14:18:26] [INFO ] After 2929ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:18:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:18:27] [INFO ] After 294ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 14:18:27] [INFO ] After 732ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 287 ms.
[2024-05-29 14:18:27] [INFO ] After 4806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p1)), (X (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0))), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (NOT (OR (AND p2 (NOT p1) p0) (AND (NOT p1) (NOT p3) p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), true, (X (X (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (OR (AND p2 (NOT p1) p0) (AND (NOT p1) (NOT p3) p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (NOT (AND (NOT p2) (NOT p3)))), (F (AND (NOT p1) (NOT p2) p3))]
Knowledge based reduction with 16 factoid took 239 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter insensitive) to 6 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 220 ms :[true, (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1]
Stuttering acceptance computed with spot in 206 ms :[true, (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1]
Support contains 5 out of 2503 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 161 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:18:28] [INFO ] Computed 1101 invariants in 5 ms
[2024-05-29 14:18:30] [INFO ] Implicit Places using invariants in 1390 ms returned []
[2024-05-29 14:18:30] [INFO ] Invariant cache hit.
[2024-05-29 14:18:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:18:32] [INFO ] Implicit Places using invariants and state equation in 1913 ms returned []
Implicit Place search using SMT with State Equation took 3303 ms to find 0 implicit places.
[2024-05-29 14:18:32] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-29 14:18:32] [INFO ] Invariant cache hit.
[2024-05-29 14:18:33] [INFO ] Dead Transitions using invariants and state equation in 1184 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 1800/1802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4696 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND p1 p2))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 222 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter insensitive) to 6 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[true, (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 96747 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{1=1, 2=1, 4=1}
Probabilistic random walk after 96747 steps, saw 95588 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :3
Running SMT prover for 3 properties.
[2024-05-29 14:18:37] [INFO ] Invariant cache hit.
[2024-05-29 14:18:38] [INFO ] [Real]Absence check using 1101 positive place invariants in 217 ms returned sat
[2024-05-29 14:18:39] [INFO ] After 1880ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:18:40] [INFO ] [Nat]Absence check using 1101 positive place invariants in 231 ms returned sat
[2024-05-29 14:18:44] [INFO ] After 3555ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:18:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:18:44] [INFO ] After 273ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 14:18:44] [INFO ] After 698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 279 ms.
[2024-05-29 14:18:45] [INFO ] After 5323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 747 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2501 transition count 1800
Applied a total of 398 rules in 154 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 105233 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105233 steps, saw 100958 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:18:49] [INFO ] Computed 1101 invariants in 9 ms
[2024-05-29 14:18:50] [INFO ] [Real]Absence check using 1101 positive place invariants in 222 ms returned sat
[2024-05-29 14:18:51] [INFO ] After 1923ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:18:52] [INFO ] [Nat]Absence check using 1101 positive place invariants in 230 ms returned sat
[2024-05-29 14:18:55] [INFO ] After 3199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:18:55] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-29 14:18:57] [INFO ] After 1683ms SMT Verify possible using 101 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 14:18:57] [INFO ] After 2119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 299 ms.
[2024-05-29 14:18:57] [INFO ] After 6470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 640 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 76 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 75 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2024-05-29 14:18:58] [INFO ] Invariant cache hit.
[2024-05-29 14:19:00] [INFO ] Implicit Places using invariants in 1410 ms returned []
[2024-05-29 14:19:00] [INFO ] Invariant cache hit.
[2024-05-29 14:19:01] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-29 14:19:09] [INFO ] Implicit Places using invariants and state equation in 9789 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11214 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 1800/1800 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 90 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2024-05-29 14:19:09] [INFO ] Computed 1100 invariants in 7 ms
[2024-05-29 14:19:12] [INFO ] Implicit Places using invariants in 2033 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2038 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2496/2501 places, 1798/1800 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2494 transition count 1796
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 168 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2024-05-29 14:19:12] [INFO ] Computed 1098 invariants in 9 ms
[2024-05-29 14:19:13] [INFO ] Implicit Places using invariants in 1691 ms returned []
[2024-05-29 14:19:13] [INFO ] Invariant cache hit.
[2024-05-29 14:19:15] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-29 14:19:20] [INFO ] Implicit Places using invariants and state equation in 6754 ms returned []
Implicit Place search using SMT with State Equation took 8450 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2494/2501 places, 1796/1800 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 22038 ms. Remains : 2494/2501 places, 1796/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 103354 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103354 steps, saw 99125 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-29 14:19:24] [INFO ] Invariant cache hit.
[2024-05-29 14:19:24] [INFO ] [Real]Absence check using 1098 positive place invariants in 221 ms returned sat
[2024-05-29 14:19:26] [INFO ] After 1739ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:19:26] [INFO ] [Nat]Absence check using 1098 positive place invariants in 220 ms returned sat
[2024-05-29 14:19:29] [INFO ] After 2303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:19:29] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-29 14:19:30] [INFO ] After 913ms SMT Verify possible using 99 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 14:19:30] [INFO ] After 1534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 346 ms.
[2024-05-29 14:19:31] [INFO ] After 4868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 355 ms.
Support contains 5 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 256 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 82 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
[2024-05-29 14:19:31] [INFO ] Invariant cache hit.
[2024-05-29 14:19:33] [INFO ] Implicit Places using invariants in 1637 ms returned []
[2024-05-29 14:19:33] [INFO ] Invariant cache hit.
[2024-05-29 14:19:34] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-29 14:19:41] [INFO ] Implicit Places using invariants and state equation in 7740 ms returned []
Implicit Place search using SMT with State Equation took 9379 ms to find 0 implicit places.
[2024-05-29 14:19:41] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-29 14:19:41] [INFO ] Invariant cache hit.
[2024-05-29 14:19:42] [INFO ] Dead Transitions using invariants and state equation in 1471 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10983 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 2494 transition count 1796
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 2494 transition count 1697
Applied a total of 198 rules in 262 ms. Remains 2494 /2494 variables (removed 0) and now considering 1697/1796 (removed 99) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1697 rows 2494 cols
[2024-05-29 14:19:42] [INFO ] Computed 1098 invariants in 5 ms
[2024-05-29 14:19:43] [INFO ] [Real]Absence check using 1098 positive place invariants in 232 ms returned sat
[2024-05-29 14:19:44] [INFO ] After 1793ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:19:45] [INFO ] [Nat]Absence check using 1098 positive place invariants in 225 ms returned sat
[2024-05-29 14:19:47] [INFO ] After 2541ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:19:48] [INFO ] After 3070ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 357 ms.
[2024-05-29 14:19:48] [INFO ] After 4129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND p1 p2))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND (NOT p2) p3 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 14 factoid took 232 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter insensitive) to 6 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 206 ms :[true, (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1]
Stuttering acceptance computed with spot in 234 ms :[true, (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1]
Stuttering acceptance computed with spot in 187 ms :[true, (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1]
Product exploration explored 100000 steps with 0 reset in 1413 ms.
Product exploration explored 100000 steps with 0 reset in 1853 ms.
Built C files in :
/tmp/ltsmin18148537952571173442
[2024-05-29 14:19:52] [INFO ] Too many transitions (1800) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:19:53] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18148537952571173442
Running compilation step : cd /tmp/ltsmin18148537952571173442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18148537952571173442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18148537952571173442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 93 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:19:56] [INFO ] Computed 1101 invariants in 7 ms
[2024-05-29 14:19:57] [INFO ] Implicit Places using invariants in 1372 ms returned []
[2024-05-29 14:19:57] [INFO ] Invariant cache hit.
[2024-05-29 14:19:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:19:59] [INFO ] Implicit Places using invariants and state equation in 1895 ms returned []
Implicit Place search using SMT with State Equation took 3268 ms to find 0 implicit places.
[2024-05-29 14:19:59] [INFO ] Redundant transitions in 37 ms returned []
[2024-05-29 14:19:59] [INFO ] Invariant cache hit.
[2024-05-29 14:20:00] [INFO ] Dead Transitions using invariants and state equation in 1201 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4613 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Built C files in :
/tmp/ltsmin11569405153967600060
[2024-05-29 14:20:00] [INFO ] Too many transitions (1800) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:20:00] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11569405153967600060
Running compilation step : cd /tmp/ltsmin11569405153967600060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11569405153967600060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11569405153967600060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:20:03] [INFO ] Flatten gal took : 101 ms
[2024-05-29 14:20:03] [INFO ] Flatten gal took : 105 ms
[2024-05-29 14:20:03] [INFO ] Time to serialize gal into /tmp/LTL14348358220666127870.gal : 10 ms
[2024-05-29 14:20:03] [INFO ] Time to serialize properties into /tmp/LTL5031948095769311945.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14348358220666127870.gal' '-t' 'CGAL' '-hoa' '/tmp/aut159597907203486508.hoa' '-atoms' '/tmp/LTL5031948095769311945.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5031948095769311945.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut159597907203486508.hoa
Detected timeout of ITS tools.
[2024-05-29 14:20:19] [INFO ] Flatten gal took : 99 ms
[2024-05-29 14:20:19] [INFO ] Flatten gal took : 100 ms
[2024-05-29 14:20:19] [INFO ] Time to serialize gal into /tmp/LTL17411110879923281948.gal : 9 ms
[2024-05-29 14:20:19] [INFO ] Time to serialize properties into /tmp/LTL15258441345327083957.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17411110879923281948.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15258441345327083957.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((("((p908==1)&&(p925==1))")U((X("(p722==1)"))||((!("((p1181==1)&&(p1196==1))"))U((G((!("((p1181==1)&&(p1196==1))"))||(G("(p722!=1)")...276
Formula 0 simplified : !"((p908==1)&&(p925==1))" R (X!"(p722==1)" & ("((p1181==1)&&(p1196==1))" R (F("((p1181==1)&&(p1196==1))" & F!"(p722!=1)") & (!"(((p1...254
Detected timeout of ITS tools.
[2024-05-29 14:20:34] [INFO ] Flatten gal took : 100 ms
[2024-05-29 14:20:34] [INFO ] Applying decomposition
[2024-05-29 14:20:34] [INFO ] Flatten gal took : 98 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph710619648779595829.txt' '-o' '/tmp/graph710619648779595829.bin' '-w' '/tmp/graph710619648779595829.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph710619648779595829.bin' '-l' '-1' '-v' '-w' '/tmp/graph710619648779595829.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:20:34] [INFO ] Decomposing Gal with order
[2024-05-29 14:20:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:20:35] [INFO ] Removed a total of 299 redundant transitions.
[2024-05-29 14:20:35] [INFO ] Flatten gal took : 88 ms
[2024-05-29 14:20:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 177 ms.
[2024-05-29 14:20:35] [INFO ] Time to serialize gal into /tmp/LTL5595280546528165252.gal : 21 ms
[2024-05-29 14:20:35] [INFO ] Time to serialize properties into /tmp/LTL2995834442560683829.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5595280546528165252.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2995834442560683829.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((("((i10.u290.p908==1)&&(i10.u295.p925==1))")U((X("(i8.i1.i2.i1.u230.p722==1)"))||((!("((i14.u378.p1181==1)&&(i14.u381.p1196==1))"))...435
Formula 0 simplified : !"((i10.u290.p908==1)&&(i10.u295.p925==1))" R (X!"(i8.i1.i2.i1.u230.p722==1)" & ("((i14.u378.p1181==1)&&(i14.u381.p1196==1))" R (F("...413
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12315931215265329569
[2024-05-29 14:20:50] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12315931215265329569
Running compilation step : cd /tmp/ltsmin12315931215265329569;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12315931215265329569;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12315931215265329569;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100A-LTLFireability-07 finished in 189218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 92 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2024-05-29 14:20:53] [INFO ] Computed 1101 invariants in 8 ms
[2024-05-29 14:20:54] [INFO ] Implicit Places using invariants in 1340 ms returned []
[2024-05-29 14:20:54] [INFO ] Invariant cache hit.
[2024-05-29 14:20:56] [INFO ] Implicit Places using invariants and state equation in 1894 ms returned []
Implicit Place search using SMT with State Equation took 3234 ms to find 0 implicit places.
[2024-05-29 14:20:56] [INFO ] Invariant cache hit.
[2024-05-29 14:20:58] [INFO ] Dead Transitions using invariants and state equation in 1192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4521 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (AND (EQ s2031 1) (EQ s2046 1)) (AND (EQ s1618 1) (EQ s1625 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-09 finished in 4711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 83 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2024-05-29 14:20:58] [INFO ] Invariant cache hit.
[2024-05-29 14:20:59] [INFO ] Implicit Places using invariants in 1486 ms returned []
[2024-05-29 14:20:59] [INFO ] Invariant cache hit.
[2024-05-29 14:21:01] [INFO ] Implicit Places using invariants and state equation in 1938 ms returned []
Implicit Place search using SMT with State Equation took 3426 ms to find 0 implicit places.
[2024-05-29 14:21:01] [INFO ] Invariant cache hit.
[2024-05-29 14:21:02] [INFO ] Dead Transitions using invariants and state equation in 1237 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4750 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2501 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 19028 reset in 3576 ms.
Product exploration explored 100000 steps with 19060 reset in 3938 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2024-05-29 14:21:10] [INFO ] Invariant cache hit.
[2024-05-29 14:21:13] [INFO ] [Real]Absence check using 1101 positive place invariants in 893 ms returned sat
[2024-05-29 14:21:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:21:16] [INFO ] [Real]Absence check using state equation in 2319 ms returned sat
[2024-05-29 14:21:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:21:19] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1030 ms returned sat
[2024-05-29 14:21:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:21:21] [INFO ] [Nat]Absence check using state equation in 2659 ms returned sat
[2024-05-29 14:21:22] [INFO ] Computed and/alt/rep : 1801/5599/1801 causal constraints (skipped 0 transitions) in 115 ms.
[2024-05-29 14:21:31] [INFO ] Added : 418 causal constraints over 84 iterations in 9137 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 1 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 1800
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 2498 transition count 1798
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 2497 transition count 1797
Applied a total of 9 rules in 275 ms. Remains 2497 /2503 variables (removed 6) and now considering 1797/1802 (removed 5) transitions.
// Phase 1: matrix 1797 rows 2497 cols
[2024-05-29 14:21:31] [INFO ] Computed 1100 invariants in 6 ms
[2024-05-29 14:21:32] [INFO ] Implicit Places using invariants in 1315 ms returned []
[2024-05-29 14:21:32] [INFO ] Invariant cache hit.
[2024-05-29 14:21:36] [INFO ] Implicit Places using invariants and state equation in 3286 ms returned [2480, 2484]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4607 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2495/2503 places, 1797/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2493 transition count 1795
Applied a total of 4 rules in 185 ms. Remains 2493 /2495 variables (removed 2) and now considering 1795/1797 (removed 2) transitions.
// Phase 1: matrix 1795 rows 2493 cols
[2024-05-29 14:21:36] [INFO ] Computed 1098 invariants in 5 ms
[2024-05-29 14:21:38] [INFO ] Implicit Places using invariants in 1799 ms returned []
[2024-05-29 14:21:38] [INFO ] Invariant cache hit.
[2024-05-29 14:21:39] [INFO ] Implicit Places using invariants and state equation in 1770 ms returned []
Implicit Place search using SMT with State Equation took 3576 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2493/2503 places, 1795/1802 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8643 ms. Remains : 2493/2503 places, 1795/1802 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 191 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2024-05-29 14:21:40] [INFO ] Invariant cache hit.
[2024-05-29 14:21:43] [INFO ] [Real]Absence check using 1098 positive place invariants in 862 ms returned sat
[2024-05-29 14:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:21:45] [INFO ] [Real]Absence check using state equation in 2172 ms returned sat
[2024-05-29 14:21:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:21:48] [INFO ] [Nat]Absence check using 1098 positive place invariants in 992 ms returned sat
[2024-05-29 14:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:21:51] [INFO ] [Nat]Absence check using state equation in 2598 ms returned sat
[2024-05-29 14:21:51] [INFO ] Computed and/alt/rep : 1793/2689/1793 causal constraints (skipped 0 transitions) in 111 ms.
[2024-05-29 14:22:02] [INFO ] Deduced a trap composed of 2 places in 1892 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 14:22:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 30959 reset in 2186 ms.
Product exploration explored 100000 steps with 30785 reset in 2537 ms.
Built C files in :
/tmp/ltsmin14592738748324296673
[2024-05-29 14:22:07] [INFO ] Too many transitions (1795) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:22:07] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14592738748324296673
Running compilation step : cd /tmp/ltsmin14592738748324296673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14592738748324296673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14592738748324296673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 2493 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2493/2493 places, 1795/1795 transitions.
Applied a total of 0 rules in 100 ms. Remains 2493 /2493 variables (removed 0) and now considering 1795/1795 (removed 0) transitions.
[2024-05-29 14:22:10] [INFO ] Invariant cache hit.
[2024-05-29 14:22:11] [INFO ] Implicit Places using invariants in 1293 ms returned []
[2024-05-29 14:22:11] [INFO ] Invariant cache hit.
[2024-05-29 14:22:15] [INFO ] Implicit Places using invariants and state equation in 3477 ms returned []
Implicit Place search using SMT with State Equation took 4772 ms to find 0 implicit places.
[2024-05-29 14:22:15] [INFO ] Redundant transitions in 43 ms returned []
[2024-05-29 14:22:15] [INFO ] Invariant cache hit.
[2024-05-29 14:22:16] [INFO ] Dead Transitions using invariants and state equation in 1318 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6246 ms. Remains : 2493/2493 places, 1795/1795 transitions.
Built C files in :
/tmp/ltsmin12693131563119688786
[2024-05-29 14:22:16] [INFO ] Too many transitions (1795) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:22:16] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12693131563119688786
Running compilation step : cd /tmp/ltsmin12693131563119688786;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12693131563119688786;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12693131563119688786;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:22:19] [INFO ] Flatten gal took : 63 ms
[2024-05-29 14:22:19] [INFO ] Flatten gal took : 48 ms
[2024-05-29 14:22:19] [INFO ] Time to serialize gal into /tmp/LTL10728283691728357149.gal : 8 ms
[2024-05-29 14:22:19] [INFO ] Time to serialize properties into /tmp/LTL1595688130495937839.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10728283691728357149.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9587501477313856217.hoa' '-atoms' '/tmp/LTL1595688130495937839.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1595688130495937839.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9587501477313856217.hoa
Detected timeout of ITS tools.
[2024-05-29 14:22:34] [INFO ] Flatten gal took : 48 ms
[2024-05-29 14:22:34] [INFO ] Flatten gal took : 48 ms
[2024-05-29 14:22:34] [INFO ] Time to serialize gal into /tmp/LTL1330819104560228116.gal : 7 ms
[2024-05-29 14:22:34] [INFO ] Time to serialize properties into /tmp/LTL14679954044513614213.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1330819104560228116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14679954044513614213.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("(p2501==1)"))))
Formula 0 simplified : XG!"(p2501==1)"
Detected timeout of ITS tools.
[2024-05-29 14:22:50] [INFO ] Flatten gal took : 47 ms
[2024-05-29 14:22:50] [INFO ] Applying decomposition
[2024-05-29 14:22:50] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2125516509843777028.txt' '-o' '/tmp/graph2125516509843777028.bin' '-w' '/tmp/graph2125516509843777028.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2125516509843777028.bin' '-l' '-1' '-v' '-w' '/tmp/graph2125516509843777028.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:22:50] [INFO ] Decomposing Gal with order
[2024-05-29 14:22:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:22:50] [INFO ] Removed a total of 299 redundant transitions.
[2024-05-29 14:22:50] [INFO ] Flatten gal took : 74 ms
[2024-05-29 14:22:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 10 ms.
[2024-05-29 14:22:50] [INFO ] Time to serialize gal into /tmp/LTL3216485082572094230.gal : 15 ms
[2024-05-29 14:22:50] [INFO ] Time to serialize properties into /tmp/LTL12761051837484135027.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3216485082572094230.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12761051837484135027.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F("(i32.i1.i1.i0.u800.p2501==1)"))))
Formula 0 simplified : XG!"(i32.i1.i1.i0.u800.p2501==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10442449569022398979
[2024-05-29 14:23:05] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10442449569022398979
Running compilation step : cd /tmp/ltsmin10442449569022398979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10442449569022398979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10442449569022398979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100A-LTLFireability-10 finished in 130352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 1800
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 2498 transition count 1798
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 2497 transition count 1797
Applied a total of 9 rules in 277 ms. Remains 2497 /2503 variables (removed 6) and now considering 1797/1802 (removed 5) transitions.
// Phase 1: matrix 1797 rows 2497 cols
[2024-05-29 14:23:08] [INFO ] Computed 1100 invariants in 7 ms
[2024-05-29 14:23:10] [INFO ] Implicit Places using invariants in 1447 ms returned []
[2024-05-29 14:23:10] [INFO ] Invariant cache hit.
[2024-05-29 14:23:12] [INFO ] Implicit Places using invariants and state equation in 1891 ms returned []
Implicit Place search using SMT with State Equation took 3340 ms to find 0 implicit places.
[2024-05-29 14:23:12] [INFO ] Redundant transitions in 40 ms returned []
[2024-05-29 14:23:12] [INFO ] Invariant cache hit.
[2024-05-29 14:23:13] [INFO ] Dead Transitions using invariants and state equation in 1203 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2497/2503 places, 1797/1802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4866 ms. Remains : 2497/2503 places, 1797/1802 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2219 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5 reset in 1368 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-11 finished in 6500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&F(p1))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 86 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2024-05-29 14:23:15] [INFO ] Computed 1101 invariants in 11 ms
[2024-05-29 14:23:16] [INFO ] Implicit Places using invariants in 1396 ms returned []
[2024-05-29 14:23:16] [INFO ] Invariant cache hit.
[2024-05-29 14:23:18] [INFO ] Implicit Places using invariants and state equation in 1950 ms returned []
Implicit Place search using SMT with State Equation took 3347 ms to find 0 implicit places.
[2024-05-29 14:23:18] [INFO ] Invariant cache hit.
[2024-05-29 14:23:19] [INFO ] Dead Transitions using invariants and state equation in 1249 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4682 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s1065 1) (EQ s1099 1)), p0:(AND (EQ s1228 1) (EQ s1251 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1347 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-12 finished in 6197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 83 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2024-05-29 14:23:21] [INFO ] Invariant cache hit.
[2024-05-29 14:23:22] [INFO ] Implicit Places using invariants in 1401 ms returned []
[2024-05-29 14:23:22] [INFO ] Invariant cache hit.
[2024-05-29 14:23:24] [INFO ] Implicit Places using invariants and state equation in 1928 ms returned []
Implicit Place search using SMT with State Equation took 3332 ms to find 0 implicit places.
[2024-05-29 14:23:24] [INFO ] Invariant cache hit.
[2024-05-29 14:23:25] [INFO ] Dead Transitions using invariants and state equation in 1195 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4611 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(AND (EQ s1493 1) (EQ s1500 1)), p0:(AND (EQ s1537 1) (EQ s1539 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1321 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 1 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-13 finished in 6063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&X(p1)))&&G(p2))))'
Support contains 7 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 90 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2024-05-29 14:23:27] [INFO ] Invariant cache hit.
[2024-05-29 14:23:28] [INFO ] Implicit Places using invariants in 1345 ms returned []
[2024-05-29 14:23:28] [INFO ] Invariant cache hit.
[2024-05-29 14:23:32] [INFO ] Implicit Places using invariants and state equation in 3720 ms returned []
Implicit Place search using SMT with State Equation took 5066 ms to find 0 implicit places.
[2024-05-29 14:23:32] [INFO ] Invariant cache hit.
[2024-05-29 14:23:34] [INFO ] Dead Transitions using invariants and state equation in 1741 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6899 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 1}, { cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(AND (EQ s1476 0) (OR (EQ s570 0) (EQ s585 0))), p1:(OR (EQ s2378 0) (EQ s2401 0)), p0:(OR (EQ s1608 0) (EQ s1625 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1395 ms.
Product exploration explored 100000 steps with 0 reset in 1817 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 p2 p1 p0), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X p2), true, (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p2)), (X (X (AND p0 p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 121 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Finished probabilistic random walk after 48218 steps, run visited all 1 properties in 901 ms. (steps per millisecond=53 )
Probabilistic random walk after 48218 steps, saw 47506 distinct states, run finished after 905 ms. (steps per millisecond=53 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X p2), true, (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p2)), (X (X (AND p0 p2)))]
False Knowledge obtained : [(F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 11 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-100A-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100A-LTLFireability-14 finished in 11806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 182 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:23:39] [INFO ] Computed 1101 invariants in 11 ms
[2024-05-29 14:23:40] [INFO ] Implicit Places using invariants in 1313 ms returned []
[2024-05-29 14:23:40] [INFO ] Invariant cache hit.
[2024-05-29 14:23:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:23:42] [INFO ] Implicit Places using invariants and state equation in 1852 ms returned []
Implicit Place search using SMT with State Equation took 3168 ms to find 0 implicit places.
[2024-05-29 14:23:42] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-29 14:23:42] [INFO ] Invariant cache hit.
[2024-05-29 14:23:43] [INFO ] Dead Transitions using invariants and state equation in 1158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 1800/1802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4562 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1456 1) (EQ s1471 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1321 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-15 finished in 5934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (G(!p0)||(!p0&&(p1 U p2)))))))))'
Found a Shortening insensitive property : ShieldPPPt-PT-100A-LTLFireability-01
Stuttering acceptance computed with spot in 199 ms :[p0, p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 176 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
[2024-05-29 14:23:45] [INFO ] Invariant cache hit.
[2024-05-29 14:23:46] [INFO ] Implicit Places using invariants in 1347 ms returned []
[2024-05-29 14:23:46] [INFO ] Invariant cache hit.
[2024-05-29 14:23:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:23:48] [INFO ] Implicit Places using invariants and state equation in 1886 ms returned []
Implicit Place search using SMT with State Equation took 3235 ms to find 0 implicit places.
[2024-05-29 14:23:48] [INFO ] Invariant cache hit.
[2024-05-29 14:23:49] [INFO ] Dead Transitions using invariants and state equation in 1137 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2501/2503 places, 1800/1802 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4550 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s168 1) (EQ s175 1)), p2:(EQ s2370 1), p1:(AND (EQ s2342 1) (EQ s2344 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 106 reset in 1363 ms.
Product exploration explored 100000 steps with 96 reset in 1762 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[p0, p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 14:23:54] [INFO ] Invariant cache hit.
[2024-05-29 14:23:54] [INFO ] [Real]Absence check using 1101 positive place invariants in 224 ms returned sat
[2024-05-29 14:23:56] [INFO ] After 2064ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:23:56] [INFO ] [Nat]Absence check using 1101 positive place invariants in 228 ms returned sat
[2024-05-29 14:24:01] [INFO ] After 4193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:24:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:24:01] [INFO ] After 293ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 14:24:01] [INFO ] After 751ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 300 ms.
[2024-05-29 14:24:02] [INFO ] After 6113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 909 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2501 transition count 1800
Applied a total of 398 rules in 176 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 108803 steps, run timeout after 3002 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108803 steps, saw 105438 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:24:06] [INFO ] Computed 1101 invariants in 10 ms
[2024-05-29 14:24:07] [INFO ] [Real]Absence check using 1101 positive place invariants in 237 ms returned sat
[2024-05-29 14:24:09] [INFO ] After 2200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:24:09] [INFO ] [Nat]Absence check using 1101 positive place invariants in 247 ms returned sat
[2024-05-29 14:24:12] [INFO ] After 2509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:24:12] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 14:24:17] [INFO ] After 4729ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 14:24:17] [INFO ] After 5209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 320 ms.
[2024-05-29 14:24:18] [INFO ] After 8925ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 642 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 85 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 83 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2024-05-29 14:24:18] [INFO ] Invariant cache hit.
[2024-05-29 14:24:20] [INFO ] Implicit Places using invariants in 1424 ms returned []
[2024-05-29 14:24:20] [INFO ] Invariant cache hit.
[2024-05-29 14:24:20] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 14:24:22] [INFO ] Implicit Places using invariants and state equation in 2413 ms returned []
Implicit Place search using SMT with State Equation took 3837 ms to find 0 implicit places.
[2024-05-29 14:24:22] [INFO ] Redundant transitions in 42 ms returned []
[2024-05-29 14:24:22] [INFO ] Invariant cache hit.
[2024-05-29 14:24:23] [INFO ] Dead Transitions using invariants and state equation in 1146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5115 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Graph (complete) has 7289 edges and 2501 vertex of which 2500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2498 transition count 1798
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 105 place count 2498 transition count 1798
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 205 place count 2498 transition count 1698
Applied a total of 205 rules in 266 ms. Remains 2498 /2501 variables (removed 3) and now considering 1698/1800 (removed 102) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1698 rows 2498 cols
[2024-05-29 14:24:24] [INFO ] Computed 1100 invariants in 9 ms
[2024-05-29 14:24:24] [INFO ] [Real]Absence check using 1100 positive place invariants in 215 ms returned sat
[2024-05-29 14:24:26] [INFO ] After 2060ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:24:26] [INFO ] [Nat]Absence check using 1100 positive place invariants in 224 ms returned sat
[2024-05-29 14:24:31] [INFO ] After 4398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:24:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:24:33] [INFO ] After 1561ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 14:24:33] [INFO ] After 2035ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 311 ms.
[2024-05-29 14:24:33] [INFO ] After 7562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 206 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[p0, p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 193 ms :[p0, p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 95 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:24:34] [INFO ] Computed 1101 invariants in 8 ms
[2024-05-29 14:24:35] [INFO ] Implicit Places using invariants in 1309 ms returned []
[2024-05-29 14:24:35] [INFO ] Invariant cache hit.
[2024-05-29 14:24:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:24:37] [INFO ] Implicit Places using invariants and state equation in 1833 ms returned []
Implicit Place search using SMT with State Equation took 3144 ms to find 0 implicit places.
[2024-05-29 14:24:37] [INFO ] Invariant cache hit.
[2024-05-29 14:24:38] [INFO ] Dead Transitions using invariants and state equation in 1160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4399 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[p0, p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 14:24:39] [INFO ] Invariant cache hit.
[2024-05-29 14:24:40] [INFO ] [Real]Absence check using 1101 positive place invariants in 221 ms returned sat
[2024-05-29 14:24:41] [INFO ] After 2037ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:24:42] [INFO ] [Nat]Absence check using 1101 positive place invariants in 222 ms returned sat
[2024-05-29 14:24:46] [INFO ] After 4084ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:24:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:24:46] [INFO ] After 304ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 14:24:47] [INFO ] After 738ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 291 ms.
[2024-05-29 14:24:47] [INFO ] After 5940ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 572 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2501 transition count 1800
Applied a total of 398 rules in 180 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 111264 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111264 steps, saw 107834 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:24:51] [INFO ] Computed 1101 invariants in 3 ms
[2024-05-29 14:24:52] [INFO ] [Real]Absence check using 1101 positive place invariants in 224 ms returned sat
[2024-05-29 14:24:54] [INFO ] After 2057ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:24:54] [INFO ] [Nat]Absence check using 1101 positive place invariants in 222 ms returned sat
[2024-05-29 14:24:57] [INFO ] After 2390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:24:57] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 14:25:01] [INFO ] After 4402ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 14:25:02] [INFO ] After 4863ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 310 ms.
[2024-05-29 14:25:02] [INFO ] After 8398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 607 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 83 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 84 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2024-05-29 14:25:03] [INFO ] Invariant cache hit.
[2024-05-29 14:25:04] [INFO ] Implicit Places using invariants in 1388 ms returned []
[2024-05-29 14:25:04] [INFO ] Invariant cache hit.
[2024-05-29 14:25:05] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 14:25:06] [INFO ] Implicit Places using invariants and state equation in 2325 ms returned []
Implicit Place search using SMT with State Equation took 3719 ms to find 0 implicit places.
[2024-05-29 14:25:06] [INFO ] Redundant transitions in 43 ms returned []
[2024-05-29 14:25:06] [INFO ] Invariant cache hit.
[2024-05-29 14:25:08] [INFO ] Dead Transitions using invariants and state equation in 1160 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5012 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Graph (complete) has 7289 edges and 2501 vertex of which 2500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2498 transition count 1798
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 105 place count 2498 transition count 1798
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 205 place count 2498 transition count 1698
Applied a total of 205 rules in 260 ms. Remains 2498 /2501 variables (removed 3) and now considering 1698/1800 (removed 102) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1698 rows 2498 cols
[2024-05-29 14:25:08] [INFO ] Computed 1100 invariants in 10 ms
[2024-05-29 14:25:09] [INFO ] [Real]Absence check using 1100 positive place invariants in 224 ms returned sat
[2024-05-29 14:25:10] [INFO ] After 2120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:25:11] [INFO ] [Nat]Absence check using 1100 positive place invariants in 229 ms returned sat
[2024-05-29 14:25:16] [INFO ] After 4721ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:25:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:25:17] [INFO ] After 1719ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 14:25:18] [INFO ] After 2192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 313 ms.
[2024-05-29 14:25:18] [INFO ] After 8064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 181 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[p0, p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 177 ms :[p0, p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 194 ms :[p0, p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 105 reset in 1376 ms.
Product exploration explored 100000 steps with 96 reset in 1795 ms.
Built C files in :
/tmp/ltsmin16488329706602901369
[2024-05-29 14:25:22] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16488329706602901369
Running compilation step : cd /tmp/ltsmin16488329706602901369;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16488329706602901369;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16488329706602901369;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 80 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:25:25] [INFO ] Computed 1101 invariants in 7 ms
[2024-05-29 14:25:27] [INFO ] Implicit Places using invariants in 1356 ms returned []
[2024-05-29 14:25:27] [INFO ] Invariant cache hit.
[2024-05-29 14:25:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:25:29] [INFO ] Implicit Places using invariants and state equation in 1945 ms returned []
Implicit Place search using SMT with State Equation took 3303 ms to find 0 implicit places.
[2024-05-29 14:25:29] [INFO ] Invariant cache hit.
[2024-05-29 14:25:30] [INFO ] Dead Transitions using invariants and state equation in 1174 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4558 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Built C files in :
/tmp/ltsmin7442952204722291865
[2024-05-29 14:25:30] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7442952204722291865
Running compilation step : cd /tmp/ltsmin7442952204722291865;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7442952204722291865;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7442952204722291865;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:25:33] [INFO ] Flatten gal took : 97 ms
[2024-05-29 14:25:33] [INFO ] Flatten gal took : 115 ms
[2024-05-29 14:25:33] [INFO ] Time to serialize gal into /tmp/LTL9148624159164717335.gal : 12 ms
[2024-05-29 14:25:33] [INFO ] Time to serialize properties into /tmp/LTL11646298610047057271.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9148624159164717335.gal' '-t' 'CGAL' '-hoa' '/tmp/aut36648189363459323.hoa' '-atoms' '/tmp/LTL11646298610047057271.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL11646298610047057271.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut36648189363459323.hoa
Detected timeout of ITS tools.
[2024-05-29 14:25:48] [INFO ] Flatten gal took : 95 ms
[2024-05-29 14:25:48] [INFO ] Flatten gal took : 96 ms
[2024-05-29 14:25:48] [INFO ] Time to serialize gal into /tmp/LTL15222465832045924503.gal : 8 ms
[2024-05-29 14:25:48] [INFO ] Time to serialize properties into /tmp/LTL4914752852769743413.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15222465832045924503.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4914752852769743413.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("((p168==1)&&(p175==1))"))U((G(!("((p168==1)&&(p175==1))")))||((!("((p168==1)&&(p175==1))"))&&(("((p2342==1)&&(p2344==1))...209
Formula 0 simplified : FG(!"((p168==0)||(p175==0))" | X((!"((p2342==1)&&(p2344==1))" R !"(p2370==1)") U "((p168==1)&&(p175==1))"))
Detected timeout of ITS tools.
[2024-05-29 14:26:03] [INFO ] Flatten gal took : 99 ms
[2024-05-29 14:26:03] [INFO ] Applying decomposition
[2024-05-29 14:26:04] [INFO ] Flatten gal took : 105 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15731010067985146765.txt' '-o' '/tmp/graph15731010067985146765.bin' '-w' '/tmp/graph15731010067985146765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15731010067985146765.bin' '-l' '-1' '-v' '-w' '/tmp/graph15731010067985146765.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:26:04] [INFO ] Decomposing Gal with order
[2024-05-29 14:26:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:26:04] [INFO ] Removed a total of 299 redundant transitions.
[2024-05-29 14:26:04] [INFO ] Flatten gal took : 75 ms
[2024-05-29 14:26:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 201 ms.
[2024-05-29 14:26:04] [INFO ] Time to serialize gal into /tmp/LTL17783376330308021762.gal : 17 ms
[2024-05-29 14:26:04] [INFO ] Time to serialize properties into /tmp/LTL317160874198914324.ltl : 315 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17783376330308021762.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL317160874198914324.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("((i2.u52.p168==1)&&(i1.i1.i0.i3.u55.p175==1))"))U((G(!("((i2.u52.p168==1)&&(i1.i1.i0.i3.u55.p175==1))")))||((!("((i2.u52...328
Formula 0 simplified : FG(!"((i2.u52.p168==0)||(i1.i1.i0.i3.u55.p175==0))" | X((!"((i31.u748.p2342==1)&&(i31.u748.p2344==1))" R !"(i31.u757.p2370==1)") U "...203
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7515661598076661922
[2024-05-29 14:26:20] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7515661598076661922
Running compilation step : cd /tmp/ltsmin7515661598076661922;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7515661598076661922;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7515661598076661922;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100A-LTLFireability-01 finished in 158019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(p1)||(!p2 U (G((!p2||G(!p1)))||(p3&&(!p2||G(!p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : ShieldPPPt-PT-100A-LTLFireability-10
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 1800
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 2498 transition count 1798
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 2497 transition count 1797
Applied a total of 9 rules in 288 ms. Remains 2497 /2503 variables (removed 6) and now considering 1797/1802 (removed 5) transitions.
// Phase 1: matrix 1797 rows 2497 cols
[2024-05-29 14:26:25] [INFO ] Computed 1100 invariants in 8 ms
[2024-05-29 14:26:27] [INFO ] Implicit Places using invariants in 1362 ms returned []
[2024-05-29 14:26:27] [INFO ] Invariant cache hit.
[2024-05-29 14:26:29] [INFO ] Implicit Places using invariants and state equation in 1860 ms returned []
Implicit Place search using SMT with State Equation took 3224 ms to find 0 implicit places.
[2024-05-29 14:26:29] [INFO ] Invariant cache hit.
[2024-05-29 14:26:30] [INFO ] Dead Transitions using invariants and state equation in 1187 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2497/2503 places, 1797/1802 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4700 ms. Remains : 2497/2503 places, 1797/1802 transitions.
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2495 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 31087 reset in 2028 ms.
Product exploration explored 100000 steps with 30938 reset in 2386 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 351 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 223 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2024-05-29 14:26:35] [INFO ] Invariant cache hit.
[2024-05-29 14:26:38] [INFO ] [Real]Absence check using 1100 positive place invariants in 782 ms returned sat
[2024-05-29 14:26:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:26:40] [INFO ] [Real]Absence check using state equation in 2363 ms returned sat
[2024-05-29 14:26:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:26:43] [INFO ] [Nat]Absence check using 1100 positive place invariants in 979 ms returned sat
[2024-05-29 14:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:26:46] [INFO ] [Nat]Absence check using state equation in 2722 ms returned sat
[2024-05-29 14:26:46] [INFO ] Computed and/alt/rep : 1795/2693/1795 causal constraints (skipped 0 transitions) in 102 ms.
[2024-05-29 14:26:55] [INFO ] Added : 460 causal constraints over 92 iterations in 9092 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 1 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 1797/1797 transitions.
Applied a total of 0 rules in 91 ms. Remains 2497 /2497 variables (removed 0) and now considering 1797/1797 (removed 0) transitions.
[2024-05-29 14:26:55] [INFO ] Invariant cache hit.
[2024-05-29 14:26:57] [INFO ] Implicit Places using invariants in 1316 ms returned []
[2024-05-29 14:26:57] [INFO ] Invariant cache hit.
[2024-05-29 14:26:59] [INFO ] Implicit Places using invariants and state equation in 1890 ms returned []
Implicit Place search using SMT with State Equation took 3207 ms to find 0 implicit places.
[2024-05-29 14:26:59] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-29 14:26:59] [INFO ] Invariant cache hit.
[2024-05-29 14:27:00] [INFO ] Dead Transitions using invariants and state equation in 1184 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4538 ms. Remains : 2497/2497 places, 1797/1797 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 164 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 187 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2024-05-29 14:27:00] [INFO ] Invariant cache hit.
[2024-05-29 14:27:03] [INFO ] [Real]Absence check using 1100 positive place invariants in 913 ms returned sat
[2024-05-29 14:27:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:27:06] [INFO ] [Real]Absence check using state equation in 2365 ms returned sat
[2024-05-29 14:27:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:27:09] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1012 ms returned sat
[2024-05-29 14:27:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:27:12] [INFO ] [Nat]Absence check using state equation in 2772 ms returned sat
[2024-05-29 14:27:12] [INFO ] Computed and/alt/rep : 1795/2693/1795 causal constraints (skipped 0 transitions) in 97 ms.
[2024-05-29 14:27:23] [INFO ] Deduced a trap composed of 2 places in 1916 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 14:27:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 30820 reset in 1996 ms.
Product exploration explored 100000 steps with 30869 reset in 2359 ms.
Built C files in :
/tmp/ltsmin5795170228478739322
[2024-05-29 14:27:27] [INFO ] Too many transitions (1797) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:27:27] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5795170228478739322
Running compilation step : cd /tmp/ltsmin5795170228478739322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5795170228478739322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5795170228478739322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 1797/1797 transitions.
Applied a total of 0 rules in 102 ms. Remains 2497 /2497 variables (removed 0) and now considering 1797/1797 (removed 0) transitions.
[2024-05-29 14:27:30] [INFO ] Invariant cache hit.
[2024-05-29 14:27:32] [INFO ] Implicit Places using invariants in 1373 ms returned []
[2024-05-29 14:27:32] [INFO ] Invariant cache hit.
[2024-05-29 14:27:34] [INFO ] Implicit Places using invariants and state equation in 1929 ms returned []
Implicit Place search using SMT with State Equation took 3304 ms to find 0 implicit places.
[2024-05-29 14:27:34] [INFO ] Redundant transitions in 37 ms returned []
[2024-05-29 14:27:34] [INFO ] Invariant cache hit.
[2024-05-29 14:27:35] [INFO ] Dead Transitions using invariants and state equation in 1191 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4655 ms. Remains : 2497/2497 places, 1797/1797 transitions.
Built C files in :
/tmp/ltsmin12298422344963685016
[2024-05-29 14:27:35] [INFO ] Too many transitions (1797) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:27:35] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12298422344963685016
Running compilation step : cd /tmp/ltsmin12298422344963685016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12298422344963685016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12298422344963685016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:27:38] [INFO ] Flatten gal took : 47 ms
[2024-05-29 14:27:38] [INFO ] Flatten gal took : 53 ms
[2024-05-29 14:27:38] [INFO ] Time to serialize gal into /tmp/LTL7171474090307789283.gal : 7 ms
[2024-05-29 14:27:38] [INFO ] Time to serialize properties into /tmp/LTL17478875679174334307.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7171474090307789283.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7704487669561674080.hoa' '-atoms' '/tmp/LTL17478875679174334307.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17478875679174334307.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7704487669561674080.hoa
Detected timeout of ITS tools.
[2024-05-29 14:27:53] [INFO ] Flatten gal took : 46 ms
[2024-05-29 14:27:53] [INFO ] Flatten gal took : 47 ms
[2024-05-29 14:27:53] [INFO ] Time to serialize gal into /tmp/LTL7882122518351289014.gal : 8 ms
[2024-05-29 14:27:53] [INFO ] Time to serialize properties into /tmp/LTL15506820667059061497.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7882122518351289014.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15506820667059061497.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("(p2501==1)"))))
Formula 0 simplified : XG!"(p2501==1)"
Detected timeout of ITS tools.
[2024-05-29 14:28:08] [INFO ] Flatten gal took : 45 ms
[2024-05-29 14:28:08] [INFO ] Applying decomposition
[2024-05-29 14:28:08] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10805564573201592263.txt' '-o' '/tmp/graph10805564573201592263.bin' '-w' '/tmp/graph10805564573201592263.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10805564573201592263.bin' '-l' '-1' '-v' '-w' '/tmp/graph10805564573201592263.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:28:09] [INFO ] Decomposing Gal with order
[2024-05-29 14:28:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:28:09] [INFO ] Removed a total of 299 redundant transitions.
[2024-05-29 14:28:09] [INFO ] Flatten gal took : 65 ms
[2024-05-29 14:28:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 5 ms.
[2024-05-29 14:28:09] [INFO ] Time to serialize gal into /tmp/LTL17529273682398694740.gal : 13 ms
[2024-05-29 14:28:09] [INFO ] Time to serialize properties into /tmp/LTL4069798468009901176.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17529273682398694740.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4069798468009901176.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F("(i34.u800.p2501==1)"))))
Formula 0 simplified : XG!"(i34.u800.p2501==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15184997472470347776
[2024-05-29 14:28:24] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15184997472470347776
Running compilation step : cd /tmp/ltsmin15184997472470347776;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15184997472470347776;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15184997472470347776;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100A-LTLFireability-10 finished in 121934 ms.
[2024-05-29 14:28:27] [INFO ] Flatten gal took : 96 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7806991891824428813
[2024-05-29 14:28:27] [INFO ] Too many transitions (1802) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:28:27] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7806991891824428813
Running compilation step : cd /tmp/ltsmin7806991891824428813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 14:28:27] [INFO ] Applying decomposition
[2024-05-29 14:28:27] [INFO ] Flatten gal took : 97 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3974662405024580185.txt' '-o' '/tmp/graph3974662405024580185.bin' '-w' '/tmp/graph3974662405024580185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3974662405024580185.bin' '-l' '-1' '-v' '-w' '/tmp/graph3974662405024580185.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:28:27] [INFO ] Decomposing Gal with order
[2024-05-29 14:28:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:28:27] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-29 14:28:28] [INFO ] Flatten gal took : 78 ms
[2024-05-29 14:28:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 161 ms.
[2024-05-29 14:28:28] [INFO ] Time to serialize gal into /tmp/LTLFireability1568674748076232769.gal : 17 ms
[2024-05-29 14:28:28] [INFO ] Time to serialize properties into /tmp/LTLFireability17175972988593653033.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1568674748076232769.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17175972988593653033.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((G(F((!("((i1.i1.i2.i2.u52.p168==1)&&(i1.i1.i0.i3.u55.p175==1))"))&&(X((!("((i1.i1.i2.i2.u52.p168==1)&&(i1.i1.i0.i3.u55.p175==1))"))...394
Formula 0 simplified : FG("((i1.i1.i2.i2.u52.p168==1)&&(i1.i1.i0.i3.u55.p175==1))" | X((!"((i31.i0.i0.i0.u748.p2342==1)&&(i31.i0.i0.i0.u748.p2344==1))" R !...247
Compilation finished in 4089 ms.
Running link step : cd /tmp/ltsmin7806991891824428813;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin7806991891824428813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&((LTLAPp1==true) U (LTLAPp2==true)))))))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.066: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.066: LTL layer: formula: [](<>((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&((LTLAPp1==true) U (LTLAPp2==true)))))))))
pins2lts-mc-linux64( 2/ 8), 0.066: "[](<>((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&((LTLAPp1==true) U (LTLAPp2==true)))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.081: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.090: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.090: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.095: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.096: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.099: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.099: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.098: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.400: There are 1811 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.400: State length is 2504, there are 1824 groups
pins2lts-mc-linux64( 0/ 8), 1.400: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.400: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.400: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.400: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 1.620: [Blue] ~120 levels ~960 states ~4240 transitions
pins2lts-mc-linux64( 4/ 8), 1.807: [Blue] ~240 levels ~1920 states ~8712 transitions
pins2lts-mc-linux64( 7/ 8), 2.156: [Blue] ~476 levels ~3840 states ~17544 transitions
pins2lts-mc-linux64( 1/ 8), 2.829: [Blue] ~946 levels ~7680 states ~36304 transitions
pins2lts-mc-linux64( 1/ 8), 4.060: [Blue] ~1864 levels ~15360 states ~74312 transitions
pins2lts-mc-linux64( 7/ 8), 6.482: [Blue] ~3806 levels ~30720 states ~157128 transitions
pins2lts-mc-linux64( 7/ 8), 11.060: [Blue] ~7611 levels ~61440 states ~333744 transitions
pins2lts-mc-linux64( 7/ 8), 20.210: [Blue] ~15221 levels ~122880 states ~702768 transitions
pins2lts-mc-linux64( 7/ 8), 38.802: [Blue] ~30416 levels ~245760 states ~1463952 transitions
pins2lts-mc-linux64( 7/ 8), 74.202: [Blue] ~60877 levels ~491520 states ~3053088 transitions
pins2lts-mc-linux64( 7/ 8), 145.441: [Blue] ~121788 levels ~983040 states ~6338944 transitions
pins2lts-mc-linux64( 7/ 8), 288.580: [Blue] ~243645 levels ~1966080 states ~13167064 transitions
pins2lts-mc-linux64( 5/ 8), 316.959: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 317.226:
pins2lts-mc-linux64( 0/ 8), 317.226: Explored 2111719 states 15984568 transitions, fanout: 7.569
pins2lts-mc-linux64( 0/ 8), 317.226: Total exploration time 315.790 sec (315.530 sec minimum, 315.665 sec on average)
pins2lts-mc-linux64( 0/ 8), 317.226: States per second: 6687, Transitions per second: 50618
pins2lts-mc-linux64( 0/ 8), 317.226:
pins2lts-mc-linux64( 0/ 8), 317.226: State space has 8459544 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 317.226: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 317.226: blue states: 2111719 (24.96%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 317.226: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 317.226: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 317.226:
pins2lts-mc-linux64( 0/ 8), 317.226: Total memory used for local state coloring: 32.1MB
pins2lts-mc-linux64( 0/ 8), 317.226:
pins2lts-mc-linux64( 0/ 8), 317.226: Queue width: 8B, total height: 2101054, memory: 16.03MB
pins2lts-mc-linux64( 0/ 8), 317.226: Tree memory: 320.5MB, 39.7 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 317.226: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 317.226: Stored 1829 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 317.226: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 317.226: Est. total memory use: 336.6MB (~1040.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7806991891824428813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&((LTLAPp1==true) U (LTLAPp2==true)))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7806991891824428813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&((LTLAPp1==true) U (LTLAPp2==true)))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
19295 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,193.234,2332668,1,0,3.84272e+06,1438,8436,1.14231e+07,100,12868,395796
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-100A-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((("((i11.u290.p908==1)&&(i11.u295.p925==1))")U((X("(i9.u230.p722==1)"))||((!("((i15.i1.i0.i0.u378.p1181==1)&&(i15.i1.i0.i2.u381.p119...480
Formula 1 simplified : !"((i11.u290.p908==1)&&(i11.u295.p925==1))" R (X!"(i9.u230.p722==1)" & ("((i15.i1.i0.i0.u378.p1181==1)&&(i15.i1.i0.i2.u381.p1196==1)...458
7 unique states visited
0 strongly connected components in search stack
10 transitions explored
4 items max in DFS search stack
3810 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,231.335,2333844,1,0,3.84272e+06,1438,10261,1.14231e+07,110,12868,1317465
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-100A-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F("(i32.u800.p2501==1)"))))
Formula 2 simplified : XG!"(i32.u800.p2501==1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
13499 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,366.328,4871368,1,0,8.95842e+06,1438,8188,2.6497e+07,83,12868,135453
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-100A-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1583013 ms.
BK_STOP 1716993452287
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-100A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPt-PT-100A, 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 r373-tall-171683789300433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100A.tgz
mv ShieldPPPt-PT-100A 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 ;