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.r025-smll-171620166500364.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 AutonomousCar-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166500364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 17:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 12 17:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.5M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716362016413

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:13:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 07:13:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:13:38] [INFO ] Load time of PNML (sax parser for PT used): 560 ms
[2024-05-22 07:13:38] [INFO ] Transformed 97 places.
[2024-05-22 07:13:39] [INFO ] Transformed 1921 transitions.
[2024-05-22 07:13:39] [INFO ] Found NUPN structural information;
[2024-05-22 07:13:39] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 817 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 423 transitions
Reduce redundant transitions removed 423 transitions.
FORMULA AutonomousCar-PT-10a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 1498/1498 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 91 transition count 1442
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 91 transition count 1442
Applied a total of 12 rules in 56 ms. Remains 91 /97 variables (removed 6) and now considering 1442/1498 (removed 56) transitions.
// Phase 1: matrix 1442 rows 91 cols
[2024-05-22 07:13:39] [INFO ] Computed 14 invariants in 67 ms
[2024-05-22 07:13:39] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-22 07:13:39] [INFO ] Invariant cache hit.
[2024-05-22 07:13:40] [INFO ] State equation strengthened by 353 read => feed constraints.
[2024-05-22 07:13:40] [INFO ] Implicit Places using invariants and state equation in 838 ms returned [87, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1226 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/97 places, 1442/1498 transitions.
Applied a total of 0 rules in 10 ms. Remains 89 /89 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1321 ms. Remains : 89/97 places, 1442/1498 transitions.
Support contains 49 out of 89 places after structural reductions.
[2024-05-22 07:13:41] [INFO ] Flatten gal took : 499 ms
[2024-05-22 07:13:41] [INFO ] Flatten gal took : 316 ms
[2024-05-22 07:13:42] [INFO ] Input system was already deterministic with 1442 transitions.
Support contains 48 out of 89 places (down from 49) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 38 to 37
RANDOM walk for 40000 steps (1794 resets) in 5761 ms. (6 steps per ms) remains 27/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (12 resets) in 36 ms. (108 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (10 resets) in 35 ms. (111 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (16 resets) in 42 ms. (93 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (13 resets) in 34 ms. (114 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (13 resets) in 45 ms. (87 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (11 resets) in 27 ms. (142 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (11 resets) in 27 ms. (142 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (12 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (15 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (13 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (13 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (15 resets) in 46 ms. (85 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (11 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (13 resets) in 31 ms. (125 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (9 resets) in 37 ms. (105 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (13 resets) in 37 ms. (105 steps per ms) remains 25/25 properties
// Phase 1: matrix 1442 rows 89 cols
[2024-05-22 07:13:44] [INFO ] Computed 12 invariants in 24 ms
[2024-05-22 07:13:44] [INFO ] State equation strengthened by 353 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 40/81 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1435/1516 variables, 81/93 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1516 variables, 352/445 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1516 variables, 0/445 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 13/1529 variables, 7/452 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1529 variables, 0/452 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 1/1530 variables, 1/453 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1530 variables, 0/453 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 1/1531 variables, 1/454 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1531 variables, 0/454 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 0/1531 variables, 0/454 constraints. Problems are: Problem set: 2 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1531/1531 variables, and 454 constraints, problems are : Problem set: 2 solved, 23 unsolved in 4669 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 89/89 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 25/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 41/81 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1435/1516 variables, 81/93 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1516 variables, 352/445 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1516 variables, 0/445 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 13/1529 variables, 7/452 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1529 variables, 0/452 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 1/1530 variables, 1/453 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1530 variables, 0/453 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 1/1531 variables, 1/454 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1531 variables, 0/454 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 0/1531 variables, 0/454 constraints. Problems are: Problem set: 2 solved, 23 unsolved
No progress, stopping.
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 0)
(t2 15)
(t3 15)
(t4 1)
(t5 15)
(t6 0)
(t7 0)
(t8 0)
(t9 9)
(t10 0)
(t11 0)
(t12 0)
(t13 0)
(t14 1)
(t15 16)
(t16 0)
(t17 0)
(t18 0)
(t19 16)
(t20 0)
(t21 0)
(t22 15)
(t23 0)
(t24 0)
(t25 2)
(t26 2)
(t27 0)
(t28 1)
(t29 15)
(t30 1)
(t31 1)
(t32 0)
(t33 17)
(t34 0)
(t35 0)
(t36 0)
(t37 0)
(t38 17)
(t39 0)
(t40 0)
(t41 0)
(t42 1)
(t43 15)
(t44 0)
(t45 0)
(t46 0)
(t47 16)
(t48 0)
(t49 0)
(t50 2)
(t51 0)
(t52 0)
(t53 0)
(t54 0)
(t55 0)
(t56 0)
(t57 0)
(t58 0)
(t59 0)
(t60 0)
(t61 0)
(t62 0)
(t63 0)
(t64 0)
(t65 0)
(t66 0)
(t67 0)
(t68 0)
(t69 0)
(t70 0)
(t71 0)
(t72 0)
(t73 0)
(t74 0)
(t75 0)
(t76 0)
(t77 0)
(t78 0)
(t79 0)
(t80 0)
(t81 0)
(t82 0)
(t83 0)
(t84 0)
(t85 0)
(t86 0)
(t87 0)
(t88 0)
(t89 0)
(t90 0)
(t91 0)
(t92 0)
(t93 0)
(t94 0)
(t95 0)
(t96 0)
(t97 0)
(t98 0)
(t99 0)
(t100 0)
(t101 0)
(t102 0)
(t103 0)
(t104 0)
(t105 0)
(t106 0)
(t107 0)
(t108 0)
(t109 0)
(t110 0)
(t111 0)
(t112 0)
(t113 0)
(t114 0)
(t115 0)
(t116 0)
(t117 0)
(t118 0)
(t119 0)
(t120 0)
(t121 0)
(t122 0)
(t123 0)
(t124 0)
(t125 0)
(t126 0)
(t127 0)
(t128 0)
(t129 0)
(t130 0)
(t131 0)
(t132 0)
(t133 0)
(t134 0)
(t135 0)
(t136 0)
(t137 0)
(t138 0)
(t139 0)
(t140 0)
(t141 0)
(t142 0)
(t143 0)
(t144 0)
(t145 0)
(t146 0)
(t147 0)
(t148 0)
(t149 0)
(t150 0)
(t151 0)
(t152 0)
(t153 0)
(t154 0)
(t155 1)
(t156 0)
(t157 0)
(t158 0)
(t159 0)
(t160 0)
(t161 0)
(t162 0)
(t163 0)
(t164 0)
(t165 0)
(t166 0)
(t167 0)
(t168 0)
(t169 0)
(t170 0)
(t171 0)
(t172 0)
(t173 0)
(t174 0)
(t175 0)
(t176 0)
(t177 0)
(t178 0)
(t179 0)
(t180 0)
(t181 0)
(t182 0)
(t183 0)
(t184 0)
(t185 0)
(t186 0)
(t187 0)
(t188 0)
(t189 0)
(t190 0)
(t191 0)
(t192 0)
(t193 0)
(t194 0)
(t195 0)
(t196 0)
(t197 0)
(t198 1)
(t199 0)
(t200 0)
(t201 0)
(t202 0)
(t203 0)
(t204 0)
(t205 0)
(t206 0)
(t207 0)
(t208 0)
(t209 0)
(t210 0)
(t211 0)
(t212 0)
(t213 0)
(t214 0)
(t215 0)
(t216 0)
(t217 0)
(t218 0)
(t219 0)
(t220 0)
(t221 0)
(t222 0)
(t223 0)
(t224 0)
(t225 0)
(t226 0)
(t227 0)
(t228 0)
(t229 0)
(t230 0)
(t231 0)
(t232 0)
(t233 0)
(t234 0)
(t235 0)
(t236 0)
(t237 0)
(t238 0)
(t239 0)
(t240 0)
(t241 0)
(t242 0)
(t243 0)
(t244 0)
(t245 0)
(t246 0)
(t247 0)
(t248 0)
(t249 1)
(t250 0)
(t251 0)
(t252 0)
(t253 0)
(t254 0)
(t255 0)
(t256 0)
(t257 0)
(t258 0)
(t259 0)
(t260 0)
(t261 0)
(t262 0)
(t263 0)
(t264 0)
(t265 0)
(t266 0)
(t267 0)
(t268 0)
(t269 0)
(t270 0)
(t271 0)
(t272 0)
(t273 0)
(t274 0)
(t275 0)
(t276 0)
(t277 0)
(t278 0)
(t279 0)
(t280 0)
(t281 0)
(t282 0)
(t283 0)
(t284 0)
(t285 0)
(t286 0)
(t287 0)
(t288 0)
(t289 0)
(t290 0)
(t291 0)
(t292 0)
(t293 0)
(t294 0)
(t295 0)
(t296 0)
(t297 0)
(t298 0)
(t299 0)
(t300 0)
(t301 0)
(t302 0)
(t303 0)
(t304 0)
(t305 0)
(t306 1)
(t307 0)
(t308 0)
(t309 0)
(t310 0)
(t311 0)
(t312 0)
(t313 0)
(t314 0)
(t315 0)
(t316 0)
(t317 0)
(t318 0)
(t319 0)
(t320 0)
(t321 0)
(t322 0)
(t323 0)
(t324 0)
(t325 0)
(t326 0)
(t327 0)
(t328 0)
(t329 0)
(t330 0)
(t331 0)
(t332 0)
(t333 0)
(t334 0)
(t335 0)
(t336 0)
(t337 0)
(t338 0)
(t339 0)
(t340 0)
(t341 0)
(t342 0)
(t343 0)
(t344 0)
(t345 0)
(t346 0)
(t347 0)
(t348 0)
(t349 0)
(t350 0)
(t351 0)
(t352 0)
(t353 0)
(t354 0)
(t355 0)
(t356 0)
(t357 1)
(t358 0)
(t359 0)
(t360 0)
(t361 0)
(t362 0)
(t363 0)
(t364 0)
(t365 0)
(t366 0)
(t367 0)
(t368 0)
(t369 0)
(t370 0)
(t371 0)
(t372 0)
(t373 0)
(t374 0)
(t375 0)
(t376 0)
(t377 0)
(t378 0)
(t379 0)
(t380 0)
(t381 0)
(t382 0)
(t383 0)
(t384 0)
(t385 0)
(t386 0)
(t387 0)
(t388 0)
(t389 0)
(t390 0)
(t391 2)
(t392 2)
(t393 2)
(t394 2)
(t395 0)
(t396 0)
(t397 0)
(t398 0)
(t399 0)
(t400 0)
(t401 1)
(t402 1)
(t403 0)
(t404 0)
(t405 0)
(t406 0)
(t407 0)
(t408 0)
(t409 0)
(t410 0)
(t411 0)
(t412 0)
(t413 0)
(t414 0)
(t415 0)
(t416 0)
(t417 0)
(t418 0)
(t419 0)
(t420 0)
(t421 0)
(t422 0)
(t423 0)
(t424 0)
(t425 0)
(t426 0)
(t427 0)
(t428 0)
(t429 0)
(t430 0)
(t431 0)
(t432 0)
(t433 0)
(t434 0)
(t435 0)
(t436 0)
(t437 0)
(t438 0)
(t439 0)
(t440 0)
(t441 0)
(t442 0)
(t443 0)
(t444 0)
(t445 0)
(t446 0)
(t447 0)
(t448 0)
(t449 0)
(t450 0)
(t451 0)
(t452 0)
(t453 0)
(t454 0)
(t455 0)
(t456 0)
(t457 0)
(t458 0)
(t459 0)
(t460 0)
(t461 0)
(t462 0)
(t463 0)
(t464 0)
(t465 0)
(t466 0)
(t467 0)
(t468 0)
(t469 0)
(t470 0)
(t471 0)
(t472 0)
(t473 0)
(t474 0)
(t475 0)
(t476 0)
(t477 0)
(t478 0)
(t479 0)
(t480 0)
(t481 0)
(t482 0)
(t483 0)
(t484 0)
(t485 0)
(t486 0)
(t487 0)
(t488 0)
(t489 0)
(t490 0)
(t491 0)
(t492 0)
(t493 0)
(t494 0)
(t495 0)
(t496 0)
(t497 0)
(t498 0)
(t499 0)
(t500 0)
(t501 0)
(t502 0)
(t503 0)
(t504 0)
(t505 0)
(t506 0)
(t507 0)
(t508 0)
(t509 0)
(t510 0)
(t511 0)
(t512 0)
(t513 0)
(t514 0)
(t515 0)
(t516 0)
(t517 0)
(t518 0)
(t519 0)
(t520 0)
(t521 0)
(t522 0)
(t523 0)
(t524 0)
(t525 0)
(t526 0)
(t527 0)
(t528 0)
(t529 0)
(t530 0)
(t531 0)
(t532 0)
(t533 0)
(t534 0)
(t535 0)
(t536 0)
(t537 0)
(t538 0)
(t539 0)
(t540 0)
(t541 0)
(t542 0)
(t543 0)
(t544 6)
(t545 0)
(t546 0)
(t547 0)
(t548 0)
(t549 0)
(t550 0)
(t551 0)
(t552 0)
(t553 0)
(t554 0)
(t555 0)
(t556 0)
(t557 0)
(t558 0)
(t559 0)
(t560 2)
(t561 0)
(t562 0)
(t563 0)
(t564 0)
(t565 0)
(t566 0)
(t567 0)
(t568 0)
(t569 0)
(t570 0)
(t571 0)
(t572 0)
(t573 0)
(t574 0)
(t575 0)
(t576 0)
(t577 0)
(t578 0)
(t579 0)
(t580 0)
(t581 0)
(t582 0)
(t583 0)
(t584 0)
(t585 0)
(t586 0)
(t587 0)
(t588 0)
(t589 0)
(t590 0)
(t591 0)
(t592 0)
(t593 0)
(t594 0)
(t595 0)
(t596 0)
(t597 0)
(t598 0)
(t599 0)
(t600 0)
(t601 0)
(t602 0)
(t603 0)
(t604 0)
(t605 0)
(t606 0)
(t607 0)
(t608 0)
(t609 0)
(t610 0)
(t611 0)
(t612 0)
(t613 0)
(t614 0)
(t615 0)
(t616 0)
(t617 0)
(t618 0)
(t619 0)
(t620 0)
(t621 0)
(t622 0)
(t623 0)
(t624 0)
(t625 0)
(t626 0)
(t627 0)
(t628 0)
(t629 0)
(t630 0)
(t631 0)
(t632 0)
(t633 0)
(t634 0)
(t635 0)
(t636 0)
(t637 0)
(t638 0)
(t639 0)
(t640 0)
(t641 0)
(t642 0)
(t643 0)
(t644 0)
(t645 0)
(t646 0)
(t647 0)
(t648 0)
(t649 0)
(t650 0)
(t651 0)
(t652 0)
(t653 0)
(t654 0)
(t655 0)
(t656 0)
(t657 0)
(t658 0)
(t659 0)
(t660 0)
(t661 0)
(t662 0)
(t663 0)
(t664 0)
(t665 0)
(t666 0)
(t667 0)
(t668 0)
(t669 0)
(t670 0)
(t671 0)
(t672 1)
(t673 0)
(t674 0)
(t675 0)
(t676 0)
(t677 0)
(t678 0)
(t679 0)
(t680 0)
(t681 0)
(t682 0)
(t683 0)
(t684 0)
(t685 0)
(t686 0)
(t687 0)
(t688 0)
(t689 0)
(t690 0)
(t691 0)
(t692 0)
(t693 0)
(t694 0)
(t695 0)
(t696 0)
(t697 0)
(t698 0)
(t699 0)
(t700 0)
(t701 0)
(t702 0)
(t703 0)
(t704 0)
(t705 0)
(t706 0)
(t707 0)
(t708 0)
(t709 0)
(t710 0)
(t711 0)
(t712 0)
(t713 0)
(t714 0)
(t715 0)
(t716 0)
(t717 0)
(t718 0)
(t719 0)
(t720 0)
(t721 0)
(t722 0)
(t723 0)
(t724 0)
(t725 0)
(t726 0)
(t727 0)
(t728 0)
(t729 0)
(t730 0)
(t731 0)
(t732 0)
(t733 0)
(t734 0)
(t735 0)
(t736 0)
(t737 0)
(t738 0)
(t739 0)
(t740 0)
(t741 0)
(t742 0)
(t743 0)
(t744 0)
(t745 0)
(t746 0)
(t747 0)
(t748 0)
(t749 0)
(t750 0)
(t751 0)
(t752 0)
(t753 0)
(t754 0)
(t755 0)
(t756 0)
(t757 0)
(t758 0)
(t759 0)
(t760 0)
(t761 0)
(t762 0)
(t763 0)
(t764 0)
(t765 0)
(t766 0)
(t767 0)
(t768 0)
(t769 0)
(t770 0)
(t771 0)
(t772 0)
(t773 0)
(t774 0)
(t775 0)
(t776 0)
(t777 0)
(t778 0)
(t779 0)
(t780 0)
(t781 0)
(t782 0)
(t783 0)
(t784 0)
(t785 0)
(t786 0)
(t787 0)
(t788 0)
(t789 0)
(t790 0)
(t791 0)
(t792 0)
(t793 0)
(t794 0)
(t795 0)
(t796 0)
(t797 0)
(t798 0)
(t799 0)
(t800 5)
(t801 0)
(t802 0)
(t803 0)
(t804 0)
(t805 0)
(t806 0)
(t807 0)
(t808 0)
(t809 0)
(t810 0)
(t811 0)
(t812 0)
(t813 0)
(t814 0)
(t815 0)
(t816 0)
(t817 0)
(t818 0)
(t819 0)
(t820 0)
(t821 0)
(t822 0)
(t823 0)
(t824 0)
(t825 0)
(t826 0)
(t827 0)
(t828 0)
(t829 0)
(t830 0)
(t831 0)
(t832 0)
(t833 0)
(t834 0)
(t835 0)
(t836 0)
(t837 0)
(t838 0)
(t839 0)
(t840 0)
(t841 0)
(t842 0)
(t843 0)
(t844 0)
(t845 0)
(t846 0)
(t847 0)
(t848 0)
(t849 0)
(t850 0)
(t851 0)
(t852 0)
(t853 0)
(t854 0)
(t855 0)
(t856 0)
(t857 0)
(t858 0)
(t859 0)
(t860 0)
(t861 0)
(t862 0)
(t863 1)
(t864 0)
(t865 0)
(t866 0)
(t867 0)
(t868 0)
(t869 0)
(t870 0)
(t871 0)
(t872 0)
(t873 0)
(t874 0)
(t875 0)
(t876 0)
(t877 0)
(t878 0)
(t879 0)
(t880 0)
(t881 0)
(t882 0)
(t883 0)
(t884 0)
(t885 0)
(t886 0)
(t887 0)
(t888 0)
(t889 0)
(t890 0)
(t891 0)
(t892 0)
(t893 0)
(t894 0)
(t895 0)
(t896 0)
(t897 0)
(t898 0)
(t899 0)
(t900 0)
(t901 0)
(t902 0)
(t903 0)
(t904 0)
(t905 0)
(t906 0)
(t907 0)
(t908 0)
(t909 0)
(t910 0)
(t911 0)
(t912 0)
(t913 0)
(t914 0)
(t915 0)
(t916 0)
(t917 0)
(t918 0)
(t919 0)
(t920 0)
(t921 0)
(t922 0)
(t923 0)
(t924 0)
(t925 0)
(t926 0)
(t927 0)
(t928 0)
(t929 0)
(t930 0)
(t931 0)
(t932 0)
(t933 0)
(t934 0)
(t935 0)
(t936 0)
(t937 0)
(t938 0)
(t939 0)
(t940 0)
(t941 0)
(t942 0)
(t943 0)
(t944 0)
(t945 0)
(t946 0)
(t947 0)
(t948 0)
(t949 0)
(t950 0)
(t951 0)
(t952 0)
(t953 0)
(t954 0)
(t955 0)
(t956 0)
(t957 0)
(t958 0)
(t959 0)
(t960 0)
(t961 0)
(t962 0)
(t963 0)
(t964 0)
(t965 0)
(t966 0)
(t967 0)
(t968 0)
(t969 0)
(t970 0)
(t971 0)
(t972 0)
(t973 0)
(t974 0)
(t975 0)
(t976 0)
(t977 0)
(t978 0)
(t979 0)
(t980 0)
(t981 0)
(t982 0)
(t983 0)
(t984 0)
(t985 0)
(t986 0)
(t987 0)
(t988 0)
(t989 0)
(t990 0)
(t991 0)
(t992 0)
(t993 0)
(t994 0)
(t995 0)
(t996 0)
(t997 0)
(t998 0)
(t999 0)
(t1000 0)
(t1001 0)
(t1002 0)
(t1003 0)
(t1004 0)
(t1005 0)
(t1006 0)
(t1007 0)
(t1008 0)
(t1009 0)
(t1010 0)
(t1011 0)
(t1012 0)
(t1013 0)
(t1014 0)
(t1015 0)
(t1016 0)
(t1017 0)
(t1018 0)
(t1019 0)
(t1020 0)
(t1021 0)
(t1022 0)
(t1023 0)
(t1024 0)
(t1025 0)
(t1026 0)
(t1027 0)
(t1028 0)
(t1029 0)
(t1030 0)
(t1031 0)
(t1032 0)
(t1033 0)
(t1034 0)
(t1035 0)
(t1036 0)
(t1037 0)
(t1038 0)
(t1039 0)
(t1040 0)
(t1041 0)
(t1042 0)
(t1043 0)
(t1044 0)
(t1045 0)
(t1046 0)
(t1047 0)
(t1048 0)
(t1049 0)
(t1050 0)
(t1051 0)
(t1052 0)
(t1053 0)
(t1054 0)
(t1055 0)
(t1056 0)
(t1057 0)
(t1058 0)
(t1059 0)
(t1060 0)
(t1061 0)
(t1062 0)
(t1063 0)
(t1064 0)
(t1065 0)
(t1066 0)
(t1067 0)
(t1068 0)
(t1069 0)
(t1070 0)
(t1071 0)
(t1072 0)
(t1073 0)
(t1074 0)
(t1075 0)
(t1076 0)
(t1077 0)
(t1078 0)
(t1079 0)
(t1080 0)
(t1081 0)
(t1082 0)
(t1083 0)
(t1084 0)
(t1085 0)
(t1086 0)
(t1087 0)
(t1088 0)
(t1089 0)
(t1090 0)
(t1091 0)
(t1092 0)
(t1093 0)
(t1094 0)
(t1095 0)
(t1096 0)
(t1097 0)
(t1098 0)
(t1099 0)
(t1100 0)
(t1101 0)
(t1102 0)
(t1103 0)
(t1104 0)
(t1105 0)
(t1106 0)
(t1107 0)
(t1108 0)
(t1109 0)
(t1110 0)
(t1111 0)
(t1112 0)
(t1113 0)
(t1114 0)
(t1115 0)
(t1116 0)
(t1117 0)
(t1118 0)
(t1119 0)
(t1120 0)
(t1121 0)
(t1122 0)
(t1123 0)
(t1124 0)
(t1125 0)
(t1126 0)
(t1127 0)
(t1128 0)
(t1129 0)
(t1130 0)
(t1131 0)
(t1132 0)
(t1133 0)
(t1134 0)
(t1135 0)
(t1136 0)
(t1137 0)
(t1138 0)
(t1139 0)
(t1140 0)
(t1141 0)
(t1142 0)
(t1143 0)
(t1144 0)
(t1145 0)
(t1146 0)
(t1147 0)
(t1148 0)
(t1149 0)
(t1150 0)
(t1151 0)
(t1152 0)
(t1153 0)
(t1154 0)
(t1155 0)
(t1156 0)
(t1157 0)
(t1158 0)
(t1159 0)
(t1160 0)
(t1161 0)
(t1162 0)
(t1163 0)
(t1164 0)
(t1165 0)
(t1166 0)
(t1167 0)
(t1168 0)
(t1169 0)
(t1170 0)
(t1171 0)
(t1172 0)
(t1173 0)
(t1174 0)
(t1175 0)
(t1176 0)
(t1177 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
After SMT solving in domain Int declared 1531/1531 variables, and 454 constraints, problems are : Problem set: 2 solved, 23 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 89/89 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 23/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10802ms problems are : Problem set: 2 solved, 23 unsolved
Fused 23 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 40 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Graph (complete) has 1186 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.36 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 88 transition count 1434
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 84 transition count 1432
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 82 transition count 1432
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 16 place count 82 transition count 1429
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 22 place count 79 transition count 1429
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 26 place count 75 transition count 1395
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 75 transition count 1395
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 74 transition count 1394
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 74 transition count 1388
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 46 rules applied. Total rules applied 84 place count 68 transition count 1348
Applied a total of 84 rules in 543 ms. Remains 68 /89 variables (removed 21) and now considering 1348/1442 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 544 ms. Remains : 68/89 places, 1348/1442 transitions.
RANDOM walk for 40000 steps (262 resets) in 2038 ms. (19 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4003 steps (12 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (13 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (14 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (13 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (15 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (12 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (15 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (14 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4004 steps (14 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
// Phase 1: matrix 1348 rows 68 cols
[2024-05-22 07:13:56] [INFO ] Computed 14 invariants in 13 ms
[2024-05-22 07:13:56] [INFO ] State equation strengthened by 281 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 28/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1348/1416 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1416 variables, 281/363 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1416/1416 variables, and 363 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1954 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 20/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 28/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1348/1416 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1416 variables, 281/363 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1416/1416 variables, and 363 constraints, problems are : Problem set: 0 solved, 20 unsolved in 2931 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 20/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5384ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 3 properties in 1903 ms.
Support contains 39 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 1348/1348 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 1347
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 67 transition count 1337
Applied a total of 12 rules in 272 ms. Remains 67 /68 variables (removed 1) and now considering 1337/1348 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 67/68 places, 1337/1348 transitions.
RANDOM walk for 40000 steps (241 resets) in 1568 ms. (25 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (16 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 20 ms. (190 steps per ms) remains 13/16 properties
BEST_FIRST walk for 4004 steps (14 resets) in 21 ms. (182 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (14 resets) in 16 ms. (235 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 12/12 properties
// Phase 1: matrix 1337 rows 67 cols
[2024-05-22 07:14:04] [INFO ] Computed 14 invariants in 12 ms
[2024-05-22 07:14:04] [INFO ] State equation strengthened by 271 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 29/66 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1337/1404 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1404 variables, 271/352 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1404 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/1404 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1404/1404 variables, and 352 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1250 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 67/67 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 29/66 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1337/1404 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1404 variables, 271/352 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1404 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/1404 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1404/1404 variables, and 352 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1789 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 67/67 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3315ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 2 properties in 14692 ms.
Support contains 35 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 1337/1337 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 1336
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 66 transition count 1326
Applied a total of 12 rules in 175 ms. Remains 66 /67 variables (removed 1) and now considering 1326/1337 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 66/67 places, 1326/1337 transitions.
RANDOM walk for 40000 steps (71 resets) in 1477 ms. (27 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (108 resets) in 186 ms. (213 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (90 resets) in 178 ms. (223 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (83 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (20 resets) in 127 ms. (312 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (40 resets) in 125 ms. (317 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (95 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
// Phase 1: matrix 1326 rows 66 cols
[2024-05-22 07:14:23] [INFO ] Computed 14 invariants in 10 ms
[2024-05-22 07:14:23] [INFO ] State equation strengthened by 261 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 28/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 28/66 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1326/1392 variables, 66/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1392 variables, 261/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1392 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1392 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1392/1392 variables, and 341 constraints, problems are : Problem set: 0 solved, 4 unsolved in 967 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 66/66 constraints, ReadFeed: 261/261 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 28/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 28/66 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1326/1392 variables, 66/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1392 variables, 261/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1392 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1392 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1392/1392 variables, and 341 constraints, problems are : Problem set: 0 solved, 4 unsolved in 911 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 66/66 constraints, ReadFeed: 261/261 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1986ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 4177 ms.
Support contains 10 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 1326/1326 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 1325
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 65 transition count 1325
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 63 transition count 1323
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 63 transition count 1320
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 32 place count 60 transition count 1300
Applied a total of 32 rules in 260 ms. Remains 60 /66 variables (removed 6) and now considering 1300/1326 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 60/66 places, 1300/1326 transitions.
RANDOM walk for 40000 steps (22 resets) in 1866 ms. (21 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (61 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (97 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (50 resets) in 134 ms. (296 steps per ms) remains 2/4 properties
// Phase 1: matrix 1300 rows 60 cols
[2024-05-22 07:14:30] [INFO ] Computed 14 invariants in 8 ms
[2024-05-22 07:14:30] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/60 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1300/1360 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1360 variables, 241/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1360 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1360 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1360/1360 variables, and 315 constraints, problems are : Problem set: 0 solved, 2 unsolved in 742 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 60/60 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/60 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1300/1360 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1360 variables, 241/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1360 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1360 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1360/1360 variables, and 315 constraints, problems are : Problem set: 0 solved, 2 unsolved in 633 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 60/60 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1468ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1865 ms.
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1300/1300 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 1289
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 1289
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 59 transition count 1288
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 14 place count 58 transition count 1278
Applied a total of 14 rules in 197 ms. Remains 58 /60 variables (removed 2) and now considering 1278/1300 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 58/60 places, 1278/1300 transitions.
RANDOM walk for 40000 steps (17 resets) in 1118 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (44 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (100 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 428650 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 2
Probabilistic random walk after 428650 steps, saw 63906 distinct states, run finished after 3007 ms. (steps per millisecond=142 ) properties seen :0
// Phase 1: matrix 1278 rows 58 cols
[2024-05-22 07:14:37] [INFO ] Computed 14 invariants in 8 ms
[2024-05-22 07:14:37] [INFO ] State equation strengthened by 221 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/58 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1336 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1336 variables, 221/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 758 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/58 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1336 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1336 variables, 221/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1444ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1986 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 79 ms. Remains 58 /58 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 58/58 places, 1278/1278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 82 ms. Remains 58 /58 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
[2024-05-22 07:14:41] [INFO ] Invariant cache hit.
[2024-05-22 07:14:42] [INFO ] Implicit Places using invariants in 658 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 663 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 57/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 79 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 826 ms. Remains : 57/58 places, 1278/1278 transitions.
RANDOM walk for 40000 steps (12 resets) in 1326 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (44 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (109 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 445017 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 2
Probabilistic random walk after 445017 steps, saw 66163 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
// Phase 1: matrix 1278 rows 57 cols
[2024-05-22 07:14:45] [INFO ] Computed 13 invariants in 12 ms
[2024-05-22 07:14:45] [INFO ] State equation strengthened by 221 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/57 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1335 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 221/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1335/1335 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 703 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/57 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1335 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 221/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1335/1335 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 616 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1388ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 1571 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1278/1278 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 56 transition count 1267
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 56 transition count 1267
Applied a total of 2 rules in 109 ms. Remains 56 /57 variables (removed 1) and now considering 1267/1278 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 56/57 places, 1267/1278 transitions.
RANDOM walk for 40000 steps (10 resets) in 1157 ms. (34 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (44 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 618465 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 1
Probabilistic random walk after 618465 steps, saw 89115 distinct states, run finished after 3002 ms. (steps per millisecond=206 ) properties seen :0
// Phase 1: matrix 1267 rows 56 cols
[2024-05-22 07:14:52] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 07:14:52] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/56 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1267/1323 variables, 56/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1323 variables, 211/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1323 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1323 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1323/1323 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 56/56 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/56 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1267/1323 variables, 56/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1323 variables, 211/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1323 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1323 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1323/1323 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 56/56 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1184ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 379 ms.
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 85 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 56/56 places, 1267/1267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 85 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2024-05-22 07:14:53] [INFO ] Invariant cache hit.
[2024-05-22 07:14:54] [INFO ] Implicit Places using invariants in 666 ms returned []
[2024-05-22 07:14:54] [INFO ] Invariant cache hit.
[2024-05-22 07:14:54] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-22 07:14:55] [INFO ] Implicit Places using invariants and state equation in 1229 ms returned []
Implicit Place search using SMT with State Equation took 1898 ms to find 0 implicit places.
[2024-05-22 07:14:55] [INFO ] Redundant transitions in 108 ms returned []
Running 1266 sub problems to find dead transitions.
[2024-05-22 07:14:55] [INFO ] Invariant cache hit.
[2024-05-22 07:14:55] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
[2024-05-22 07:15:36] [INFO ] Deduced a trap composed of 23 places in 1077 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
SMT process timed out in 54622ms, After SMT, problems are : Problem set: 0 solved, 1266 unsolved
Search for dead transitions found 0 dead transitions in 54658ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56785 ms. Remains : 56/56 places, 1267/1267 transitions.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 11 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 23 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-22 07:15:51] [INFO ] Computed 12 invariants in 9 ms
[2024-05-22 07:15:51] [INFO ] Implicit Places using invariants in 734 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 738 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/89 places, 1387/1442 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 767 ms. Remains : 83/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 95060 steps with 4388 reset in 2257 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-00 finished in 3352 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((X(G((p0||F(p1))))&&F(p2))))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 89 transition count 1434
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 81 transition count 1433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 80 transition count 1433
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 80 transition count 1431
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 78 transition count 1431
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 27 place count 73 transition count 1376
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 73 transition count 1376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 72 transition count 1375
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 71 transition count 1375
Applied a total of 36 rules in 309 ms. Remains 71 /89 variables (removed 18) and now considering 1375/1442 (removed 67) transitions.
// Phase 1: matrix 1375 rows 71 cols
[2024-05-22 07:15:54] [INFO ] Computed 12 invariants in 6 ms
[2024-05-22 07:15:55] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-22 07:15:55] [INFO ] Invariant cache hit.
[2024-05-22 07:15:55] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-22 07:15:55] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1310 ms to find 0 implicit places.
[2024-05-22 07:15:56] [INFO ] Redundant transitions in 76 ms returned []
Running 1374 sub problems to find dead transitions.
[2024-05-22 07:15:56] [INFO ] Invariant cache hit.
[2024-05-22 07:15:56] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 3 (OVERLAPS) 1374/1445 variables, 71/83 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
SMT process timed out in 56353ms, After SMT, problems are : Problem set: 0 solved, 1374 unsolved
Search for dead transitions found 0 dead transitions in 56376ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/89 places, 1375/1442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58088 ms. Remains : 71/89 places, 1375/1442 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-02
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-02 finished in 58359 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))||(X(p1)&&(!p2 U (p3||G(!p2))))))'
Support contains 21 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 13 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-22 07:16:52] [INFO ] Computed 12 invariants in 9 ms
[2024-05-22 07:16:52] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-22 07:16:52] [INFO ] Invariant cache hit.
[2024-05-22 07:16:53] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-22 07:16:53] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-05-22 07:16:53] [INFO ] Invariant cache hit.
[2024-05-22 07:16:53] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
SMT process timed out in 54786ms, After SMT, problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 54806ms
Starting structural reductions in LTL mode, iteration 1 : 84/89 places, 1387/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55874 ms. Remains : 84/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) p2)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-03
Product exploration timeout after 75510 steps with 37755 reset in 10002 ms.
Product exploration timeout after 74600 steps with 37300 reset in 10001 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) (NOT p0) p1), (X (NOT p2)), (X p3), (X (NOT p0)), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 26 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-03 finished in 76155 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((F(G(p0))&&F(p1))) U p2)))'
Support contains 8 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 87 transition count 1420
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 1420
Applied a total of 4 rules in 15 ms. Remains 87 /89 variables (removed 2) and now considering 1420/1442 (removed 22) transitions.
// Phase 1: matrix 1420 rows 87 cols
[2024-05-22 07:18:08] [INFO ] Computed 12 invariants in 9 ms
[2024-05-22 07:18:09] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-05-22 07:18:09] [INFO ] Invariant cache hit.
[2024-05-22 07:18:10] [INFO ] State equation strengthened by 333 read => feed constraints.
[2024-05-22 07:18:10] [INFO ] Implicit Places using invariants and state equation in 1363 ms returned []
Implicit Place search using SMT with State Equation took 2036 ms to find 0 implicit places.
Running 1419 sub problems to find dead transitions.
[2024-05-22 07:18:10] [INFO ] Invariant cache hit.
[2024-05-22 07:18:10] [INFO ] State equation strengthened by 333 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1419/1506 variables, 87/99 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
SMT process timed out in 55372ms, After SMT, problems are : Problem set: 0 solved, 1419 unsolved
Search for dead transitions found 0 dead transitions in 55392ms
Starting structural reductions in LTL mode, iteration 1 : 87/89 places, 1420/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57453 ms. Remains : 87/89 places, 1420/1442 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-04
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-04 finished in 57695 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 p1)) U !p0)))'
Support contains 15 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 85 transition count 1398
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 85 transition count 1398
Applied a total of 8 rules in 12 ms. Remains 85 /89 variables (removed 4) and now considering 1398/1442 (removed 44) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2024-05-22 07:19:06] [INFO ] Computed 12 invariants in 9 ms
[2024-05-22 07:19:06] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-22 07:19:06] [INFO ] Invariant cache hit.
[2024-05-22 07:19:07] [INFO ] State equation strengthened by 313 read => feed constraints.
[2024-05-22 07:19:07] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
Running 1397 sub problems to find dead transitions.
[2024-05-22 07:19:07] [INFO ] Invariant cache hit.
[2024-05-22 07:19:07] [INFO ] State equation strengthened by 313 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1397/1482 variables, 85/97 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
SMT process timed out in 55304ms, After SMT, problems are : Problem set: 0 solved, 1397 unsolved
Search for dead transitions found 0 dead transitions in 55324ms
Starting structural reductions in LTL mode, iteration 1 : 85/89 places, 1398/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56606 ms. Remains : 85/89 places, 1398/1442 transitions.
Stuttering acceptance computed with spot in 173 ms :[p0, p0, (NOT p1), (NOT p1), true]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-05
Product exploration timeout after 76100 steps with 38050 reset in 10001 ms.
Product exploration timeout after 76050 steps with 38025 reset in 10001 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-05 finished in 76840 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(p1)&&p0)))'
Support contains 11 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 89 transition count 1432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 77 transition count 1430
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 72 transition count 1375
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 72 transition count 1375
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 71 transition count 1374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 70 transition count 1374
Applied a total of 38 rules in 215 ms. Remains 70 /89 variables (removed 19) and now considering 1374/1442 (removed 68) transitions.
// Phase 1: matrix 1374 rows 70 cols
[2024-05-22 07:20:23] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 07:20:24] [INFO ] Implicit Places using invariants in 567 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 571 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/89 places, 1374/1442 transitions.
Applied a total of 0 rules in 102 ms. Remains 69 /69 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 891 ms. Remains : 69/89 places, 1374/1442 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-06
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-06 finished in 1018 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(p1)||p0)))'
Support contains 18 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 89 transition count 1432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 77 transition count 1430
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 72 transition count 1375
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 72 transition count 1375
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 71 transition count 1374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 70 transition count 1374
Applied a total of 38 rules in 203 ms. Remains 70 /89 variables (removed 19) and now considering 1374/1442 (removed 68) transitions.
[2024-05-22 07:20:24] [INFO ] Invariant cache hit.
[2024-05-22 07:20:25] [INFO ] Implicit Places using invariants in 383 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 386 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/89 places, 1374/1442 transitions.
Applied a total of 0 rules in 99 ms. Remains 69 /69 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 689 ms. Remains : 69/89 places, 1374/1442 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-07
Product exploration explored 100000 steps with 123 reset in 201 ms.
Product exploration explored 100000 steps with 579 reset in 431 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (2254 resets) in 1656 ms. (24 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (47 resets) in 302 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (156 resets) in 193 ms. (206 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (125 resets) in 189 ms. (210 steps per ms) remains 1/2 properties
// Phase 1: matrix 1374 rows 69 cols
[2024-05-22 07:20:26] [INFO ] Computed 11 invariants in 10 ms
[2024-05-22 07:20:26] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/52 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/63 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1371/1434 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1434 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/1442 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1442 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1443 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1443 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1443 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1443/1443 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 541 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 52/1443 variables, and 10 constraints, problems are : Problem set: 1 solved, 0 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, State Equation: 0/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 655ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-07 finished in 3155 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(p0)&&G(p1))))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 11 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-22 07:20:27] [INFO ] Computed 12 invariants in 9 ms
[2024-05-22 07:20:27] [INFO ] Implicit Places using invariants in 348 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 351 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/89 places, 1387/1442 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 367 ms. Remains : 83/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-08
Product exploration explored 100000 steps with 1391 reset in 758 ms.
Product exploration explored 100000 steps with 2546 reset in 1224 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 90 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (1853 resets) in 1401 ms. (28 steps per ms) remains 1/1 properties
BEST_FIRST walk for 23626 steps (81 resets) in 220 ms. (106 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 6 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-08 finished in 3329 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&&(!p1 U (G(!p1)||(!p1&&(!p2 U (p3||G(!p2))))))))))'
Support contains 19 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 13 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
[2024-05-22 07:20:30] [INFO ] Invariant cache hit.
[2024-05-22 07:20:31] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-22 07:20:31] [INFO ] Invariant cache hit.
[2024-05-22 07:20:31] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-22 07:20:32] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1192 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-05-22 07:20:32] [INFO ] Invariant cache hit.
[2024-05-22 07:20:32] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
SMT process timed out in 54968ms, After SMT, problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 54985ms
Starting structural reductions in LTL mode, iteration 1 : 84/89 places, 1387/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56193 ms. Remains : 84/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-09
Product exploration explored 100000 steps with 1124 reset in 726 ms.
Product exploration explored 100000 steps with 1211 reset in 794 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 124 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))]
RANDOM walk for 40000 steps (1851 resets) in 1983 ms. (20 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (102 resets) in 124 ms. (320 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (40 resets) in 611 ms. (65 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40004 steps (102 resets) in 845 ms. (47 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (97 resets) in 730 ms. (54 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (105 resets) in 510 ms. (78 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (104 resets) in 215 ms. (185 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (99 resets) in 227 ms. (175 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (102 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
[2024-05-22 07:21:30] [INFO ] Invariant cache hit.
[2024-05-22 07:21:30] [INFO ] State equation strengthened by 303 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf3 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 57/76 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1380/1456 variables, 76/88 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 302/390 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1456 variables, 0/390 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 13/1469 variables, 7/397 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 0/397 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1470 variables, 1/398 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1150 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 57/76 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1380/1456 variables, 76/88 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 302/390 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1456 variables, 0/390 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 13/1469 variables, 7/397 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 0/397 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1470 variables, 1/398 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1455 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2812ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2216 ms.
Support contains 19 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Graph (complete) has 1126 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 83 transition count 1376
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 76 transition count 1375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 75 transition count 1375
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 20 place count 75 transition count 1372
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 72 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 71 transition count 1371
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 71 transition count 1371
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 70 transition count 1370
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 39 place count 70 transition count 1361
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 3 with 79 rules applied. Total rules applied 118 place count 61 transition count 1291
Applied a total of 118 rules in 239 ms. Remains 61 /84 variables (removed 23) and now considering 1291/1387 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 61/84 places, 1291/1387 transitions.
RANDOM walk for 40000 steps (34 resets) in 1276 ms. (31 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (103 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (69 resets) in 152 ms. (261 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (98 resets) in 154 ms. (258 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (96 resets) in 154 ms. (258 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (52 resets) in 111 ms. (357 steps per ms) remains 2/5 properties
// Phase 1: matrix 1291 rows 61 cols
[2024-05-22 07:21:36] [INFO ] Computed 14 invariants in 8 ms
[2024-05-22 07:21:36] [INFO ] State equation strengthened by 231 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1291/1352 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1352 variables, 231/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1352 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1352/1352 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 587 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1291/1352 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1352 variables, 231/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1352 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1352/1352 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1324ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 628 ms.
Support contains 17 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1291/1291 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 1290
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 60 transition count 1280
Applied a total of 12 rules in 148 ms. Remains 60 /61 variables (removed 1) and now considering 1280/1291 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 60/61 places, 1280/1291 transitions.
RANDOM walk for 40000 steps (21 resets) in 1268 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (40 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (37 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 348147 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 2
Probabilistic random walk after 348147 steps, saw 52945 distinct states, run finished after 3004 ms. (steps per millisecond=115 ) properties seen :0
// Phase 1: matrix 1280 rows 60 cols
[2024-05-22 07:21:42] [INFO ] Computed 14 invariants in 7 ms
[2024-05-22 07:21:42] [INFO ] State equation strengthened by 221 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/59 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1280/1340 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 221/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1340/1340 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 60/60 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/59 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1280/1340 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 221/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1340/1340 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 666 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 60/60 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1321ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 671 ms.
Support contains 17 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1280/1280 transitions.
Applied a total of 0 rules in 72 ms. Remains 60 /60 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 60/60 places, 1280/1280 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1280/1280 transitions.
Applied a total of 0 rules in 71 ms. Remains 60 /60 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2024-05-22 07:21:44] [INFO ] Invariant cache hit.
[2024-05-22 07:21:44] [INFO ] Implicit Places using invariants in 347 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 350 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/60 places, 1280/1280 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 1279
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 1279
Applied a total of 2 rules in 84 ms. Remains 58 /59 variables (removed 1) and now considering 1279/1280 (removed 1) transitions.
// Phase 1: matrix 1279 rows 58 cols
[2024-05-22 07:21:44] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 07:21:45] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-22 07:21:45] [INFO ] Invariant cache hit.
[2024-05-22 07:21:45] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-22 07:21:46] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/60 places, 1279/1280 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1637 ms. Remains : 58/60 places, 1279/1280 transitions.
RANDOM walk for 40000 steps (26 resets) in 1442 ms. (27 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (52 resets) in 145 ms. (273 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (48 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 355835 steps, run timeout after 3003 ms. (steps per millisecond=118 ) properties seen :0 out of 2
Probabilistic random walk after 355835 steps, saw 54081 distinct states, run finished after 3004 ms. (steps per millisecond=118 ) properties seen :0
[2024-05-22 07:21:49] [INFO ] Invariant cache hit.
[2024-05-22 07:21:49] [INFO ] State equation strengthened by 221 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1337/1337 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 563 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1251ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 591 ms.
Support contains 17 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 71 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 58/58 places, 1279/1279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 70 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
[2024-05-22 07:21:51] [INFO ] Invariant cache hit.
[2024-05-22 07:21:51] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-22 07:21:51] [INFO ] Invariant cache hit.
[2024-05-22 07:21:52] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-22 07:21:52] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
[2024-05-22 07:21:52] [INFO ] Redundant transitions in 45 ms returned []
Running 1278 sub problems to find dead transitions.
[2024-05-22 07:21:52] [INFO ] Invariant cache hit.
[2024-05-22 07:21:52] [INFO ] State equation strengthened by 221 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
[2024-05-22 07:22:39] [INFO ] Deduced a trap composed of 23 places in 1524 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 58/1337 variables, and 14 constraints, problems are : Problem set: 0 solved, 1278 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/58 constraints, ReadFeed: 0/221 constraints, PredecessorRefiner: 1278/33 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 4 (OVERLAPS) 1279/1337 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 221/293 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1337 variables, 33/326 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 326 constraints, problems are : Problem set: 0 solved, 1278 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 1278/33 constraints, Known Traps: 1/1 constraints]
After SMT, in 84296ms problems are : Problem set: 0 solved, 1278 unsolved
Search for dead transitions found 0 dead transitions in 84312ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85547 ms. Remains : 58/58 places, 1279/1279 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2) p3)), (G (AND (OR p0 (NOT p2) p3) (OR (NOT p1) (NOT p2) p3)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) p3))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p2), (F p3), (F (NOT p0)), (F (NOT (AND (OR p0 p2 p3) (OR (NOT p1) p2 p3)))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 21 factoid took 411 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Support contains 19 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-22 07:23:17] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 07:23:18] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-22 07:23:18] [INFO ] Invariant cache hit.
[2024-05-22 07:23:19] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-22 07:23:19] [INFO ] Implicit Places using invariants and state equation in 1320 ms returned []
Implicit Place search using SMT with State Equation took 1727 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-05-22 07:23:19] [INFO ] Invariant cache hit.
[2024-05-22 07:23:19] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
SMT process timed out in 55115ms, After SMT, problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 55145ms
Finished structural reductions in LTL mode , in 1 iterations and 56882 ms. Remains : 84/84 places, 1387/1387 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) p2 (NOT p3) p0))), (X (AND (NOT p1) (NOT p2) (NOT p3) p0)), (X (NOT (OR p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) p0))), (X (X (NOT (OR p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 183 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
RANDOM walk for 40000 steps (1824 resets) in 2113 ms. (18 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (97 resets) in 202 ms. (197 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (31 resets) in 245 ms. (162 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (99 resets) in 223 ms. (178 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (105 resets) in 221 ms. (180 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (101 resets) in 245 ms. (162 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (99 resets) in 197 ms. (202 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (104 resets) in 243 ms. (163 steps per ms) remains 6/6 properties
[2024-05-22 07:24:16] [INFO ] Invariant cache hit.
[2024-05-22 07:24:16] [INFO ] State equation strengthened by 303 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 57/76 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1380/1456 variables, 76/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 302/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1456 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 13/1469 variables, 7/397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/1470 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1732 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 57/76 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1380/1456 variables, 76/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 302/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1456 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 13/1469 variables, 7/397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/1470 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2598 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4555ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2827 ms.
Support contains 19 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Graph (complete) has 1126 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 83 transition count 1376
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 76 transition count 1375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 75 transition count 1375
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 20 place count 75 transition count 1372
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 72 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 71 transition count 1371
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 71 transition count 1371
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 70 transition count 1370
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 39 place count 70 transition count 1361
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 3 with 79 rules applied. Total rules applied 118 place count 61 transition count 1291
Applied a total of 118 rules in 229 ms. Remains 61 /84 variables (removed 23) and now considering 1291/1387 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 61/84 places, 1291/1387 transitions.
RANDOM walk for 40000 steps (62 resets) in 2009 ms. (19 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (103 resets) in 209 ms. (190 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (67 resets) in 285 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (99 resets) in 248 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (100 resets) in 298 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (73 resets) in 200 ms. (199 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (96 resets) in 255 ms. (156 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 174037 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 6
Probabilistic random walk after 174037 steps, saw 28201 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
// Phase 1: matrix 1291 rows 61 cols
[2024-05-22 07:24:28] [INFO ] Computed 14 invariants in 12 ms
[2024-05-22 07:24:28] [INFO ] State equation strengthened by 231 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 41/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1291/1352 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1352 variables, 231/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1352 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1352/1352 variables, and 306 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1184 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 41/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1291/1352 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1352 variables, 231/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1352 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1352/1352 variables, and 306 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1757 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3174ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2472 ms.
Support contains 19 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1291/1291 transitions.
Applied a total of 0 rules in 69 ms. Remains 61 /61 variables (removed 0) and now considering 1291/1291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 61/61 places, 1291/1291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1291/1291 transitions.
Applied a total of 0 rules in 68 ms. Remains 61 /61 variables (removed 0) and now considering 1291/1291 (removed 0) transitions.
[2024-05-22 07:24:34] [INFO ] Invariant cache hit.
[2024-05-22 07:24:34] [INFO ] Implicit Places using invariants in 292 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 295 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/61 places, 1291/1291 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 1290
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 1290
Applied a total of 2 rules in 81 ms. Remains 59 /60 variables (removed 1) and now considering 1290/1291 (removed 1) transitions.
// Phase 1: matrix 1290 rows 59 cols
[2024-05-22 07:24:34] [INFO ] Computed 13 invariants in 8 ms
[2024-05-22 07:24:35] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-05-22 07:24:35] [INFO ] Invariant cache hit.
[2024-05-22 07:24:35] [INFO ] State equation strengthened by 231 read => feed constraints.
[2024-05-22 07:24:36] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 1600 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 59/61 places, 1290/1291 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2044 ms. Remains : 59/61 places, 1290/1291 transitions.
RANDOM walk for 40000 steps (36 resets) in 3480 ms. (11 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (102 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (60 resets) in 206 ms. (193 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (95 resets) in 224 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (105 resets) in 232 ms. (171 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (64 resets) in 194 ms. (205 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (96 resets) in 351 ms. (113 steps per ms) remains 2/6 properties
[2024-05-22 07:24:37] [INFO ] Invariant cache hit.
[2024-05-22 07:24:37] [INFO ] State equation strengthened by 231 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/59 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1290/1349 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1349 variables, 231/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1349 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1349 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1349/1349 variables, and 303 constraints, problems are : Problem set: 0 solved, 2 unsolved in 839 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 59/59 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/59 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1290/1349 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1349 variables, 231/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1349 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1349 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1349/1349 variables, and 303 constraints, problems are : Problem set: 0 solved, 2 unsolved in 947 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 59/59 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1866ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 829 ms.
Support contains 17 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1290/1290 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 1289
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 58 transition count 1279
Applied a total of 12 rules in 199 ms. Remains 58 /59 variables (removed 1) and now considering 1279/1290 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 58/59 places, 1279/1290 transitions.
RANDOM walk for 40000 steps (25 resets) in 2003 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (55 resets) in 213 ms. (186 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (47 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 320226 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 2
Probabilistic random walk after 320226 steps, saw 48752 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
// Phase 1: matrix 1279 rows 58 cols
[2024-05-22 07:24:44] [INFO ] Computed 13 invariants in 9 ms
[2024-05-22 07:24:44] [INFO ] State equation strengthened by 221 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1337/1337 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 825 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 951 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1868ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 929 ms.
Support contains 17 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 110 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 58/58 places, 1279/1279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 66 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
[2024-05-22 07:24:47] [INFO ] Invariant cache hit.
[2024-05-22 07:24:47] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-22 07:24:47] [INFO ] Invariant cache hit.
[2024-05-22 07:24:48] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-22 07:24:48] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
[2024-05-22 07:24:48] [INFO ] Redundant transitions in 71 ms returned []
Running 1278 sub problems to find dead transitions.
[2024-05-22 07:24:48] [INFO ] Invariant cache hit.
[2024-05-22 07:24:48] [INFO ] State equation strengthened by 221 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
[2024-05-22 07:25:34] [INFO ] Deduced a trap composed of 23 places in 1182 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 58/1337 variables, and 14 constraints, problems are : Problem set: 0 solved, 1278 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/58 constraints, ReadFeed: 0/221 constraints, PredecessorRefiner: 1278/33 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 4 (OVERLAPS) 1279/1337 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 221/293 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1337 variables, 33/326 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 326 constraints, problems are : Problem set: 0 solved, 1278 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 1278/33 constraints, Known Traps: 1/1 constraints]
After SMT, in 84255ms problems are : Problem set: 0 solved, 1278 unsolved
Search for dead transitions found 0 dead transitions in 84282ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85722 ms. Remains : 58/58 places, 1279/1279 transitions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) p2 (NOT p3) p0))), (X (AND (NOT p1) (NOT p2) (NOT p3) p0)), (X (NOT (OR p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) p0))), (X (X (NOT (OR p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p3), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (AND (OR p0 p3) (OR (NOT p1) p3)))), (F (NOT p0))]
Knowledge based reduction with 19 factoid took 471 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Product exploration explored 100000 steps with 2159 reset in 1239 ms.
Product exploration explored 100000 steps with 638 reset in 425 ms.
Support contains 19 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-22 07:26:16] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 07:26:16] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-22 07:26:16] [INFO ] Invariant cache hit.
[2024-05-22 07:26:17] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-22 07:26:17] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-05-22 07:26:17] [INFO ] Invariant cache hit.
[2024-05-22 07:26:17] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/1471 variables, and 12 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/84 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1470 variables, 302/398 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1470/1471 variables, and 458 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30155 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 302/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 85293ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 85309ms
Finished structural reductions in LTL mode , in 1 iterations and 86525 ms. Remains : 84/84 places, 1387/1387 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-09 finished in 432555 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)))'
Support contains 15 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 11 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
[2024-05-22 07:27:43] [INFO ] Invariant cache hit.
[2024-05-22 07:27:43] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-22 07:27:43] [INFO ] Invariant cache hit.
[2024-05-22 07:27:44] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-22 07:27:45] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1697 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-05-22 07:27:45] [INFO ] Invariant cache hit.
[2024-05-22 07:27:45] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/1471 variables, and 12 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/84 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1470 variables, 302/398 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1470/1471 variables, and 458 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30160 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 302/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 84518ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 84542ms
Starting structural reductions in LTL mode, iteration 1 : 84/89 places, 1387/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86255 ms. Remains : 84/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-10 finished in 86358 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||F(p1)) U p2))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 89 transition count 1433
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 80 transition count 1432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 77 transition count 1430
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 28 place count 73 transition count 1386
Iterating global reduction 3 with 4 rules applied. Total rules applied 32 place count 73 transition count 1386
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 72 transition count 1385
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 71 transition count 1385
Applied a total of 36 rules in 189 ms. Remains 71 /89 variables (removed 18) and now considering 1385/1442 (removed 57) transitions.
// Phase 1: matrix 1385 rows 71 cols
[2024-05-22 07:29:10] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 07:29:10] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-22 07:29:10] [INFO ] Invariant cache hit.
[2024-05-22 07:29:10] [INFO ] State equation strengthened by 315 read => feed constraints.
[2024-05-22 07:29:11] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1223 ms to find 0 implicit places.
[2024-05-22 07:29:11] [INFO ] Redundant transitions in 62 ms returned []
Running 1384 sub problems to find dead transitions.
[2024-05-22 07:29:11] [INFO ] Invariant cache hit.
[2024-05-22 07:29:11] [INFO ] State equation strengthened by 315 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1384 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1384 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1384 unsolved
At refinement iteration 3 (OVERLAPS) 1384/1455 variables, 71/83 constraints. Problems are: Problem set: 0 solved, 1384 unsolved
SMT process timed out in 54449ms, After SMT, problems are : Problem set: 0 solved, 1384 unsolved
Search for dead transitions found 0 dead transitions in 54466ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/89 places, 1385/1442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55949 ms. Remains : 71/89 places, 1385/1442 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-12
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-12 finished in 56082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 16 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 89 transition count 1432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 77 transition count 1430
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 72 transition count 1375
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 72 transition count 1375
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 71 transition count 1374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 70 transition count 1374
Applied a total of 38 rules in 175 ms. Remains 70 /89 variables (removed 19) and now considering 1374/1442 (removed 68) transitions.
// Phase 1: matrix 1374 rows 70 cols
[2024-05-22 07:30:06] [INFO ] Computed 12 invariants in 11 ms
[2024-05-22 07:30:06] [INFO ] Implicit Places using invariants in 633 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 638 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/89 places, 1374/1442 transitions.
Applied a total of 0 rules in 142 ms. Remains 69 /69 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 957 ms. Remains : 69/89 places, 1374/1442 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-13
Product exploration explored 100000 steps with 1104 reset in 795 ms.
Product exploration explored 100000 steps with 251 reset in 307 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (2246 resets) in 1560 ms. (25 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4035 steps (8 resets) in 21 ms. (183 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Support contains 11 out of 69 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 1374/1374 transitions.
Applied a total of 0 rules in 155 ms. Remains 69 /69 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
// Phase 1: matrix 1374 rows 69 cols
[2024-05-22 07:30:09] [INFO ] Computed 11 invariants in 9 ms
[2024-05-22 07:30:09] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-22 07:30:09] [INFO ] Invariant cache hit.
[2024-05-22 07:30:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:30:10] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1362 ms to find 0 implicit places.
[2024-05-22 07:30:10] [INFO ] Redundant transitions in 134 ms returned []
Running 1373 sub problems to find dead transitions.
[2024-05-22 07:30:10] [INFO ] Invariant cache hit.
[2024-05-22 07:30:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1373/1442 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1442/1443 variables, and 80 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 69/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1373/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1442 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1442 variables, 45/125 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1442/1443 variables, and 125 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 69/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1373/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 85702ms problems are : Problem set: 0 solved, 1373 unsolved
Search for dead transitions found 0 dead transitions in 85719ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 87381 ms. Remains : 69/69 places, 1374/1374 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (2179 resets) in 1429 ms. (27 steps per ms) remains 1/1 properties
BEST_FIRST walk for 12359 steps (39 resets) in 41 ms. (294 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 5 reset in 66 ms.
Product exploration explored 100000 steps with 1765 reset in 904 ms.
Support contains 11 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 1374/1374 transitions.
Applied a total of 0 rules in 104 ms. Remains 69 /69 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
[2024-05-22 07:31:38] [INFO ] Invariant cache hit.
[2024-05-22 07:31:38] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-22 07:31:38] [INFO ] Invariant cache hit.
[2024-05-22 07:31:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:31:39] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
[2024-05-22 07:31:39] [INFO ] Redundant transitions in 67 ms returned []
Running 1373 sub problems to find dead transitions.
[2024-05-22 07:31:39] [INFO ] Invariant cache hit.
[2024-05-22 07:31:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1373/1442 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1442/1443 variables, and 80 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 69/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1373/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1442 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1442 variables, 45/125 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1442/1443 variables, and 125 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 69/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1373/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 85071ms problems are : Problem set: 0 solved, 1373 unsolved
Search for dead transitions found 0 dead transitions in 85088ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 86470 ms. Remains : 69/69 places, 1374/1374 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-13 finished in 179512 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(F((p0&&X((p1&&F((G(F(!p2))||(!p3&&F(!p2)))))))))))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 12 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-22 07:33:05] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 07:33:05] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-22 07:33:05] [INFO ] Invariant cache hit.
[2024-05-22 07:33:06] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-22 07:33:06] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-05-22 07:33:06] [INFO ] Invariant cache hit.
[2024-05-22 07:33:06] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/1471 variables, and 12 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/84 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1470 variables, 302/398 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1470 variables, 60/458 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1470/1471 variables, and 458 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 302/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 85058ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 85076ms
Starting structural reductions in LTL mode, iteration 1 : 84/89 places, 1387/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86379 ms. Remains : 84/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p1) p2), p2, p2]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-14
Product exploration explored 100000 steps with 25000 reset in 7537 ms.
Product exploration explored 100000 steps with 25000 reset in 7747 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p1) p2), p2, p2]
RANDOM walk for 40000 steps (1845 resets) in 1390 ms. (28 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (95 resets) in 266 ms. (149 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (102 resets) in 298 ms. (133 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (144 resets) in 399 ms. (100 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (110 resets) in 279 ms. (142 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (101 resets) in 264 ms. (150 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (102 resets) in 300 ms. (132 steps per ms) remains 5/5 properties
[2024-05-22 07:34:48] [INFO ] Invariant cache hit.
[2024-05-22 07:34:48] [INFO ] State equation strengthened by 303 read => feed constraints.
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 59/76 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1380/1456 variables, 76/88 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 302/390 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1456 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 13/1469 variables, 7/397 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 0/397 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1470 variables, 1/398 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 1 solved, 4 unsolved in 967 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 59/76 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1380/1456 variables, 76/88 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 302/390 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1456 variables, 0/390 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 13/1469 variables, 7/397 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 0/397 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1470 variables, 1/398 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1008 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2087ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1731 ms.
Support contains 17 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Graph (complete) has 1126 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 83 transition count 1375
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 75 transition count 1373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 73 transition count 1373
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 24 place count 73 transition count 1370
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 70 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 69 transition count 1369
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 69 transition count 1369
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 68 transition count 1368
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 42 place count 68 transition count 1360
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 3 with 88 rules applied. Total rules applied 130 place count 60 transition count 1280
Applied a total of 130 rules in 232 ms. Remains 60 /84 variables (removed 24) and now considering 1280/1387 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 60/84 places, 1280/1387 transitions.
RANDOM walk for 40000 steps (27 resets) in 2805 ms. (14 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (101 resets) in 195 ms. (204 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (11 resets) in 264 ms. (150 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (92 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
// Phase 1: matrix 1280 rows 60 cols
[2024-05-22 07:34:53] [INFO ] Computed 14 invariants in 8 ms
[2024-05-22 07:34:53] [INFO ] State equation strengthened by 221 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/60 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1280/1340 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 221/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1340/1340 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 591 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 60/60 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/60 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1280/1340 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 221/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1340/1340 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 60/60 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1293ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 721 ms.
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1280/1280 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 58 transition count 1278
Applied a total of 4 rules in 98 ms. Remains 58 /60 variables (removed 2) and now considering 1278/1280 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 58/60 places, 1278/1280 transitions.
RANDOM walk for 40000 steps (22 resets) in 2384 ms. (16 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (103 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (98 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 335029 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 2
Probabilistic random walk after 335029 steps, saw 52394 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
// Phase 1: matrix 1278 rows 58 cols
[2024-05-22 07:34:59] [INFO ] Computed 14 invariants in 6 ms
[2024-05-22 07:34:59] [INFO ] State equation strengthened by 221 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/58 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1336 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1336 variables, 221/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/58 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1336 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1336 variables, 221/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 644 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1227ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 703 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 98 ms. Remains 58 /58 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 58/58 places, 1278/1278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 92 ms. Remains 58 /58 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
[2024-05-22 07:35:01] [INFO ] Invariant cache hit.
[2024-05-22 07:35:02] [INFO ] Implicit Places using invariants in 635 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 637 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 57/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 85 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 816 ms. Remains : 57/58 places, 1278/1278 transitions.
RANDOM walk for 40000 steps (36 resets) in 2118 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (101 resets) in 176 ms. (226 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (98 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 337253 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 2
Probabilistic random walk after 337253 steps, saw 52700 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
// Phase 1: matrix 1278 rows 57 cols
[2024-05-22 07:35:06] [INFO ] Computed 13 invariants in 6 ms
[2024-05-22 07:35:06] [INFO ] State equation strengthened by 221 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/57 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1335 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 221/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1335/1335 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 541 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/57 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1335 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 221/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1335/1335 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 644 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1238ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 718 ms.
Support contains 6 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1278/1278 transitions.
Applied a total of 0 rules in 81 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 57/57 places, 1278/1278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1278/1278 transitions.
Applied a total of 0 rules in 82 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
[2024-05-22 07:35:08] [INFO ] Invariant cache hit.
[2024-05-22 07:35:09] [INFO ] Implicit Places using invariants in 632 ms returned []
[2024-05-22 07:35:09] [INFO ] Invariant cache hit.
[2024-05-22 07:35:09] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-22 07:35:10] [INFO ] Implicit Places using invariants and state equation in 1187 ms returned []
Implicit Place search using SMT with State Equation took 1824 ms to find 0 implicit places.
[2024-05-22 07:35:10] [INFO ] Redundant transitions in 43 ms returned []
Running 1277 sub problems to find dead transitions.
[2024-05-22 07:35:10] [INFO ] Invariant cache hit.
[2024-05-22 07:35:10] [INFO ] State equation strengthened by 221 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
[2024-05-22 07:35:51] [INFO ] Deduced a trap composed of 23 places in 1066 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
SMT process timed out in 54216ms, After SMT, problems are : Problem set: 0 solved, 1277 unsolved
Search for dead transitions found 0 dead transitions in 54232ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56192 ms. Remains : 57/57 places, 1278/1278 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 82 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-22 07:36:04] [INFO ] Invariant cache hit.
[2024-05-22 07:36:04] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-22 07:36:04] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 07:36:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-22 07:36:05] [INFO ] After 466ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :2
[2024-05-22 07:36:05] [INFO ] After 510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 709 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (X p0)), (G (OR p1 p0)), (G (OR (NOT p1) (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0)))), (F (NOT p0)), (F p3), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 207 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 178 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Support contains 6 out of 84 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-22 07:36:05] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 07:36:06] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-22 07:36:06] [INFO ] Invariant cache hit.
[2024-05-22 07:36:06] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-22 07:36:07] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1265 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-05-22 07:36:07] [INFO ] Invariant cache hit.
[2024-05-22 07:36:07] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
SMT process timed out in 55507ms, After SMT, problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 55525ms
Finished structural reductions in LTL mode , in 1 iterations and 56800 ms. Remains : 84/84 places, 1387/1387 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p2) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
RANDOM walk for 40000 steps (1834 resets) in 2624 ms. (15 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (99 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (97 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
[2024-05-22 07:37:03] [INFO ] Invariant cache hit.
[2024-05-22 07:37:03] [INFO ] State equation strengthened by 303 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/75 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1378/1453 variables, 75/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1453 variables, 302/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1453 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/1466 variables, 5/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1466 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/1470 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 0 solved, 2 unsolved in 855 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/75 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1378/1453 variables, 75/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1453 variables, 302/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1453 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/1466 variables, 5/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1466 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/1470 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 0 solved, 2 unsolved in 891 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1795ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 772 ms.
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Graph (complete) has 1126 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 83 transition count 1373
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 73 transition count 1371
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 71 transition count 1371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 71 transition count 1370
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 70 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 69 transition count 1369
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 69 transition count 1369
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 66 transition count 1366
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 46 place count 66 transition count 1358
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 3 with 88 rules applied. Total rules applied 134 place count 58 transition count 1278
Applied a total of 134 rules in 260 ms. Remains 58 /84 variables (removed 26) and now considering 1278/1387 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 58/84 places, 1278/1387 transitions.
RANDOM walk for 40000 steps (25 resets) in 2167 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (101 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (98 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 337702 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 2
Probabilistic random walk after 337702 steps, saw 52760 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
// Phase 1: matrix 1278 rows 58 cols
[2024-05-22 07:37:10] [INFO ] Computed 14 invariants in 8 ms
[2024-05-22 07:37:10] [INFO ] State equation strengthened by 221 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/58 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1336 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1336 variables, 221/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/58 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1336 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1336 variables, 221/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1245ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 714 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 81 ms. Remains 58 /58 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 58/58 places, 1278/1278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 82 ms. Remains 58 /58 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
[2024-05-22 07:37:12] [INFO ] Invariant cache hit.
[2024-05-22 07:37:13] [INFO ] Implicit Places using invariants in 635 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 638 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 57/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 82 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 803 ms. Remains : 57/58 places, 1278/1278 transitions.
RANDOM walk for 40000 steps (32 resets) in 2371 ms. (16 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (93 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (82 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 338017 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 2
Probabilistic random walk after 338017 steps, saw 52793 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
// Phase 1: matrix 1278 rows 57 cols
[2024-05-22 07:37:17] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 07:37:17] [INFO ] State equation strengthened by 221 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/57 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1335 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 221/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1335/1335 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/57 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1335 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 221/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1335/1335 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1233ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 718 ms.
Support contains 6 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1278/1278 transitions.
Applied a total of 0 rules in 82 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 57/57 places, 1278/1278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1278/1278 transitions.
Applied a total of 0 rules in 86 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
[2024-05-22 07:37:19] [INFO ] Invariant cache hit.
[2024-05-22 07:37:19] [INFO ] Implicit Places using invariants in 636 ms returned []
[2024-05-22 07:37:19] [INFO ] Invariant cache hit.
[2024-05-22 07:37:20] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-22 07:37:21] [INFO ] Implicit Places using invariants and state equation in 1171 ms returned []
Implicit Place search using SMT with State Equation took 1811 ms to find 0 implicit places.
[2024-05-22 07:37:21] [INFO ] Redundant transitions in 44 ms returned []
Running 1277 sub problems to find dead transitions.
[2024-05-22 07:37:21] [INFO ] Invariant cache hit.
[2024-05-22 07:37:21] [INFO ] State equation strengthened by 221 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
[2024-05-22 07:38:01] [INFO ] Deduced a trap composed of 23 places in 1062 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
SMT process timed out in 54071ms, After SMT, problems are : Problem set: 0 solved, 1277 unsolved
Search for dead transitions found 0 dead transitions in 54087ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56039 ms. Remains : 57/57 places, 1278/1278 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 81 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-22 07:38:15] [INFO ] Invariant cache hit.
[2024-05-22 07:38:15] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-22 07:38:15] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 07:38:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-22 07:38:15] [INFO ] After 449ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :2
[2024-05-22 07:38:15] [INFO ] After 492ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 662 ms.
Knowledge obtained : [(AND (NOT p2) p1)]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 187 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 180 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Product exploration explored 100000 steps with 25000 reset in 7534 ms.
Product exploration explored 100000 steps with 25000 reset in 7551 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 180 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 84 transition count 1387
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 12 place count 84 transition count 1389
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 84 transition count 1389
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 84 transition count 1389
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 83 transition count 1388
Deduced a syphon composed of 14 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 83 transition count 1388
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 83 transition count 1391
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 18 rules in 247 ms. Remains 83 /84 variables (removed 1) and now considering 1391/1387 (removed -4) transitions.
[2024-05-22 07:38:32] [INFO ] Redundant transitions in 69 ms returned []
Running 1390 sub problems to find dead transitions.
// Phase 1: matrix 1391 rows 83 cols
[2024-05-22 07:38:32] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 07:38:32] [INFO ] State equation strengthened by 307 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-22 07:39:08] [INFO ] Deduced a trap composed of 6 places in 1036 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 07:39:09] [INFO ] Deduced a trap composed of 6 places in 872 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-22 07:39:09] [INFO ] Deduced a trap composed of 6 places in 860 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-22 07:39:10] [INFO ] Deduced a trap composed of 6 places in 872 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-22 07:39:11] [INFO ] Deduced a trap composed of 6 places in 846 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-22 07:39:12] [INFO ] Deduced a trap composed of 6 places in 849 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-22 07:39:13] [INFO ] Deduced a trap composed of 6 places in 838 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-22 07:39:14] [INFO ] Deduced a trap composed of 6 places in 854 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-22 07:39:15] [INFO ] Deduced a trap composed of 6 places in 839 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-22 07:39:16] [INFO ] Deduced a trap composed of 6 places in 822 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-22 07:39:16] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 83/1474 variables, and 23 constraints, problems are : Problem set: 11 solved, 1379 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/83 constraints, ReadFeed: 0/307 constraints, PredecessorRefiner: 1390/60 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 11 solved, 1379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 1379 unsolved
At refinement iteration 1 (OVERLAPS) 12/83 variables, 12/12 constraints. Problems are: Problem set: 11 solved, 1379 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 11/23 constraints. Problems are: Problem set: 11 solved, 1379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/23 constraints. Problems are: Problem set: 11 solved, 1379 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
At refinement iteration 4 (OVERLAPS) 1390/1473 variables, 83/106 constraints. Problems are: Problem set: 19 solved, 1371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1473 variables, 306/412 constraints. Problems are: Problem set: 19 solved, 1371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1473 variables, 43/455 constraints. Problems are: Problem set: 19 solved, 1371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1473/1474 variables, and 455 constraints, problems are : Problem set: 19 solved, 1371 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 83/83 constraints, ReadFeed: 306/307 constraints, PredecessorRefiner: 1373/60 constraints, Known Traps: 11/11 constraints]
After SMT, in 85399ms problems are : Problem set: 19 solved, 1371 unsolved
Search for dead transitions found 19 dead transitions in 85417ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 83/84 places, 1372/1387 transitions.
Graph (complete) has 1161 edges and 83 vertex of which 68 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.5 ms
Discarding 15 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 159 ms. Remains 68 /83 variables (removed 15) and now considering 1372/1372 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/84 places, 1372/1387 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85905 ms. Remains : 68/84 places, 1372/1387 transitions.
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-22 07:39:57] [INFO ] Computed 12 invariants in 9 ms
[2024-05-22 07:39:58] [INFO ] Implicit Places using invariants in 696 ms returned []
[2024-05-22 07:39:58] [INFO ] Invariant cache hit.
[2024-05-22 07:39:59] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-22 07:39:59] [INFO ] Implicit Places using invariants and state equation in 1290 ms returned []
Implicit Place search using SMT with State Equation took 1988 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-05-22 07:39:59] [INFO ] Invariant cache hit.
[2024-05-22 07:39:59] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
SMT process timed out in 55425ms, After SMT, problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 55442ms
Finished structural reductions in LTL mode , in 1 iterations and 57443 ms. Remains : 84/84 places, 1387/1387 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-14 finished in 470057 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||X((X(X(p1))||G(p2)))))))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 85 transition count 1398
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 85 transition count 1398
Applied a total of 8 rules in 11 ms. Remains 85 /89 variables (removed 4) and now considering 1398/1442 (removed 44) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2024-05-22 07:40:55] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 07:40:55] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-22 07:40:55] [INFO ] Invariant cache hit.
[2024-05-22 07:40:56] [INFO ] State equation strengthened by 313 read => feed constraints.
[2024-05-22 07:40:56] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1262 ms to find 0 implicit places.
Running 1397 sub problems to find dead transitions.
[2024-05-22 07:40:56] [INFO ] Invariant cache hit.
[2024-05-22 07:40:56] [INFO ] State equation strengthened by 313 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1397/1482 variables, 85/97 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
SMT process timed out in 55205ms, After SMT, problems are : Problem set: 0 solved, 1397 unsolved
Search for dead transitions found 0 dead transitions in 55223ms
Starting structural reductions in LTL mode, iteration 1 : 85/89 places, 1398/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56501 ms. Remains : 85/89 places, 1398/1442 transitions.
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-15
Product exploration explored 100000 steps with 16647 reset in 5444 ms.
Product exploration explored 100000 steps with 16676 reset in 5469 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (1838 resets) in 2860 ms. (13 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (101 resets) in 228 ms. (174 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (129 resets) in 306 ms. (130 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (101 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (103 resets) in 170 ms. (233 steps per ms) remains 3/3 properties
[2024-05-22 07:42:04] [INFO ] Invariant cache hit.
[2024-05-22 07:42:04] [INFO ] State equation strengthened by 313 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, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 16/22 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/76 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1389/1465 variables, 76/88 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1465 variables, 312/400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1465 variables, 0/400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/1478 variables, 5/405 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1478 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/1482 variables, 4/409 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1482 variables, 0/409 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1483 variables, 1/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1483/1483 variables, and 410 constraints, problems are : Problem set: 1 solved, 2 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 85/85 constraints, ReadFeed: 313/313 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/22 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/76 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1389/1465 variables, 76/88 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1465 variables, 312/400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1465 variables, 0/400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/1478 variables, 5/405 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1478 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/1482 variables, 4/409 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1482 variables, 0/409 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1483 variables, 1/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1483/1483 variables, and 410 constraints, problems are : Problem set: 1 solved, 2 unsolved in 931 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 85/85 constraints, ReadFeed: 313/313 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1703ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 711 ms.
Support contains 6 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Graph (complete) has 1138 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 84 transition count 1383
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 73 transition count 1383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 73 transition count 1382
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 72 transition count 1382
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 71 transition count 1381
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 71 transition count 1381
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 68 transition count 1378
Free-agglomeration rule applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 47 place count 68 transition count 1367
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 101 rules applied. Total rules applied 148 place count 57 transition count 1277
Applied a total of 148 rules in 252 ms. Remains 57 /85 variables (removed 28) and now considering 1277/1398 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 57/85 places, 1277/1398 transitions.
RANDOM walk for 40000 steps (20 resets) in 2322 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 31363 steps (21 resets) in 157 ms. (198 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p2))), (G (OR p1 (NOT p2)))]
False Knowledge obtained : [(F p2), (F (NOT p1)), (F (NOT (OR p1 p2))), (F p0)]
Knowledge based reduction with 5 factoid took 208 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 15 out of 85 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2024-05-22 07:42:08] [INFO ] Invariant cache hit.
[2024-05-22 07:42:09] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-22 07:42:09] [INFO ] Invariant cache hit.
[2024-05-22 07:42:09] [INFO ] State equation strengthened by 313 read => feed constraints.
[2024-05-22 07:42:10] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1262 ms to find 0 implicit places.
Running 1397 sub problems to find dead transitions.
[2024-05-22 07:42:10] [INFO ] Invariant cache hit.
[2024-05-22 07:42:10] [INFO ] State equation strengthened by 313 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 3 (OVERLAPS) 1397/1482 variables, 85/97 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
SMT process timed out in 55349ms, After SMT, problems are : Problem set: 0 solved, 1397 unsolved
Search for dead transitions found 0 dead transitions in 55367ms
Finished structural reductions in LTL mode , in 1 iterations and 56638 ms. Remains : 85/85 places, 1398/1398 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (1843 resets) in 2579 ms. (15 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (125 resets) in 243 ms. (163 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (99 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
[2024-05-22 07:43:06] [INFO ] Invariant cache hit.
[2024-05-22 07:43:06] [INFO ] State equation strengthened by 313 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/76 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1389/1465 variables, 76/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1465 variables, 312/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1465 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/1478 variables, 5/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1478 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/1482 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1482 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1483 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1483/1483 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 591 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 85/85 constraints, ReadFeed: 313/313 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/76 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1389/1465 variables, 76/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1465 variables, 312/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1465 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/1478 variables, 5/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1478 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/1482 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1482 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1483 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1483/1483 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 85/85 constraints, ReadFeed: 313/313 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1341ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 525 ms.
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Graph (complete) has 1138 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 84 transition count 1383
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 73 transition count 1383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 73 transition count 1382
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 72 transition count 1382
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 70 transition count 1370
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 70 transition count 1370
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 67 transition count 1367
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 48 place count 67 transition count 1357
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 148 place count 57 transition count 1267
Applied a total of 148 rules in 247 ms. Remains 57 /85 variables (removed 28) and now considering 1267/1398 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 57/85 places, 1267/1398 transitions.
RANDOM walk for 40000 steps (14 resets) in 1335 ms. (29 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (28 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 479067 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :0 out of 1
Probabilistic random walk after 479067 steps, saw 69072 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
// Phase 1: matrix 1267 rows 57 cols
[2024-05-22 07:43:12] [INFO ] Computed 14 invariants in 7 ms
[2024-05-22 07:43:12] [INFO ] State equation strengthened by 211 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/57 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1267/1324 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1324 variables, 211/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1324 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1324 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/57 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1267/1324 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1324 variables, 211/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1324 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1324 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 521 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1046ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 466 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 78 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 57/57 places, 1267/1267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 79 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2024-05-22 07:43:13] [INFO ] Invariant cache hit.
[2024-05-22 07:43:14] [INFO ] Implicit Places using invariants in 652 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 655 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 56/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 80 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 817 ms. Remains : 56/57 places, 1267/1267 transitions.
RANDOM walk for 40000 steps (19 resets) in 1061 ms. (37 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (28 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 481135 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 1
Probabilistic random walk after 481135 steps, saw 69366 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
// Phase 1: matrix 1267 rows 56 cols
[2024-05-22 07:43:17] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 07:43:17] [INFO ] State equation strengthened by 211 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/56 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1267/1323 variables, 56/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1323 variables, 211/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1323 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1323 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1323/1323 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 56/56 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/56 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1267/1323 variables, 56/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1323 variables, 211/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1323 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1323 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1323/1323 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 520 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 56/56 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1042ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 466 ms.
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 79 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 56/56 places, 1267/1267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 80 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2024-05-22 07:43:19] [INFO ] Invariant cache hit.
[2024-05-22 07:43:20] [INFO ] Implicit Places using invariants in 634 ms returned []
[2024-05-22 07:43:20] [INFO ] Invariant cache hit.
[2024-05-22 07:43:20] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-22 07:43:21] [INFO ] Implicit Places using invariants and state equation in 1237 ms returned []
Implicit Place search using SMT with State Equation took 1873 ms to find 0 implicit places.
[2024-05-22 07:43:21] [INFO ] Redundant transitions in 44 ms returned []
Running 1266 sub problems to find dead transitions.
[2024-05-22 07:43:21] [INFO ] Invariant cache hit.
[2024-05-22 07:43:21] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
[2024-05-22 07:44:01] [INFO ] Deduced a trap composed of 23 places in 1009 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
SMT process timed out in 53694ms, After SMT, problems are : Problem set: 0 solved, 1266 unsolved
Search for dead transitions found 0 dead transitions in 53711ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55716 ms. Remains : 56/56 places, 1267/1267 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 78 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 07:44:15] [INFO ] Invariant cache hit.
[2024-05-22 07:44:15] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 07:44:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-22 07:44:15] [INFO ] After 452ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :1
[2024-05-22 07:44:15] [INFO ] After 487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 623 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 16648 reset in 5445 ms.
Product exploration explored 100000 steps with 16678 reset in 5446 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 15 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 85 transition count 1398
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 9 place count 85 transition count 1400
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 85 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 84 transition count 1389
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 84 transition count 1389
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 84 transition count 1389
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 84 transition count 1392
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 15 rules in 166 ms. Remains 84 /85 variables (removed 1) and now considering 1392/1398 (removed 6) transitions.
[2024-05-22 07:44:27] [INFO ] Redundant transitions in 69 ms returned []
Running 1391 sub problems to find dead transitions.
// Phase 1: matrix 1392 rows 84 cols
[2024-05-22 07:44:27] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 07:44:27] [INFO ] State equation strengthened by 307 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-05-22 07:45:03] [INFO ] Deduced a trap composed of 6 places in 1029 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-22 07:45:04] [INFO ] Deduced a trap composed of 6 places in 979 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-22 07:45:05] [INFO ] Deduced a trap composed of 6 places in 936 ms of which 5 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-22 07:45:06] [INFO ] Deduced a trap composed of 6 places in 906 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-22 07:45:07] [INFO ] Deduced a trap composed of 6 places in 892 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-22 07:45:08] [INFO ] Deduced a trap composed of 6 places in 880 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-22 07:45:09] [INFO ] Deduced a trap composed of 6 places in 873 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-22 07:45:10] [INFO ] Deduced a trap composed of 6 places in 862 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-22 07:45:11] [INFO ] Deduced a trap composed of 6 places in 844 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-22 07:45:14] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 1 ms to minimize.
Problem TDEAD335 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/1476 variables, and 22 constraints, problems are : Problem set: 10 solved, 1381 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/84 constraints, ReadFeed: 0/307 constraints, PredecessorRefiner: 1391/61 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 10 solved, 1381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 1381 unsolved
At refinement iteration 1 (OVERLAPS) 11/84 variables, 12/12 constraints. Problems are: Problem set: 10 solved, 1381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 10/22 constraints. Problems are: Problem set: 10 solved, 1381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/22 constraints. Problems are: Problem set: 10 solved, 1381 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
At refinement iteration 4 (OVERLAPS) 1391/1475 variables, 84/106 constraints. Problems are: Problem set: 17 solved, 1374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 306/412 constraints. Problems are: Problem set: 17 solved, 1374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 46/458 constraints. Problems are: Problem set: 17 solved, 1374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1475/1476 variables, and 458 constraints, problems are : Problem set: 17 solved, 1374 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 306/307 constraints, PredecessorRefiner: 1376/61 constraints, Known Traps: 10/10 constraints]
After SMT, in 84507ms problems are : Problem set: 17 solved, 1374 unsolved
Search for dead transitions found 17 dead transitions in 84526ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 84/85 places, 1375/1398 transitions.
Graph (complete) has 1162 edges and 84 vertex of which 71 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.5 ms
Discarding 13 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 113 ms. Remains 71 /84 variables (removed 13) and now considering 1375/1375 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/85 places, 1375/1398 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84884 ms. Remains : 71/85 places, 1375/1398 transitions.
Support contains 15 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 1387
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 1387
Applied a total of 2 rules in 11 ms. Remains 84 /85 variables (removed 1) and now considering 1387/1398 (removed 11) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-22 07:45:52] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 07:45:52] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-22 07:45:52] [INFO ] Invariant cache hit.
[2024-05-22 07:45:53] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-22 07:45:53] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-05-22 07:45:53] [INFO ] Invariant cache hit.
[2024-05-22 07:45:53] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
SMT process timed out in 54216ms, After SMT, problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 54234ms
Starting structural reductions in LTL mode, iteration 1 : 84/85 places, 1387/1398 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55505 ms. Remains : 84/85 places, 1387/1398 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-15 finished in 352667 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&&(!p1 U (G(!p1)||(!p1&&(!p2 U (p3||G(!p2))))))))))'
Found a Shortening insensitive property : AutonomousCar-PT-10a-LTLFireability-09
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))]
Support contains 19 out of 89 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 89 transition count 1435
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 82 transition count 1434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 81 transition count 1434
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 81 transition count 1432
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 79 transition count 1432
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 25 place count 74 transition count 1377
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 74 transition count 1377
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 73 transition count 1376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 72 transition count 1376
Applied a total of 34 rules in 115 ms. Remains 72 /89 variables (removed 17) and now considering 1376/1442 (removed 66) transitions.
// Phase 1: matrix 1376 rows 72 cols
[2024-05-22 07:46:48] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 07:46:48] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-22 07:46:48] [INFO ] Invariant cache hit.
[2024-05-22 07:46:49] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-22 07:46:49] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
Running 1375 sub problems to find dead transitions.
[2024-05-22 07:46:49] [INFO ] Invariant cache hit.
[2024-05-22 07:46:49] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1375/1447 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
SMT process timed out in 53503ms, After SMT, problems are : Problem set: 0 solved, 1375 unsolved
Search for dead transitions found 0 dead transitions in 53519ms
Starting structural reductions in LI_LTL mode, iteration 1 : 72/89 places, 1376/1442 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 54825 ms. Remains : 72/89 places, 1376/1442 transitions.
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-09
Product exploration explored 100000 steps with 782 reset in 888 ms.
Product exploration explored 100000 steps with 164 reset in 401 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 113 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))]
RANDOM walk for 40000 steps (2178 resets) in 5475 ms. (7 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (115 resets) in 294 ms. (135 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (41 resets) in 260 ms. (153 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40004 steps (111 resets) in 307 ms. (129 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (112 resets) in 270 ms. (147 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (110 resets) in 321 ms. (124 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (111 resets) in 366 ms. (109 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (113 resets) in 300 ms. (132 steps per ms) remains 4/4 properties
[2024-05-22 07:47:47] [INFO ] Invariant cache hit.
[2024-05-22 07:47:47] [INFO ] State equation strengthened by 305 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf3 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 48/67 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1440 variables, 67/79 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1440 variables, 304/383 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1440 variables, 0/383 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/1447 variables, 5/388 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1447 variables, 0/388 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1448 variables, 1/389 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1448/1448 variables, and 389 constraints, problems are : Problem set: 2 solved, 2 unsolved in 814 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/67 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1440 variables, 67/79 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1440 variables, 304/383 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1440 variables, 0/383 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/1447 variables, 5/388 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1447 variables, 0/388 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1448 variables, 1/389 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1448/1448 variables, and 389 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1221 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2210ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 885 ms.
Support contains 17 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1376/1376 transitions.
Graph (complete) has 1117 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 71 transition count 1373
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 70 transition count 1371
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 70 transition count 1371
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 15 place count 70 transition count 1361
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 105 place count 60 transition count 1281
Applied a total of 105 rules in 184 ms. Remains 60 /72 variables (removed 12) and now considering 1281/1376 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 60/72 places, 1281/1376 transitions.
RANDOM walk for 40000 steps (505 resets) in 2195 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 35133 steps (46 resets) in 206 ms. (169 steps per ms) remains 0/2 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (G (AND (OR p0 (NOT p2) p3) (OR (NOT p1) (NOT p2) p3))), (G (OR (NOT p1) (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p1), (F p2), (F (NOT (OR (NOT p1) p2 p3))), (F p3), (F (NOT p0)), (F (NOT (AND (OR p0 p2 p3) (OR (NOT p1) p2 p3))))]
Knowledge based reduction with 21 factoid took 474 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Support contains 19 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 1376/1376 transitions.
Applied a total of 0 rules in 5 ms. Remains 72 /72 variables (removed 0) and now considering 1376/1376 (removed 0) transitions.
[2024-05-22 07:47:52] [INFO ] Invariant cache hit.
[2024-05-22 07:47:52] [INFO ] Implicit Places using invariants in 479 ms returned []
[2024-05-22 07:47:52] [INFO ] Invariant cache hit.
[2024-05-22 07:47:53] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-22 07:47:54] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 1848 ms to find 0 implicit places.
Running 1375 sub problems to find dead transitions.
[2024-05-22 07:47:54] [INFO ] Invariant cache hit.
[2024-05-22 07:47:54] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 72/1448 variables, and 12 constraints, problems are : Problem set: 0 solved, 1375 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/72 constraints, ReadFeed: 0/305 constraints, PredecessorRefiner: 1375/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 3 (OVERLAPS) 1375/1447 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1447 variables, 304/388 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1447/1448 variables, and 435 constraints, problems are : Problem set: 0 solved, 1375 unsolved in 30129 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 304/305 constraints, PredecessorRefiner: 1375/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 84056ms problems are : Problem set: 0 solved, 1375 unsolved
Search for dead transitions found 0 dead transitions in 84084ms
Finished structural reductions in LTL mode , in 1 iterations and 85943 ms. Remains : 72/72 places, 1376/1376 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND p0 (NOT p2) (NOT p3) (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 179 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
RANDOM walk for 40000 steps (2175 resets) in 6134 ms. (6 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (115 resets) in 312 ms. (127 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (46 resets) in 269 ms. (148 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40003 steps (114 resets) in 341 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (111 resets) in 420 ms. (95 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (114 resets) in 437 ms. (91 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (116 resets) in 332 ms. (120 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (107 resets) in 366 ms. (109 steps per ms) remains 6/6 properties
[2024-05-22 07:49:21] [INFO ] Invariant cache hit.
[2024-05-22 07:49:21] [INFO ] State equation strengthened by 305 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 48/67 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1440 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1440 variables, 304/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1440 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/1447 variables, 5/388 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1447 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/1448 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1448/1448 variables, and 389 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1497 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 48/67 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1440 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1440 variables, 304/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1440 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/1447 variables, 5/388 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1447 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/1448 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1448/1448 variables, and 389 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1753 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3443ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4262 ms.
Support contains 19 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1376/1376 transitions.
Graph (complete) has 1117 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 71 transition count 1373
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 70 transition count 1371
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 70 transition count 1371
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 14 place count 70 transition count 1362
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 93 place count 61 transition count 1292
Applied a total of 93 rules in 281 ms. Remains 61 /72 variables (removed 11) and now considering 1292/1376 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 61/72 places, 1292/1376 transitions.
RANDOM walk for 40000 steps (889 resets) in 3731 ms. (10 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (62 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (67 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
// Phase 1: matrix 1292 rows 61 cols
[2024-05-22 07:49:30] [INFO ] Computed 13 invariants in 8 ms
[2024-05-22 07:49:30] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1292/1352 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1352 variables, 232/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1353 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1353/1353 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 641 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1292/1352 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1352 variables, 232/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1353 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1353/1353 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1481ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 880 ms.
Support contains 17 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1292/1292 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 1291
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 60 transition count 1281
Applied a total of 12 rules in 140 ms. Remains 60 /61 variables (removed 1) and now considering 1281/1292 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 60/61 places, 1281/1292 transitions.
RANDOM walk for 40000 steps (433 resets) in 2798 ms. (14 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (48 resets) in 228 ms. (174 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (45 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 270603 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 2
Probabilistic random walk after 270603 steps, saw 41740 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
// Phase 1: matrix 1281 rows 60 cols
[2024-05-22 07:49:37] [INFO ] Computed 13 invariants in 11 ms
[2024-05-22 07:49:37] [INFO ] State equation strengthened by 222 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/59 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1281/1340 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 222/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1341 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1341 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1341 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1341/1341 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 900 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/59 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1281/1340 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 222/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1341 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1341 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1341 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1341/1341 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1070 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2033ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1039 ms.
Support contains 17 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1281/1281 transitions.
Applied a total of 0 rules in 110 ms. Remains 60 /60 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 60/60 places, 1281/1281 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1281/1281 transitions.
Applied a total of 0 rules in 67 ms. Remains 60 /60 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
[2024-05-22 07:49:40] [INFO ] Invariant cache hit.
[2024-05-22 07:49:40] [INFO ] Implicit Places using invariants in 317 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 332 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/60 places, 1281/1281 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 1280
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 1280
Applied a total of 2 rules in 83 ms. Remains 58 /59 variables (removed 1) and now considering 1280/1281 (removed 1) transitions.
// Phase 1: matrix 1280 rows 58 cols
[2024-05-22 07:49:40] [INFO ] Computed 12 invariants in 6 ms
[2024-05-22 07:49:41] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-22 07:49:41] [INFO ] Invariant cache hit.
[2024-05-22 07:49:41] [INFO ] State equation strengthened by 222 read => feed constraints.
[2024-05-22 07:49:42] [INFO ] Implicit Places using invariants and state equation in 1209 ms returned []
Implicit Place search using SMT with State Equation took 1588 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/60 places, 1280/1281 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2071 ms. Remains : 58/60 places, 1280/1281 transitions.
RANDOM walk for 40000 steps (495 resets) in 3220 ms. (12 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (48 resets) in 321 ms. (124 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (46 resets) in 285 ms. (139 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 239924 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 2
Probabilistic random walk after 239924 steps, saw 37703 distinct states, run finished after 3005 ms. (steps per millisecond=79 ) properties seen :0
[2024-05-22 07:49:46] [INFO ] Invariant cache hit.
[2024-05-22 07:49:46] [INFO ] State equation strengthened by 222 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1280/1337 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 222/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/1338 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1338 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1338 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1338/1338 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 569 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1280/1337 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 222/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/1338 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1338 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1338 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1338/1338 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 861 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1480ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 875 ms.
Support contains 17 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1280/1280 transitions.
Applied a total of 0 rules in 97 ms. Remains 58 /58 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 58/58 places, 1280/1280 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1280/1280 transitions.
Applied a total of 0 rules in 97 ms. Remains 58 /58 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2024-05-22 07:49:48] [INFO ] Invariant cache hit.
[2024-05-22 07:49:49] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-22 07:49:49] [INFO ] Invariant cache hit.
[2024-05-22 07:49:50] [INFO ] State equation strengthened by 222 read => feed constraints.
[2024-05-22 07:49:50] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1623 ms to find 0 implicit places.
[2024-05-22 07:49:50] [INFO ] Redundant transitions in 60 ms returned []
Running 1279 sub problems to find dead transitions.
[2024-05-22 07:49:50] [INFO ] Invariant cache hit.
[2024-05-22 07:49:50] [INFO ] State equation strengthened by 222 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1280/1338 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
SMT process timed out in 52963ms, After SMT, problems are : Problem set: 0 solved, 1279 unsolved
Search for dead transitions found 0 dead transitions in 52985ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54778 ms. Remains : 58/58 places, 1280/1280 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 83 ms. Remains 58 /58 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-22 07:50:43] [INFO ] Invariant cache hit.
[2024-05-22 07:50:43] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-22 07:50:43] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 07:50:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-22 07:50:44] [INFO ] After 506ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :2
[2024-05-22 07:50:44] [INFO ] After 552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 743 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND p0 (NOT p2) (NOT p3) (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p3), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (AND (OR p0 p3) (OR (NOT p1) p3)))), (F (NOT p0))]
Knowledge based reduction with 19 factoid took 522 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Product exploration explored 100000 steps with 227 reset in 382 ms.
Product exploration explored 100000 steps with 801 reset in 709 ms.
Support contains 19 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 1376/1376 transitions.
Applied a total of 0 rules in 5 ms. Remains 72 /72 variables (removed 0) and now considering 1376/1376 (removed 0) transitions.
// Phase 1: matrix 1376 rows 72 cols
[2024-05-22 07:50:47] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 07:50:47] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-22 07:50:47] [INFO ] Invariant cache hit.
[2024-05-22 07:50:47] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-22 07:50:48] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1244 ms to find 0 implicit places.
Running 1375 sub problems to find dead transitions.
[2024-05-22 07:50:48] [INFO ] Invariant cache hit.
[2024-05-22 07:50:48] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 3 (OVERLAPS) 1375/1447 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
SMT process timed out in 54974ms, After SMT, problems are : Problem set: 0 solved, 1375 unsolved
Search for dead transitions found 0 dead transitions in 54991ms
Finished structural reductions in LTL mode , in 1 iterations and 56247 ms. Remains : 72/72 places, 1376/1376 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-09 finished in 295399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
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(F((p0&&X((p1&&F((G(F(!p2))||(!p3&&F(!p2)))))))))))'
Found a Shortening insensitive property : AutonomousCar-PT-10a-LTLFireability-14
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p1) p2), p2, p2]
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 89 transition count 1434
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 81 transition count 1432
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 77 transition count 1430
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 29 place count 72 transition count 1375
Iterating global reduction 3 with 5 rules applied. Total rules applied 34 place count 72 transition count 1375
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 71 transition count 1374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 70 transition count 1374
Applied a total of 38 rules in 158 ms. Remains 70 /89 variables (removed 19) and now considering 1374/1442 (removed 68) transitions.
// Phase 1: matrix 1374 rows 70 cols
[2024-05-22 07:51:44] [INFO ] Computed 12 invariants in 11 ms
[2024-05-22 07:51:44] [INFO ] Implicit Places using invariants in 522 ms returned []
[2024-05-22 07:51:44] [INFO ] Invariant cache hit.
[2024-05-22 07:51:45] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-22 07:51:46] [INFO ] Implicit Places using invariants and state equation in 1313 ms returned []
Implicit Place search using SMT with State Equation took 1838 ms to find 0 implicit places.
Running 1373 sub problems to find dead transitions.
[2024-05-22 07:51:46] [INFO ] Invariant cache hit.
[2024-05-22 07:51:46] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1443 variables, 70/82 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
SMT process timed out in 54508ms, After SMT, problems are : Problem set: 0 solved, 1373 unsolved
Search for dead transitions found 0 dead transitions in 54535ms
Starting structural reductions in LI_LTL mode, iteration 1 : 70/89 places, 1374/1442 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 56536 ms. Remains : 70/89 places, 1374/1442 transitions.
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-14
Product exploration explored 100000 steps with 25000 reset in 7602 ms.
Product exploration explored 100000 steps with 25000 reset in 7832 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p1) p2), p2, p2]
RANDOM walk for 40000 steps (2273 resets) in 4789 ms. (8 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (115 resets) in 234 ms. (170 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (150 resets) in 289 ms. (137 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (114 resets) in 304 ms. (131 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (104 resets) in 239 ms. (166 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (118 resets) in 258 ms. (154 steps per ms) remains 4/4 properties
[2024-05-22 07:52:58] [INFO ] Invariant cache hit.
[2024-05-22 07:52:58] [INFO ] State equation strengthened by 305 read => feed constraints.
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/65 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1371/1436 variables, 65/77 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1436 variables, 304/381 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1436 variables, 0/381 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 7/1443 variables, 5/386 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1443 variables, 0/386 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1444 variables, 1/387 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1444 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1444 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1444/1444 variables, and 387 constraints, problems are : Problem set: 1 solved, 3 unsolved in 750 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 48/65 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1371/1436 variables, 65/77 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1436 variables, 304/381 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1436 variables, 0/381 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/1443 variables, 5/386 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1443 variables, 0/386 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1444 variables, 1/387 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1444 variables, 0/387 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1444 variables, 0/387 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1444/1444 variables, and 387 constraints, problems are : Problem set: 2 solved, 2 unsolved in 951 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1799ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1121 ms.
Support contains 6 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 1374/1374 transitions.
Graph (complete) has 1115 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 69 transition count 1371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 68 transition count 1369
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 68 transition count 1369
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 66 transition count 1367
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 66 transition count 1359
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 105 place count 58 transition count 1279
Applied a total of 105 rules in 215 ms. Remains 58 /70 variables (removed 12) and now considering 1279/1374 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 58/70 places, 1279/1374 transitions.
RANDOM walk for 40000 steps (497 resets) in 2370 ms. (16 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (89 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (94 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 328895 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 2
Probabilistic random walk after 328895 steps, saw 51545 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
// Phase 1: matrix 1279 rows 58 cols
[2024-05-22 07:53:05] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 07:53:05] [INFO ] State equation strengthened by 222 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/56 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 222/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1337 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1337 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1337/1337 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/56 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 222/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1337 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1337 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 828 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1451ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 686 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 77 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 58/58 places, 1279/1279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 77 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
[2024-05-22 07:53:07] [INFO ] Invariant cache hit.
[2024-05-22 07:53:08] [INFO ] Implicit Places using invariants in 622 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 624 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 57/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 76 ms. Remains 57 /57 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 780 ms. Remains : 57/58 places, 1279/1279 transitions.
RANDOM walk for 40000 steps (498 resets) in 2934 ms. (13 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (94 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (101 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 298106 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 2
Probabilistic random walk after 298106 steps, saw 47137 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
// Phase 1: matrix 1279 rows 57 cols
[2024-05-22 07:53:12] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 07:53:12] [INFO ] State equation strengthened by 222 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/56 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1279/1335 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 222/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1336 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1336 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1336 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 57/57 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/56 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1279/1335 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 222/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1336 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1336 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1336 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 57/57 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1335ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 718 ms.
Support contains 6 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1279/1279 transitions.
Applied a total of 0 rules in 85 ms. Remains 57 /57 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 57/57 places, 1279/1279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1279/1279 transitions.
Applied a total of 0 rules in 81 ms. Remains 57 /57 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
[2024-05-22 07:53:14] [INFO ] Invariant cache hit.
[2024-05-22 07:53:15] [INFO ] Implicit Places using invariants in 643 ms returned []
[2024-05-22 07:53:15] [INFO ] Invariant cache hit.
[2024-05-22 07:53:15] [INFO ] State equation strengthened by 222 read => feed constraints.
[2024-05-22 07:53:16] [INFO ] Implicit Places using invariants and state equation in 1175 ms returned []
Implicit Place search using SMT with State Equation took 1820 ms to find 0 implicit places.
[2024-05-22 07:53:16] [INFO ] Redundant transitions in 44 ms returned []
Running 1278 sub problems to find dead transitions.
[2024-05-22 07:53:16] [INFO ] Invariant cache hit.
[2024-05-22 07:53:16] [INFO ] State equation strengthened by 222 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 3 (OVERLAPS) 1279/1336 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
SMT process timed out in 53805ms, After SMT, problems are : Problem set: 0 solved, 1278 unsolved
Search for dead transitions found 0 dead transitions in 53821ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55775 ms. Remains : 57/57 places, 1279/1279 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 85 ms. Remains 57 /57 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-22 07:54:10] [INFO ] Invariant cache hit.
[2024-05-22 07:54:10] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-22 07:54:10] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 07:54:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-22 07:54:10] [INFO ] After 470ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :2
[2024-05-22 07:54:10] [INFO ] After 511ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 680 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (X p0)), (G (OR p1 p0)), (G (OR (NOT p1) (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0)))), (F (NOT p0)), (F p3), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 192 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Support contains 6 out of 70 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 1374/1374 transitions.
Applied a total of 0 rules in 5 ms. Remains 70 /70 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
// Phase 1: matrix 1374 rows 70 cols
[2024-05-22 07:54:11] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 07:54:11] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-22 07:54:11] [INFO ] Invariant cache hit.
[2024-05-22 07:54:12] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-22 07:54:12] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1267 ms to find 0 implicit places.
Running 1373 sub problems to find dead transitions.
[2024-05-22 07:54:12] [INFO ] Invariant cache hit.
[2024-05-22 07:54:12] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1443 variables, 70/82 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
SMT process timed out in 54565ms, After SMT, problems are : Problem set: 0 solved, 1373 unsolved
Search for dead transitions found 0 dead transitions in 54584ms
Finished structural reductions in LTL mode , in 1 iterations and 55861 ms. Remains : 70/70 places, 1374/1374 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p2) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
RANDOM walk for 40000 steps (2265 resets) in 2628 ms. (15 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (117 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (114 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
[2024-05-22 07:55:08] [INFO ] Invariant cache hit.
[2024-05-22 07:55:08] [INFO ] State equation strengthened by 305 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/64 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1369/1433 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1433 variables, 304/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1433 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/1443 variables, 6/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1443 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1444 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1444 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1444 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1444/1444 variables, and 387 constraints, problems are : Problem set: 0 solved, 2 unsolved in 796 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/64 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1369/1433 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1433 variables, 304/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1433 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/1443 variables, 6/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1443 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1444 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1444 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1444 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1444/1444 variables, and 387 constraints, problems are : Problem set: 0 solved, 2 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1645ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 787 ms.
Support contains 6 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 1374/1374 transitions.
Graph (complete) has 1115 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 69 transition count 1371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 68 transition count 1369
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 68 transition count 1369
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 66 transition count 1367
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 66 transition count 1359
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 105 place count 58 transition count 1279
Applied a total of 105 rules in 235 ms. Remains 58 /70 variables (removed 12) and now considering 1279/1374 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 58/70 places, 1279/1374 transitions.
RANDOM walk for 40000 steps (494 resets) in 2241 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (94 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (97 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 337328 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 2
Probabilistic random walk after 337328 steps, saw 52707 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
// Phase 1: matrix 1279 rows 58 cols
[2024-05-22 07:55:15] [INFO ] Computed 13 invariants in 9 ms
[2024-05-22 07:55:15] [INFO ] State equation strengthened by 222 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/56 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 222/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1337 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1337 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1337/1337 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 600 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/56 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 222/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1337 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1337 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1318ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 712 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 81 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 58/58 places, 1279/1279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 80 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
[2024-05-22 07:55:17] [INFO ] Invariant cache hit.
[2024-05-22 07:55:17] [INFO ] Implicit Places using invariants in 630 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 633 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 57/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 81 ms. Remains 57 /57 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 795 ms. Remains : 57/58 places, 1279/1279 transitions.
RANDOM walk for 40000 steps (485 resets) in 2286 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (91 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (89 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 339792 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 2
Probabilistic random walk after 339792 steps, saw 53017 distinct states, run finished after 3004 ms. (steps per millisecond=113 ) properties seen :0
// Phase 1: matrix 1279 rows 57 cols
[2024-05-22 07:55:21] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 07:55:21] [INFO ] State equation strengthened by 222 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/56 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1279/1335 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 222/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1336 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1336 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1336 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 592 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 57/57 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/56 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1279/1335 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 222/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1336 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1336 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1336 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 679 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 57/57 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1325ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 706 ms.
Support contains 6 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1279/1279 transitions.
Applied a total of 0 rules in 80 ms. Remains 57 /57 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 57/57 places, 1279/1279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1279/1279 transitions.
Applied a total of 0 rules in 80 ms. Remains 57 /57 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
[2024-05-22 07:55:23] [INFO ] Invariant cache hit.
[2024-05-22 07:55:24] [INFO ] Implicit Places using invariants in 619 ms returned []
[2024-05-22 07:55:24] [INFO ] Invariant cache hit.
[2024-05-22 07:55:25] [INFO ] State equation strengthened by 222 read => feed constraints.
[2024-05-22 07:55:25] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1817 ms to find 0 implicit places.
[2024-05-22 07:55:25] [INFO ] Redundant transitions in 44 ms returned []
Running 1278 sub problems to find dead transitions.
[2024-05-22 07:55:25] [INFO ] Invariant cache hit.
[2024-05-22 07:55:25] [INFO ] State equation strengthened by 222 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 3 (OVERLAPS) 1279/1336 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
SMT process timed out in 54019ms, After SMT, problems are : Problem set: 0 solved, 1278 unsolved
Search for dead transitions found 0 dead transitions in 54035ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55987 ms. Remains : 57/57 places, 1279/1279 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 80 ms. Remains 57 /57 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-22 07:56:20] [INFO ] Invariant cache hit.
[2024-05-22 07:56:20] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-22 07:56:20] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 07:56:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-22 07:56:20] [INFO ] After 443ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :2
[2024-05-22 07:56:20] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 651 ms.
Knowledge obtained : [(AND (NOT p2) p1)]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 190 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 188 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Product exploration explored 100000 steps with 25000 reset in 8065 ms.
Product exploration explored 100000 steps with 25000 reset in 8049 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 233 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Support contains 6 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 1374/1374 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 1374
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 164 ms. Remains 70 /70 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
[2024-05-22 07:56:37] [INFO ] Redundant transitions in 62 ms returned []
Running 1373 sub problems to find dead transitions.
// Phase 1: matrix 1374 rows 70 cols
[2024-05-22 07:56:37] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 07:56:37] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Problem TDEAD1063 is UNSAT
Problem TDEAD1067 is UNSAT
At refinement iteration 3 (OVERLAPS) 1373/1443 variables, 70/82 constraints. Problems are: Problem set: 2 solved, 1371 unsolved
SMT process timed out in 55946ms, After SMT, problems are : Problem set: 2 solved, 1371 unsolved
Search for dead transitions found 2 dead transitions in 55964ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 70/70 places, 1372/1374 transitions.
Graph (complete) has 1161 edges and 70 vertex of which 68 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 152 ms. Remains 68 /70 variables (removed 2) and now considering 1372/1372 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/70 places, 1372/1374 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56354 ms. Remains : 68/70 places, 1372/1374 transitions.
Support contains 6 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 1374/1374 transitions.
Applied a total of 0 rules in 7 ms. Remains 70 /70 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
// Phase 1: matrix 1374 rows 70 cols
[2024-05-22 07:57:34] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 07:57:34] [INFO ] Implicit Places using invariants in 667 ms returned []
[2024-05-22 07:57:34] [INFO ] Invariant cache hit.
[2024-05-22 07:57:35] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-22 07:57:35] [INFO ] Implicit Places using invariants and state equation in 1209 ms returned []
Implicit Place search using SMT with State Equation took 1878 ms to find 0 implicit places.
Running 1373 sub problems to find dead transitions.
[2024-05-22 07:57:35] [INFO ] Invariant cache hit.
[2024-05-22 07:57:35] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1373/1443 variables, 70/82 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
SMT process timed out in 54736ms, After SMT, problems are : Problem set: 0 solved, 1373 unsolved
Search for dead transitions found 0 dead transitions in 54753ms
Finished structural reductions in LTL mode , in 1 iterations and 56641 ms. Remains : 70/70 places, 1374/1374 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-14 finished in 407175 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||X((X(X(p1))||G(p2)))))))'
[2024-05-22 07:58:31] [INFO ] Flatten gal took : 190 ms
[2024-05-22 07:58:31] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-05-22 07:58:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 89 places, 1442 transitions and 25487 arcs took 37 ms.
Total runtime 2693164 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-10a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 89
TRANSITIONS: 1442
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.162s, Sys 0.009s]


SAVING FILE /home/mcc/execution/407/model (.net / .def) ...
EXPORT TIME: [User 0.011s, Sys 0.003s]


----------------------------------------------------------------------
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: 3132
MODEL NAME: /home/mcc/execution/407/model
89 places, 1442 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 AutonomousCar-PT-10a-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-10a-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-10a-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-10a-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716365232766

--------------------
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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-10a"
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 AutonomousCar-PT-10a, 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 r025-smll-171620166500364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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