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.r267-smll-171654405700100.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 greatspnxred
Input is Parking-PT-864, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405700100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 20:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 20:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 19:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 19:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 427K 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 Parking-PT-864-LTLFireability-00
FORMULA_NAME Parking-PT-864-LTLFireability-01
FORMULA_NAME Parking-PT-864-LTLFireability-02
FORMULA_NAME Parking-PT-864-LTLFireability-03
FORMULA_NAME Parking-PT-864-LTLFireability-04
FORMULA_NAME Parking-PT-864-LTLFireability-05
FORMULA_NAME Parking-PT-864-LTLFireability-06
FORMULA_NAME Parking-PT-864-LTLFireability-07
FORMULA_NAME Parking-PT-864-LTLFireability-08
FORMULA_NAME Parking-PT-864-LTLFireability-09
FORMULA_NAME Parking-PT-864-LTLFireability-10
FORMULA_NAME Parking-PT-864-LTLFireability-11
FORMULA_NAME Parking-PT-864-LTLFireability-12
FORMULA_NAME Parking-PT-864-LTLFireability-13
FORMULA_NAME Parking-PT-864-LTLFireability-14
FORMULA_NAME Parking-PT-864-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716663772143

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-864
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 19:02:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 19:02:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 19:02:55] [INFO ] Load time of PNML (sax parser for PT used): 413 ms
[2024-05-25 19:02:55] [INFO ] Transformed 1185 places.
[2024-05-25 19:02:55] [INFO ] Transformed 1697 transitions.
[2024-05-25 19:02:55] [INFO ] Found NUPN structural information;
[2024-05-25 19:02:55] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 800 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
FORMULA Parking-PT-864-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1178 transition count 1002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1178 transition count 1002
Applied a total of 14 rules in 450 ms. Remains 1178 /1185 variables (removed 7) and now considering 1002/1009 (removed 7) transitions.
// Phase 1: matrix 1002 rows 1178 cols
[2024-05-25 19:02:56] [INFO ] Computed 280 invariants in 63 ms
[2024-05-25 19:02:58] [INFO ] Implicit Places using invariants in 1883 ms returned [152, 160, 168, 176, 184, 192, 200, 240, 242, 285, 301, 309, 317, 325, 333, 341, 373, 375, 418, 426, 434, 442, 450, 458, 466, 474, 506, 508, 551, 559, 567, 575, 583, 591, 599, 607, 639, 641, 684, 692, 700, 708, 716, 724, 732, 740, 772, 774, 817, 825, 833, 841, 849, 857, 865, 873, 905, 907, 950, 958, 966, 974, 982, 990, 998, 1006, 1038, 1040, 1084, 1092, 1100, 1108, 1116, 1124, 1132, 1140, 1174]
Discarding 77 places :
Implicit Place search using SMT only with invariants took 1935 ms to find 77 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1101/1185 places, 1002/1009 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 1040 transition count 941
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 1040 transition count 941
Applied a total of 122 rules in 267 ms. Remains 1040 /1101 variables (removed 61) and now considering 941/1002 (removed 61) transitions.
// Phase 1: matrix 941 rows 1040 cols
[2024-05-25 19:02:58] [INFO ] Computed 203 invariants in 12 ms
[2024-05-25 19:02:59] [INFO ] Implicit Places using invariants in 985 ms returned []
[2024-05-25 19:02:59] [INFO ] Invariant cache hit.
[2024-05-25 19:03:00] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 19:03:04] [INFO ] Implicit Places using invariants and state equation in 5435 ms returned []
Implicit Place search using SMT with State Equation took 6424 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1040/1185 places, 941/1009 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9113 ms. Remains : 1040/1185 places, 941/1009 transitions.
Support contains 51 out of 1040 places after structural reductions.
[2024-05-25 19:03:05] [INFO ] Flatten gal took : 284 ms
[2024-05-25 19:03:05] [INFO ] Flatten gal took : 155 ms
[2024-05-25 19:03:05] [INFO ] Input system was already deterministic with 941 transitions.
Support contains 49 out of 1040 places (down from 51) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 35 to 34
RANDOM walk for 40000 steps (156 resets) in 3835 ms. (10 steps per ms) remains 6/34 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 6/6 properties
[2024-05-25 19:03:07] [INFO ] Invariant cache hit.
[2024-05-25 19:03:07] [INFO ] State equation strengthened by 248 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 403/417 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 623/1040 variables, 191/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1040 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 941/1981 variables, 1040/1243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1981 variables, 248/1491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1981 variables, 0/1491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1981 variables, 0/1491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1981/1981 variables, and 1491 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2368 ms.
Refiners :[Positive P Invariants (semi-flows): 203/203 constraints, State Equation: 1040/1040 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 403/417 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 623/1040 variables, 191/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1040 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 941/1981 variables, 1040/1243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1981 variables, 248/1491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1981 variables, 6/1497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1981 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/1981 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1981/1981 variables, and 1497 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3784 ms.
Refiners :[Positive P Invariants (semi-flows): 203/203 constraints, State Equation: 1040/1040 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 6238ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 2387 steps, including 9 resets, run visited all 6 properties in 88 ms. (steps per millisecond=27 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 101 ms.
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(!p1&&X((!p1 U (X(!p2)||G(!p1))))))))'
Support contains 6 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 107 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 19:03:15] [INFO ] Computed 203 invariants in 11 ms
[2024-05-25 19:03:16] [INFO ] Implicit Places using invariants in 1244 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1252 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 97 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-25 19:03:16] [INFO ] Computed 200 invariants in 9 ms
[2024-05-25 19:03:17] [INFO ] Implicit Places using invariants in 947 ms returned []
[2024-05-25 19:03:17] [INFO ] Invariant cache hit.
[2024-05-25 19:03:18] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 19:03:21] [INFO ] Implicit Places using invariants and state equation in 4580 ms returned []
Implicit Place search using SMT with State Equation took 5530 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6986 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 644 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Running random walk in product with property : Parking-PT-864-LTLFireability-00
Product exploration explored 100000 steps with 390 reset in 1684 ms.
Product exploration explored 100000 steps with 391 reset in 1771 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 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 159 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
RANDOM walk for 40000 steps (154 resets) in 1761 ms. (22 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 451 ms. (88 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 589 ms. (67 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 8/8 properties
[2024-05-25 19:03:27] [INFO ] Invariant cache hit.
[2024-05-25 19:03:27] [INFO ] State equation strengthened by 248 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 161/167 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 866/1033 variables, 195/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 937/1970 variables, 1033/1233 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1970 variables, 248/1481 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1970/1970 variables, and 1481 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2040 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 161/167 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 866/1033 variables, 195/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-25 19:03:30] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 26 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 937/1970 variables, 1033/1234 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 248/1482 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1970 variables, 8/1490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1970 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1970 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1970/1970 variables, and 1490 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3253 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 5365ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 4 properties in 2971 ms.
Support contains 6 out of 1033 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1033 transition count 905
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1001 transition count 905
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1001 transition count 873
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 969 transition count 873
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 222 place count 922 transition count 826
Free-agglomeration rule applied 260 times.
Iterating global reduction 2 with 260 rules applied. Total rules applied 482 place count 922 transition count 566
Reduce places removed 260 places and 0 transitions.
Graph (complete) has 1330 edges and 662 vertex of which 182 are kept as prefixes of interest. Removing 480 places using SCC suffix rule.2 ms
Discarding 480 places :
Also discarding 396 output transitions
Drop transitions (Output transitions of discarded places.) removed 396 transitions
Iterating post reduction 2 with 261 rules applied. Total rules applied 743 place count 182 transition count 170
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 767 place count 182 transition count 146
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 768 place count 182 transition count 146
Applied a total of 768 rules in 261 ms. Remains 182 /1033 variables (removed 851) and now considering 146/937 (removed 791) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 182/1033 places, 146/937 transitions.
RANDOM walk for 40000 steps (392 resets) in 211 ms. (188 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (11 resets) in 98 ms. (404 steps per ms) remains 1/2 properties
BEST_FIRST walk for 6055 steps (5 resets) in 27 ms. (216 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p1 p0) (OR p1 (NOT p2))))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (OR (NOT p1) p0) (OR (NOT p1) (NOT p2))))), (F p1), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 19 factoid took 488 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 309 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Support contains 6 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 112 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2024-05-25 19:03:37] [INFO ] Invariant cache hit.
[2024-05-25 19:03:38] [INFO ] Implicit Places using invariants in 821 ms returned []
[2024-05-25 19:03:38] [INFO ] Invariant cache hit.
[2024-05-25 19:03:39] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 19:03:42] [INFO ] Implicit Places using invariants and state equation in 3765 ms returned []
Implicit Place search using SMT with State Equation took 4588 ms to find 0 implicit places.
Running 936 sub problems to find dead transitions.
[2024-05-25 19:03:42] [INFO ] Invariant cache hit.
[2024-05-25 19:03:42] [INFO ] State equation strengthened by 248 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1032 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 936 unsolved
SMT process timed out in 30363ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30380ms
Finished structural reductions in LTL mode , in 1 iterations and 35086 ms. Remains : 1033/1033 places, 937/937 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 115 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
RANDOM walk for 40000 steps (156 resets) in 1388 ms. (28 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
[2024-05-25 19:04:14] [INFO ] Invariant cache hit.
[2024-05-25 19:04:14] [INFO ] State equation strengthened by 248 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 161/167 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 866/1033 variables, 195/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 937/1970 variables, 1033/1233 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1970 variables, 248/1481 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1970/1970 variables, and 1481 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1508 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 161/167 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 866/1033 variables, 195/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-25 19:04:16] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 937/1970 variables, 1033/1234 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 248/1482 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1970 variables, 8/1490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1970 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1970 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1970/1970 variables, and 1490 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2683 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 4214ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 4 properties in 2653 ms.
Support contains 6 out of 1033 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1033 transition count 905
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1001 transition count 905
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1001 transition count 873
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 969 transition count 873
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 222 place count 922 transition count 826
Free-agglomeration rule applied 260 times.
Iterating global reduction 2 with 260 rules applied. Total rules applied 482 place count 922 transition count 566
Reduce places removed 260 places and 0 transitions.
Graph (complete) has 1330 edges and 662 vertex of which 182 are kept as prefixes of interest. Removing 480 places using SCC suffix rule.1 ms
Discarding 480 places :
Also discarding 396 output transitions
Drop transitions (Output transitions of discarded places.) removed 396 transitions
Iterating post reduction 2 with 261 rules applied. Total rules applied 743 place count 182 transition count 170
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 767 place count 182 transition count 146
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 768 place count 182 transition count 146
Applied a total of 768 rules in 189 ms. Remains 182 /1033 variables (removed 851) and now considering 146/937 (removed 791) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 182/1033 places, 146/937 transitions.
RANDOM walk for 40000 steps (422 resets) in 191 ms. (208 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/2 properties
BEST_FIRST walk for 11694 steps (12 resets) in 20 ms. (556 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p1 p0) (OR p1 (NOT p2))))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (OR (NOT p1) p0) (OR (NOT p1) (NOT p2))))), (F p1), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 19 factoid took 464 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Product exploration explored 100000 steps with 389 reset in 1196 ms.
Product exploration explored 100000 steps with 389 reset in 1339 ms.
Support contains 6 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 25 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2024-05-25 19:04:25] [INFO ] Invariant cache hit.
[2024-05-25 19:04:26] [INFO ] Implicit Places using invariants in 731 ms returned []
[2024-05-25 19:04:26] [INFO ] Invariant cache hit.
[2024-05-25 19:04:26] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 19:04:29] [INFO ] Implicit Places using invariants and state equation in 3342 ms returned []
Implicit Place search using SMT with State Equation took 4075 ms to find 0 implicit places.
Running 936 sub problems to find dead transitions.
[2024-05-25 19:04:29] [INFO ] Invariant cache hit.
[2024-05-25 19:04:29] [INFO ] State equation strengthened by 248 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1032 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 936 unsolved
SMT process timed out in 30343ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30355ms
Finished structural reductions in LTL mode , in 1 iterations and 34461 ms. Remains : 1033/1033 places, 937/937 transitions.
Treatment of property Parking-PT-864-LTLFireability-00 finished in 105399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 82 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 19:05:00] [INFO ] Computed 203 invariants in 8 ms
[2024-05-25 19:05:01] [INFO ] Implicit Places using invariants in 1031 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1036 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 54 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-25 19:05:01] [INFO ] Computed 200 invariants in 5 ms
[2024-05-25 19:05:02] [INFO ] Implicit Places using invariants in 960 ms returned []
[2024-05-25 19:05:02] [INFO ] Invariant cache hit.
[2024-05-25 19:05:03] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 19:05:06] [INFO ] Implicit Places using invariants and state equation in 4042 ms returned []
Implicit Place search using SMT with State Equation took 5005 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6178 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-01
Stuttering criterion allowed to conclude after 289 steps with 0 reset in 7 ms.
FORMULA Parking-PT-864-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-01 finished in 6320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(G(p1))))&&p0))))'
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 82 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 19:05:06] [INFO ] Computed 203 invariants in 6 ms
[2024-05-25 19:05:07] [INFO ] Implicit Places using invariants in 922 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 933 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 51 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-25 19:05:07] [INFO ] Computed 200 invariants in 4 ms
[2024-05-25 19:05:08] [INFO ] Implicit Places using invariants in 1069 ms returned []
[2024-05-25 19:05:08] [INFO ] Invariant cache hit.
[2024-05-25 19:05:09] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 19:05:12] [INFO ] Implicit Places using invariants and state equation in 4206 ms returned []
Implicit Place search using SMT with State Equation took 5284 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6351 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-864-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-02 finished in 6581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1040 transition count 910
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1009 transition count 910
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1009 transition count 879
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 124 place count 978 transition count 879
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 977 transition count 878
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 977 transition count 878
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 228 place count 926 transition count 827
Applied a total of 228 rules in 251 ms. Remains 926 /1040 variables (removed 114) and now considering 827/941 (removed 114) transitions.
// Phase 1: matrix 827 rows 926 cols
[2024-05-25 19:05:13] [INFO ] Computed 203 invariants in 5 ms
[2024-05-25 19:05:14] [INFO ] Implicit Places using invariants in 1040 ms returned [181, 257, 922]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1062 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 923/1040 places, 827/941 transitions.
Applied a total of 0 rules in 56 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1372 ms. Remains : 923/1040 places, 827/941 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-03
Stuttering criterion allowed to conclude after 259 steps with 3 reset in 6 ms.
FORMULA Parking-PT-864-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-03 finished in 1577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)||(p1&&F((!p2&&X(p3))))))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 78 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 19:05:14] [INFO ] Computed 203 invariants in 18 ms
[2024-05-25 19:05:15] [INFO ] Implicit Places using invariants in 861 ms returned [276, 1034]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 864 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1037/1040 places, 940/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1035 transition count 938
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1035 transition count 938
Applied a total of 4 rules in 61 ms. Remains 1035 /1037 variables (removed 2) and now considering 938/940 (removed 2) transitions.
// Phase 1: matrix 938 rows 1035 cols
[2024-05-25 19:05:15] [INFO ] Computed 201 invariants in 4 ms
[2024-05-25 19:05:16] [INFO ] Implicit Places using invariants in 884 ms returned []
[2024-05-25 19:05:16] [INFO ] Invariant cache hit.
[2024-05-25 19:05:17] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 19:05:21] [INFO ] Implicit Places using invariants and state equation in 4466 ms returned []
Implicit Place search using SMT with State Equation took 5378 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1035/1040 places, 938/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6383 ms. Remains : 1035/1040 places, 938/941 transitions.
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 4032 ms.
Product exploration explored 100000 steps with 50000 reset in 3762 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 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 35 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-864-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-864-LTLFireability-04 finished in 14600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X((X(X(G(X(G(p0))))) U p1))))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1040 transition count 910
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1009 transition count 910
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1009 transition count 879
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 124 place count 978 transition count 879
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 977 transition count 878
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 977 transition count 878
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 228 place count 926 transition count 827
Applied a total of 228 rules in 127 ms. Remains 926 /1040 variables (removed 114) and now considering 827/941 (removed 114) transitions.
// Phase 1: matrix 827 rows 926 cols
[2024-05-25 19:05:29] [INFO ] Computed 203 invariants in 3 ms
[2024-05-25 19:05:30] [INFO ] Implicit Places using invariants in 1070 ms returned [181, 257, 922]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1086 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 923/1040 places, 827/941 transitions.
Applied a total of 0 rules in 57 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1271 ms. Remains : 923/1040 places, 827/941 transitions.
Stuttering acceptance computed with spot in 349 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-864-LTLFireability-05
Stuttering criterion allowed to conclude after 228 steps with 0 reset in 5 ms.
FORMULA Parking-PT-864-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-05 finished in 1674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1040 transition count 909
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1008 transition count 909
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1008 transition count 877
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 976 transition count 877
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 975 transition count 876
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 975 transition count 876
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 232 place count 924 transition count 825
Applied a total of 232 rules in 186 ms. Remains 924 /1040 variables (removed 116) and now considering 825/941 (removed 116) transitions.
// Phase 1: matrix 825 rows 924 cols
[2024-05-25 19:05:31] [INFO ] Computed 203 invariants in 4 ms
[2024-05-25 19:05:32] [INFO ] Implicit Places using invariants in 958 ms returned [181, 257, 920]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 960 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 921/1040 places, 825/941 transitions.
Applied a total of 0 rules in 48 ms. Remains 921 /921 variables (removed 0) and now considering 825/825 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1195 ms. Remains : 921/1040 places, 825/941 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-06
Stuttering criterion allowed to conclude after 287 steps with 0 reset in 6 ms.
FORMULA Parking-PT-864-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-06 finished in 1258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||(p1 U p2)))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 96 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 19:05:32] [INFO ] Computed 203 invariants in 22 ms
[2024-05-25 19:05:33] [INFO ] Implicit Places using invariants in 1064 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1071 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 51 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-25 19:05:33] [INFO ] Computed 200 invariants in 3 ms
[2024-05-25 19:05:34] [INFO ] Implicit Places using invariants in 892 ms returned []
[2024-05-25 19:05:34] [INFO ] Invariant cache hit.
[2024-05-25 19:05:35] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 19:05:37] [INFO ] Implicit Places using invariants and state equation in 3116 ms returned []
Implicit Place search using SMT with State Equation took 4011 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5230 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-864-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-07 finished in 5350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U G(p1))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 50 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 19:05:37] [INFO ] Computed 203 invariants in 4 ms
[2024-05-25 19:05:38] [INFO ] Implicit Places using invariants in 857 ms returned [195, 276]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 860 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1037/1040 places, 940/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1035 transition count 938
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1035 transition count 938
Applied a total of 4 rules in 57 ms. Remains 1035 /1037 variables (removed 2) and now considering 938/940 (removed 2) transitions.
// Phase 1: matrix 938 rows 1035 cols
[2024-05-25 19:05:38] [INFO ] Computed 201 invariants in 4 ms
[2024-05-25 19:05:39] [INFO ] Implicit Places using invariants in 892 ms returned []
[2024-05-25 19:05:39] [INFO ] Invariant cache hit.
[2024-05-25 19:05:40] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 19:05:42] [INFO ] Implicit Places using invariants and state equation in 3445 ms returned []
Implicit Place search using SMT with State Equation took 4339 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1035/1040 places, 938/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5309 ms. Remains : 1035/1040 places, 938/941 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : Parking-PT-864-LTLFireability-08
Entered a terminal (fully accepting) state of product in 14 steps with 3 reset in 1 ms.
FORMULA Parking-PT-864-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-08 finished in 5497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0) U p0))||(X(!(G(!p1)||p2)) U p1)))'
Support contains 5 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 49 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 19:05:43] [INFO ] Computed 203 invariants in 3 ms
[2024-05-25 19:05:43] [INFO ] Implicit Places using invariants in 865 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 867 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 53 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-25 19:05:44] [INFO ] Computed 200 invariants in 3 ms
[2024-05-25 19:05:44] [INFO ] Implicit Places using invariants in 830 ms returned []
[2024-05-25 19:05:44] [INFO ] Invariant cache hit.
[2024-05-25 19:05:45] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 19:05:48] [INFO ] Implicit Places using invariants and state equation in 3303 ms returned []
Implicit Place search using SMT with State Equation took 4136 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5106 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Running random walk in product with property : Parking-PT-864-LTLFireability-10
Stuttering criterion allowed to conclude after 284 steps with 0 reset in 3 ms.
FORMULA Parking-PT-864-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-10 finished in 5328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((p1 U (p2||G(p1))))||p0))))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Applied a total of 0 rules in 25 ms. Remains 1040 /1040 variables (removed 0) and now considering 941/941 (removed 0) transitions.
// Phase 1: matrix 941 rows 1040 cols
[2024-05-25 19:05:48] [INFO ] Computed 203 invariants in 3 ms
[2024-05-25 19:05:49] [INFO ] Implicit Places using invariants in 831 ms returned [195, 276, 1035]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 833 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1037/1040 places, 941/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1034 transition count 938
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1034 transition count 938
Applied a total of 6 rules in 50 ms. Remains 1034 /1037 variables (removed 3) and now considering 938/941 (removed 3) transitions.
// Phase 1: matrix 938 rows 1034 cols
[2024-05-25 19:05:49] [INFO ] Computed 200 invariants in 5 ms
[2024-05-25 19:05:50] [INFO ] Implicit Places using invariants in 904 ms returned []
[2024-05-25 19:05:50] [INFO ] Invariant cache hit.
[2024-05-25 19:05:50] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 19:05:53] [INFO ] Implicit Places using invariants and state equation in 3125 ms returned []
Implicit Place search using SMT with State Equation took 4033 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1034/1040 places, 938/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4944 ms. Remains : 1034/1040 places, 938/941 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-11
Product exploration explored 100000 steps with 387 reset in 1216 ms.
Entered a terminal (fully accepting) state of product in 5041 steps with 19 reset in 65 ms.
FORMULA Parking-PT-864-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-11 finished in 6368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U p1))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1040 transition count 909
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1008 transition count 909
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1008 transition count 877
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 976 transition count 877
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 975 transition count 876
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 975 transition count 876
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 232 place count 924 transition count 825
Applied a total of 232 rules in 100 ms. Remains 924 /1040 variables (removed 116) and now considering 825/941 (removed 116) transitions.
// Phase 1: matrix 825 rows 924 cols
[2024-05-25 19:05:54] [INFO ] Computed 203 invariants in 3 ms
[2024-05-25 19:05:55] [INFO ] Implicit Places using invariants in 887 ms returned [181, 257, 920]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 889 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 921/1040 places, 825/941 transitions.
Applied a total of 0 rules in 29 ms. Remains 921 /921 variables (removed 0) and now considering 825/825 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1018 ms. Remains : 921/1040 places, 825/941 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), true, p0]
Running random walk in product with property : Parking-PT-864-LTLFireability-12
Product exploration explored 100000 steps with 391 reset in 1158 ms.
Product exploration explored 100000 steps with 392 reset in 1451 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 p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), true, p0]
RANDOM walk for 39657 steps (155 resets) in 791 ms. (50 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) p1)))
Knowledge based reduction with 9 factoid took 141 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-864-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-864-LTLFireability-12 finished in 4345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&X(p1)) U G(p2)))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 52 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 19:05:59] [INFO ] Computed 203 invariants in 3 ms
[2024-05-25 19:06:00] [INFO ] Implicit Places using invariants in 912 ms returned [195, 1034]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 914 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1037/1040 places, 940/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1035 transition count 938
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1035 transition count 938
Applied a total of 4 rules in 51 ms. Remains 1035 /1037 variables (removed 2) and now considering 938/940 (removed 2) transitions.
// Phase 1: matrix 938 rows 1035 cols
[2024-05-25 19:06:00] [INFO ] Computed 201 invariants in 3 ms
[2024-05-25 19:06:00] [INFO ] Implicit Places using invariants in 842 ms returned []
[2024-05-25 19:06:00] [INFO ] Invariant cache hit.
[2024-05-25 19:06:01] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 19:06:05] [INFO ] Implicit Places using invariants and state equation in 4847 ms returned []
Implicit Place search using SMT with State Equation took 5695 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1035/1040 places, 938/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6713 ms. Remains : 1035/1040 places, 938/941 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-864-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-13 finished in 6912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&G((p1&&X((p1 U (X(p2)||G(p1))))))))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 50 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 19:06:06] [INFO ] Computed 203 invariants in 7 ms
[2024-05-25 19:06:06] [INFO ] Implicit Places using invariants in 933 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 934 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 54 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-25 19:06:07] [INFO ] Computed 200 invariants in 3 ms
[2024-05-25 19:06:07] [INFO ] Implicit Places using invariants in 748 ms returned []
[2024-05-25 19:06:07] [INFO ] Invariant cache hit.
[2024-05-25 19:06:08] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 19:06:11] [INFO ] Implicit Places using invariants and state equation in 3525 ms returned []
Implicit Place search using SMT with State Equation took 4276 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5314 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Parking-PT-864-LTLFireability-14
Product exploration explored 100000 steps with 1365 reset in 1564 ms.
Product exploration explored 100000 steps with 1354 reset in 1797 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 112 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (152 resets) in 771 ms. (51 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
[2024-05-25 19:06:15] [INFO ] Invariant cache hit.
[2024-05-25 19:06:15] [INFO ] State equation strengthened by 248 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 159/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 872/1033 variables, 198/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 937/1970 variables, 1033/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1970 variables, 248/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1970/1970 variables, and 1481 constraints, problems are : Problem set: 0 solved, 1 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 159/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 872/1033 variables, 198/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 19:06:16] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 3 ms to minimize.
[2024-05-25 19:06:16] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 937/1970 variables, 1033/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 248/1483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1970 variables, 1/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1970 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1970 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1970/1970 variables, and 1484 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1067 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1863ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 303 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 27 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2024-05-25 19:06:18] [INFO ] Invariant cache hit.
[2024-05-25 19:06:19] [INFO ] Implicit Places using invariants in 763 ms returned []
[2024-05-25 19:06:19] [INFO ] Invariant cache hit.
[2024-05-25 19:06:20] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 19:06:23] [INFO ] Implicit Places using invariants and state equation in 3789 ms returned []
Implicit Place search using SMT with State Equation took 4555 ms to find 0 implicit places.
Running 936 sub problems to find dead transitions.
[2024-05-25 19:06:23] [INFO ] Invariant cache hit.
[2024-05-25 19:06:23] [INFO ] State equation strengthened by 248 read => feed constraints.
(s10 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1032 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 936 unsolved
SMT process timed out in 30270ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30281ms
Finished structural reductions in LTL mode , in 1 iterations and 34865 ms. Remains : 1033/1033 places, 937/937 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 p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 120 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (152 resets) in 589 ms. (67 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
[2024-05-25 19:06:54] [INFO ] Invariant cache hit.
[2024-05-25 19:06:54] [INFO ] State equation strengthened by 248 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 159/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 872/1033 variables, 198/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 937/1970 variables, 1033/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1970 variables, 248/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1970/1970 variables, and 1481 constraints, problems are : Problem set: 0 solved, 1 unsolved in 932 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 159/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 872/1033 variables, 198/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 19:06:55] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 3 ms to minimize.
[2024-05-25 19:06:55] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 937/1970 variables, 1033/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 248/1483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1970 variables, 1/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1970 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1970 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1970/1970 variables, and 1484 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1090 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2049ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 124 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 314 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1331 reset in 1588 ms.
Product exploration explored 100000 steps with 1347 reset in 1735 ms.
Support contains 3 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 24 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2024-05-25 19:07:00] [INFO ] Invariant cache hit.
[2024-05-25 19:07:01] [INFO ] Implicit Places using invariants in 820 ms returned []
[2024-05-25 19:07:01] [INFO ] Invariant cache hit.
[2024-05-25 19:07:02] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 19:07:05] [INFO ] Implicit Places using invariants and state equation in 3503 ms returned []
Implicit Place search using SMT with State Equation took 4326 ms to find 0 implicit places.
Running 936 sub problems to find dead transitions.
[2024-05-25 19:07:05] [INFO ] Invariant cache hit.
[2024-05-25 19:07:05] [INFO ] State equation strengthened by 248 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1032 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 936 unsolved
SMT process timed out in 30272ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30287ms
Finished structural reductions in LTL mode , in 1 iterations and 34639 ms. Remains : 1033/1033 places, 937/937 transitions.
Treatment of property Parking-PT-864-LTLFireability-14 finished in 89397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p1))))))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 52 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 19:07:35] [INFO ] Computed 203 invariants in 5 ms
[2024-05-25 19:07:36] [INFO ] Implicit Places using invariants in 1000 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1004 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 59 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-25 19:07:36] [INFO ] Computed 200 invariants in 3 ms
[2024-05-25 19:07:37] [INFO ] Implicit Places using invariants in 865 ms returned []
[2024-05-25 19:07:37] [INFO ] Invariant cache hit.
[2024-05-25 19:07:38] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 19:07:41] [INFO ] Implicit Places using invariants and state equation in 3938 ms returned []
Implicit Place search using SMT with State Equation took 4819 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5935 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 202 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-864-LTLFireability-15
Entered a terminal (fully accepting) state of product in 744 steps with 2 reset in 9 ms.
FORMULA Parking-PT-864-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-15 finished in 6179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(!p1&&X((!p1 U (X(!p2)||G(!p1))))))))'
Found a Lengthening insensitive property : Parking-PT-864-LTLFireability-00
Stuttering acceptance computed with spot in 267 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Support contains 6 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1040 transition count 909
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1008 transition count 909
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1008 transition count 877
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 976 transition count 877
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 975 transition count 876
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 975 transition count 876
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 230 place count 925 transition count 826
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 231 place count 925 transition count 826
Applied a total of 231 rules in 164 ms. Remains 925 /1040 variables (removed 115) and now considering 826/941 (removed 115) transitions.
// Phase 1: matrix 826 rows 925 cols
[2024-05-25 19:07:42] [INFO ] Computed 203 invariants in 3 ms
[2024-05-25 19:07:43] [INFO ] Implicit Places using invariants in 1116 ms returned [182, 258, 921]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1127 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 922/1040 places, 826/941 transitions.
Applied a total of 0 rules in 40 ms. Remains 922 /922 variables (removed 0) and now considering 826/826 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1335 ms. Remains : 922/1040 places, 826/941 transitions.
Running random walk in product with property : Parking-PT-864-LTLFireability-00
Product exploration explored 100000 steps with 392 reset in 1697 ms.
Product exploration explored 100000 steps with 394 reset in 1423 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 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 110 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
RANDOM walk for 40000 steps (156 resets) in 740 ms. (53 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 8/8 properties
// Phase 1: matrix 826 rows 922 cols
[2024-05-25 19:07:47] [INFO ] Computed 200 invariants in 2 ms
[2024-05-25 19:07:47] [INFO ] State equation strengthened by 344 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 136/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 780/922 variables, 195/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/922 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 826/1748 variables, 922/1122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1748 variables, 344/1466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1748 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/1748 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1748/1748 variables, and 1466 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2050 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 922/922 constraints, ReadFeed: 344/344 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 136/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 780/922 variables, 195/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/922 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 826/1748 variables, 922/1122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1748 variables, 344/1466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1748 variables, 8/1474 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1748 variables, 0/1474 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/1748 variables, 0/1474 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1748/1748 variables, and 1474 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2321 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 922/922 constraints, ReadFeed: 344/344 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 4403ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 6 properties in 2110 ms.
Support contains 6 out of 922 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 922/922 places, 826/826 transitions.
Free-agglomeration rule applied 260 times.
Iterating global reduction 0 with 260 rules applied. Total rules applied 260 place count 922 transition count 566
Reduce places removed 260 places and 0 transitions.
Graph (complete) has 1331 edges and 662 vertex of which 182 are kept as prefixes of interest. Removing 480 places using SCC suffix rule.1 ms
Discarding 480 places :
Also discarding 396 output transitions
Drop transitions (Output transitions of discarded places.) removed 396 transitions
Iterating post reduction 0 with 261 rules applied. Total rules applied 521 place count 182 transition count 170
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 545 place count 182 transition count 146
Applied a total of 545 rules in 49 ms. Remains 182 /922 variables (removed 740) and now considering 146/826 (removed 680) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 182/922 places, 146/826 transitions.
RANDOM walk for 40000 steps (417 resets) in 186 ms. (213 steps per ms) remains 1/2 properties
BEST_FIRST walk for 20418 steps (15 resets) in 41 ms. (486 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p1 p0) (OR p1 (NOT p2))))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (OR (NOT p1) p0) (OR (NOT p1) (NOT p2))))), (F p1), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 19 factoid took 634 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Support contains 6 out of 922 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 922/922 places, 826/826 transitions.
Applied a total of 0 rules in 34 ms. Remains 922 /922 variables (removed 0) and now considering 826/826 (removed 0) transitions.
[2024-05-25 19:07:55] [INFO ] Invariant cache hit.
[2024-05-25 19:07:56] [INFO ] Implicit Places using invariants in 956 ms returned []
[2024-05-25 19:07:56] [INFO ] Invariant cache hit.
[2024-05-25 19:07:57] [INFO ] State equation strengthened by 344 read => feed constraints.
[2024-05-25 19:08:00] [INFO ] Implicit Places using invariants and state equation in 3815 ms returned []
Implicit Place search using SMT with State Equation took 4778 ms to find 0 implicit places.
Running 825 sub problems to find dead transitions.
[2024-05-25 19:08:00] [INFO ] Invariant cache hit.
[2024-05-25 19:08:00] [INFO ] State equation strengthened by 344 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/921 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 825 unsolved
SMT process timed out in 30330ms, After SMT, problems are : Problem set: 0 solved, 825 unsolved
Search for dead transitions found 0 dead transitions in 30347ms
Finished structural reductions in LTL mode , in 1 iterations and 35164 ms. Remains : 922/922 places, 826/826 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 172 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
RANDOM walk for 40000 steps (155 resets) in 881 ms. (45 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 8/8 properties
[2024-05-25 19:08:31] [INFO ] Invariant cache hit.
[2024-05-25 19:08:31] [INFO ] State equation strengthened by 344 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 136/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 780/922 variables, 195/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/922 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 826/1748 variables, 922/1122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1748 variables, 344/1466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1748 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/1748 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1748/1748 variables, and 1466 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1515 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 922/922 constraints, ReadFeed: 344/344 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 136/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 780/922 variables, 195/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/922 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 826/1748 variables, 922/1122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1748 variables, 344/1466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1748 variables, 8/1474 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1748 variables, 0/1474 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/1748 variables, 0/1474 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1748/1748 variables, and 1474 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2554 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 922/922 constraints, ReadFeed: 344/344 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 4087ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 3516 ms.
Support contains 6 out of 922 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 922/922 places, 826/826 transitions.
Free-agglomeration rule applied 260 times.
Iterating global reduction 0 with 260 rules applied. Total rules applied 260 place count 922 transition count 566
Reduce places removed 260 places and 0 transitions.
Graph (complete) has 1331 edges and 662 vertex of which 182 are kept as prefixes of interest. Removing 480 places using SCC suffix rule.1 ms
Discarding 480 places :
Also discarding 396 output transitions
Drop transitions (Output transitions of discarded places.) removed 396 transitions
Iterating post reduction 0 with 261 rules applied. Total rules applied 521 place count 182 transition count 170
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 545 place count 182 transition count 146
Applied a total of 545 rules in 48 ms. Remains 182 /922 variables (removed 740) and now considering 146/826 (removed 680) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 182/922 places, 146/826 transitions.
RANDOM walk for 40000 steps (411 resets) in 184 ms. (216 steps per ms) remains 2/5 properties
BEST_FIRST walk for 31048 steps (6 resets) in 52 ms. (585 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p1 p0) (OR p1 (NOT p2))))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (OR (NOT p1) p0) (OR (NOT p1) (NOT p2))))), (F p1), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 19 factoid took 529 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 402 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 287 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Product exploration explored 100000 steps with 394 reset in 1229 ms.
Product exploration explored 100000 steps with 393 reset in 1347 ms.
Support contains 6 out of 922 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 922/922 places, 826/826 transitions.
Applied a total of 0 rules in 17 ms. Remains 922 /922 variables (removed 0) and now considering 826/826 (removed 0) transitions.
[2024-05-25 19:08:43] [INFO ] Invariant cache hit.
[2024-05-25 19:08:44] [INFO ] Implicit Places using invariants in 694 ms returned []
[2024-05-25 19:08:44] [INFO ] Invariant cache hit.
[2024-05-25 19:08:45] [INFO ] State equation strengthened by 344 read => feed constraints.
[2024-05-25 19:08:48] [INFO ] Implicit Places using invariants and state equation in 3520 ms returned []
Implicit Place search using SMT with State Equation took 4229 ms to find 0 implicit places.
Running 825 sub problems to find dead transitions.
[2024-05-25 19:08:48] [INFO ] Invariant cache hit.
[2024-05-25 19:08:48] [INFO ] State equation strengthened by 344 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/921 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 825 unsolved
SMT process timed out in 30232ms, After SMT, problems are : Problem set: 0 solved, 825 unsolved
Search for dead transitions found 0 dead transitions in 30243ms
Finished structural reductions in LTL mode , in 1 iterations and 34491 ms. Remains : 922/922 places, 826/826 transitions.
Treatment of property Parking-PT-864-LTLFireability-00 finished in 96769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&G((p1&&X((p1 U (X(p2)||G(p1))))))))))'
Found a Shortening insensitive property : Parking-PT-864-LTLFireability-14
Stuttering acceptance computed with spot in 424 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1040 transition count 910
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 1009 transition count 909
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 1008 transition count 909
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 64 place count 1008 transition count 878
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 126 place count 977 transition count 878
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 976 transition count 877
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 976 transition count 877
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 228 place count 926 transition count 827
Applied a total of 228 rules in 108 ms. Remains 926 /1040 variables (removed 114) and now considering 827/941 (removed 114) transitions.
// Phase 1: matrix 827 rows 926 cols
[2024-05-25 19:09:19] [INFO ] Computed 203 invariants in 3 ms
[2024-05-25 19:09:20] [INFO ] Implicit Places using invariants in 1055 ms returned [181, 257, 922]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1064 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 923/1040 places, 827/941 transitions.
Applied a total of 0 rules in 45 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1219 ms. Remains : 923/1040 places, 827/941 transitions.
Running random walk in product with property : Parking-PT-864-LTLFireability-14
Product exploration explored 100000 steps with 1367 reset in 1938 ms.
Product exploration explored 100000 steps with 1298 reset in 1739 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 121 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (158 resets) in 957 ms. (41 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 1/1 properties
// Phase 1: matrix 827 rows 923 cols
[2024-05-25 19:09:24] [INFO ] Computed 200 invariants in 3 ms
[2024-05-25 19:09:24] [INFO ] State equation strengthened by 343 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 135/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 786/923 variables, 198/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/923 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 827/1750 variables, 923/1123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1750 variables, 343/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1750 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1750 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1750/1750 variables, and 1466 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1040 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 923/923 constraints, ReadFeed: 343/343 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 135/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 786/923 variables, 198/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/923 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 827/1750 variables, 923/1123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1750 variables, 343/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1750 variables, 1/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1750 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1750 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1750/1750 variables, and 1467 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1417 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 923/923 constraints, ReadFeed: 343/343 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2482ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 114 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 301 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 923/923 places, 827/827 transitions.
Applied a total of 0 rules in 30 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
[2024-05-25 19:09:28] [INFO ] Invariant cache hit.
[2024-05-25 19:09:29] [INFO ] Implicit Places using invariants in 1026 ms returned []
[2024-05-25 19:09:29] [INFO ] Invariant cache hit.
[2024-05-25 19:09:30] [INFO ] State equation strengthened by 343 read => feed constraints.
[2024-05-25 19:09:33] [INFO ] Implicit Places using invariants and state equation in 4364 ms returned []
Implicit Place search using SMT with State Equation took 5393 ms to find 0 implicit places.
Running 826 sub problems to find dead transitions.
[2024-05-25 19:09:33] [INFO ] Invariant cache hit.
[2024-05-25 19:09:33] [INFO ] State equation strengthened by 343 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/922 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 826 unsolved
SMT process timed out in 30369ms, After SMT, problems are : Problem set: 0 solved, 826 unsolved
Search for dead transitions found 0 dead transitions in 30385ms
Finished structural reductions in LTL mode , in 1 iterations and 35812 ms. Remains : 923/923 places, 827/827 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 p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 152 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (155 resets) in 760 ms. (52 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
[2024-05-25 19:10:04] [INFO ] Invariant cache hit.
[2024-05-25 19:10:04] [INFO ] State equation strengthened by 343 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 136/139 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 784/923 variables, 197/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/923 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 827/1750 variables, 923/1123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1750 variables, 343/1466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1750 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1750 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1750/1750 variables, and 1466 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1348 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 923/923 constraints, ReadFeed: 343/343 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 136/139 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 784/923 variables, 197/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/923 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 827/1750 variables, 923/1123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1750 variables, 343/1466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1750 variables, 2/1468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1750 variables, 0/1468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1750 variables, 0/1468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1750/1750 variables, and 1468 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1388 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 923/923 constraints, ReadFeed: 343/343 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2777ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 200 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=20 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 12 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 430 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 380 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1377 reset in 1783 ms.
Product exploration explored 100000 steps with 1406 reset in 1983 ms.
Support contains 3 out of 923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 923/923 places, 827/827 transitions.
Applied a total of 0 rules in 18 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
[2024-05-25 19:10:13] [INFO ] Invariant cache hit.
[2024-05-25 19:10:14] [INFO ] Implicit Places using invariants in 1117 ms returned []
[2024-05-25 19:10:14] [INFO ] Invariant cache hit.
[2024-05-25 19:10:14] [INFO ] State equation strengthened by 343 read => feed constraints.
[2024-05-25 19:10:18] [INFO ] Implicit Places using invariants and state equation in 4022 ms returned []
Implicit Place search using SMT with State Equation took 5143 ms to find 0 implicit places.
Running 826 sub problems to find dead transitions.
[2024-05-25 19:10:18] [INFO ] Invariant cache hit.
[2024-05-25 19:10:18] [INFO ] State equation strengthened by 343 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/922 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 826 unsolved
SMT process timed out in 30206ms, After SMT, problems are : Problem set: 0 solved, 826 unsolved
Search for dead transitions found 0 dead transitions in 30216ms
Finished structural reductions in LTL mode , in 1 iterations and 35380 ms. Remains : 923/923 places, 827/827 transitions.
Treatment of property Parking-PT-864-LTLFireability-14 finished in 90187 ms.
[2024-05-25 19:10:48] [INFO ] Flatten gal took : 99 ms
[2024-05-25 19:10:48] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-05-25 19:10:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1040 places, 941 transitions and 3146 arcs took 20 ms.
Total runtime 474260 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Parking-PT-864

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1040
TRANSITIONS: 941
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.026s, Sys 0.018s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.008s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2230
MODEL NAME: /home/mcc/execution/415/model
1040 places, 941 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Parking-PT-864-LTLFireability-00 CANNOT_COMPUTE
FORMULA Parking-PT-864-LTLFireability-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716664617472

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Parking-PT-864"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Parking-PT-864, 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 r267-smll-171654405700100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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