About the Execution of ITS-Tools for RERS17pb113-PT-2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ?FT??F???F???F?? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r170-smll-174889233800380.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is RERS17pb113-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-174889233800380
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 15M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-00
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-01
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-02
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-03
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-04
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-05
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-06
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-07
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-08
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-09
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-10
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-11
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-12
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-13
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-14
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749054092400
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb113-PT-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-04 16:21:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 16:21:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 16:21:36] [INFO ] Load time of PNML (sax parser for PT used): 1335 ms
[2025-06-04 16:21:36] [INFO ] Transformed 639 places.
[2025-06-04 16:21:36] [INFO ] Transformed 31353 transitions.
[2025-06-04 16:21:36] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 1721 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA RERS17pb113-PT-2-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb113-PT-2-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb113-PT-2-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 639 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
Applied a total of 12 rules in 312 ms. Remains 627 /639 variables (removed 12) and now considering 31353/31353 (removed 0) transitions.
[2025-06-04 16:21:37] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2025-06-04 16:21:38] [INFO ] Computed 13 invariants in 166 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:21:43] [INFO ] Implicit Places using invariants in 5288 ms returned []
Implicit Place search using SMT only with invariants took 5368 ms to find 0 implicit places.
Running 31352 sub problems to find dead transitions.
[2025-06-04 16:21:43] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2025-06-04 16:21:43] [INFO ] Invariant cache hit.
[2025-06-04 16:21:44] [INFO ] State equation strengthened by 829 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/18953 variables, and 0 constraints, problems are : Problem set: 0 solved, 31352 unsolved in 30889 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 31352/31352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31352 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/18953 variables, and 0 constraints, problems are : Problem set: 0 solved, 31352 unsolved in 30585 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 0/31352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 223242ms problems are : Problem set: 0 solved, 31352 unsolved
Search for dead transitions found 0 dead transitions in 223602ms
Starting structural reductions in LTL mode, iteration 1 : 627/639 places, 31353/31353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229540 ms. Remains : 627/639 places, 31353/31353 transitions.
Support contains 68 out of 627 places after structural reductions.
[2025-06-04 16:25:29] [INFO ] Flatten gal took : 1347 ms
[2025-06-04 16:25:30] [INFO ] Flatten gal took : 1185 ms
[2025-06-04 16:25:33] [INFO ] Input system was already deterministic with 31353 transitions.
Support contains 59 out of 627 places (down from 68) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (8 resets) in 6085 ms. (6 steps per ms) remains 18/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 99 ms. (40 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
[2025-06-04 16:25:35] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2025-06-04 16:25:35] [INFO ] Invariant cache hit.
[2025-06-04 16:25:36] [INFO ] State equation strengthened by 829 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 562/595 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:25:38] [INFO ] Deduced a trap composed of 65 places in 2083 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:25:39] [INFO ] Deduced a trap composed of 65 places in 959 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 595/18953 variables, and 13 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5094 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 18/17 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 562/595 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/595 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:25:43] [INFO ] Deduced a trap composed of 65 places in 1371 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:25:45] [INFO ] Deduced a trap composed of 65 places in 1068 ms of which 33 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 595/18953 variables, and 15 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 1/17 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10867ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 771 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 775 ms. Remains : 626/627 places, 31352/31353 transitions.
RANDOM walk for 40000 steps (8 resets) in 2815 ms. (14 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
[2025-06-04 16:25:48] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2025-06-04 16:25:48] [INFO ] Computed 13 invariants in 119 ms
[2025-06-04 16:25:49] [INFO ] State equation strengthened by 268 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 564/594 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:25:52] [INFO ] Deduced a trap composed of 48 places in 2767 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:25:55] [INFO ] Deduced a trap composed of 64 places in 3422 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:25:58] [INFO ] Deduced a trap composed of 64 places in 3032 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:26:00] [INFO ] Deduced a trap composed of 64 places in 2016 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:26:02] [INFO ] Deduced a trap composed of 64 places in 880 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:26:08] [INFO ] Deduced a trap composed of 64 places in 1574 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:26:09] [INFO ] Deduced a trap composed of 64 places in 1154 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:26:21] [INFO ] Deduced a trap composed of 48 places in 2584 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:26:21] [INFO ] Deduced a trap composed of 65 places in 672 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/594 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:26:28] [INFO ] Deduced a trap composed of 48 places in 2033 ms of which 88 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/594 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:26:33] [INFO ] Deduced a trap composed of 64 places in 2854 ms of which 62 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/18951 variables, and 22 constraints, problems are : Problem set: 0 solved, 16 unsolved in 45191 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, State Equation: 0/626 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 16/15 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 564/594 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 18293/18887 variables, 594/616 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18887 variables, 224/840 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 18887/18951 variables, and 843 constraints, problems are : Problem set: 0 solved, 16 unsolved in 45051 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, State Equation: 594/626 constraints, ReadFeed: 224/268 constraints, PredecessorRefiner: 4/15 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90868ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 254 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 626/626 places, 31352/31352 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0)&&F(p1)) U X((!p2 U G(p3))))))'
Support contains 8 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 116 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2025-06-04 16:27:20] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2025-06-04 16:27:20] [INFO ] Computed 13 invariants in 93 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:27:24] [INFO ] Implicit Places using invariants in 3590 ms returned []
Implicit Place search using SMT only with invariants took 3603 ms to find 0 implicit places.
Running 31352 sub problems to find dead transitions.
[2025-06-04 16:27:24] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2025-06-04 16:27:24] [INFO ] Invariant cache hit.
[2025-06-04 16:27:24] [INFO ] State equation strengthened by 829 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/18953 variables, and 0 constraints, problems are : Problem set: 0 solved, 31352 unsolved in 30995 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 31352/31352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31352 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/18953 variables, and 0 constraints, problems are : Problem set: 0 solved, 31352 unsolved in 30786 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 0/31352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 331194ms problems are : Problem set: 0 solved, 31352 unsolved
Search for dead transitions found 0 dead transitions in 331314ms
Finished structural reductions in LTL mode , in 1 iterations and 335142 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 1930 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), (NOT p0), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-00
Product exploration explored 100000 steps with 28652 reset in 8049 ms.
Product exploration explored 100000 steps with 28600 reset in 8710 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT p3)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p3 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 195 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 476 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), (NOT p0), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 2861 ms. (13 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 395 ms. (101 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 534 ms. (74 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 318 ms. (125 steps per ms) remains 2/2 properties
[2025-06-04 16:33:16] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2025-06-04 16:33:16] [INFO ] Invariant cache hit.
[2025-06-04 16:33:17] [INFO ] State equation strengthened by 829 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 297/305 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:33:18] [INFO ] Deduced a trap composed of 65 places in 1035 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 322/627 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:33:25] [INFO ] Deduced a trap composed of 41 places in 4899 ms of which 180 ms to minimize.
SMT process timed out in 8267ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 697 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 701 ms. Remains : 626/627 places, 31352/31353 transitions.
RANDOM walk for 40000 steps (8 resets) in 2198 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 14223 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :0 out of 2
Probabilistic random walk after 14223 steps, saw 12398 distinct states, run finished after 3015 ms. (steps per millisecond=4 ) properties seen :0
[2025-06-04 16:33:29] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2025-06-04 16:33:29] [INFO ] Computed 13 invariants in 55 ms
[2025-06-04 16:33:30] [INFO ] State equation strengthened by 268 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 296/304 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 14380/14684 variables, 304/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14684 variables, 72/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14684 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4267/18951 variables, 322/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18951 variables, 7/711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18951 variables, 196/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/18951 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/18951 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18951/18951 variables, and 907 constraints, problems are : Problem set: 0 solved, 2 unsolved in 25076 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 296/304 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:33:56] [INFO ] Deduced a trap composed of 64 places in 1452 ms of which 34 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14380/14684 variables, 304/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14684 variables, 72/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14684 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4267/18951 variables, 322/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18951 variables, 7/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/18951 variables, 196/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:34:24] [INFO ] Deduced a trap composed of 40 places in 1591 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:34:26] [INFO ] Deduced a trap composed of 40 places in 1534 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:34:27] [INFO ] Deduced a trap composed of 48 places in 859 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/18951 variables, 3/911 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/18951 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/18951 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18951/18951 variables, and 911 constraints, problems are : Problem set: 0 solved, 2 unsolved in 43173 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68601ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 8 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 240 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 232 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2025-06-04 16:34:38] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2025-06-04 16:34:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:34:42] [INFO ] Implicit Places using invariants in 4104 ms returned []
Implicit Place search using SMT only with invariants took 4109 ms to find 0 implicit places.
Running 31351 sub problems to find dead transitions.
[2025-06-04 16:34:43] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2025-06-04 16:34:43] [INFO ] Invariant cache hit.
[2025-06-04 16:34:43] [INFO ] State equation strengthened by 268 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 31351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/18951 variables, and 13 constraints, problems are : Problem set: 0 solved, 31351 unsolved in 31755 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/626 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 31351/31351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31351 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 31351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/18951 variables, and 13 constraints, problems are : Problem set: 0 solved, 31351 unsolved in 30729 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/626 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 0/31351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 268914ms problems are : Problem set: 0 solved, 31351 unsolved
Search for dead transitions found 0 dead transitions in 268981ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273390 ms. Remains : 626/626 places, 31352/31352 transitions.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT p3)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p3 p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (F p3), (F (NOT (OR p2 (NOT p3) p0))), (F p0), (F (NOT (OR p1 p2 (NOT p3)))), (F p2), (F (NOT (OR (NOT p2) p3 p0))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR p1 (NOT p2) p3))), (F p1)]
Knowledge based reduction with 12 factoid took 561 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 417 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), (NOT p0), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 353 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), (NOT p0), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p2))]
[2025-06-04 16:39:13] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2025-06-04 16:39:13] [INFO ] Computed 13 invariants in 67 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (NOT p3)
Support contains 8 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 103 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2025-06-04 16:39:28] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2025-06-04 16:39:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:39:32] [INFO ] Implicit Places using invariants in 3357 ms returned []
Implicit Place search using SMT only with invariants took 3359 ms to find 0 implicit places.
Running 31352 sub problems to find dead transitions.
[2025-06-04 16:39:33] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2025-06-04 16:39:33] [INFO ] Invariant cache hit.
[2025-06-04 16:39:33] [INFO ] State equation strengthened by 829 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/18953 variables, and 0 constraints, problems are : Problem set: 0 solved, 31352 unsolved in 30867 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 31352/31352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31352 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/18953 variables, and 0 constraints, problems are : Problem set: 0 solved, 31352 unsolved in 30489 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 0/31352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 237779ms problems are : Problem set: 0 solved, 31352 unsolved
Search for dead transitions found 0 dead transitions in 237843ms
Finished structural reductions in LTL mode , in 1 iterations and 242275 ms. Remains : 627/627 places, 31353/31353 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT p3)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p3) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 312 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 651 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), (NOT p0), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 2867 ms. (13 steps per ms) remains 5/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 265 ms. (150 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 437 ms. (91 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 5/5 properties
[2025-06-04 16:43:33] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2025-06-04 16:43:33] [INFO ] Invariant cache hit.
[2025-06-04 16:43:34] [INFO ] State equation strengthened by 829 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 297/305 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:43:36] [INFO ] Deduced a trap composed of 41 places in 1614 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:43:37] [INFO ] Deduced a trap composed of 49 places in 1659 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:43:39] [INFO ] Deduced a trap composed of 49 places in 1446 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/18953 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5281 ms.
Refiners :[Positive P Invariants (semi-flows): 6/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 297/305 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:43:41] [INFO ] Deduced a trap composed of 49 places in 1708 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:43:42] [INFO ] Deduced a trap composed of 65 places in 1041 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/18953 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5185 ms.
Refiners :[Positive P Invariants (semi-flows): 6/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11085ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 551 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 559 ms. Remains : 626/627 places, 31352/31353 transitions.
RANDOM walk for 40000 steps (8 resets) in 2191 ms. (18 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 156 ms. (254 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 225 ms. (177 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1037 steps, run timeout after 3135 ms. (steps per millisecond=0 ) properties seen :0 out of 5
Probabilistic random walk after 1037 steps, saw 895 distinct states, run finished after 3139 ms. (steps per millisecond=0 ) properties seen :0
[2025-06-04 16:43:49] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2025-06-04 16:43:49] [INFO ] Computed 13 invariants in 63 ms
[2025-06-04 16:43:50] [INFO ] State equation strengthened by 268 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 296/304 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 14380/14684 variables, 304/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14684 variables, 72/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14684 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4267/18951 variables, 322/704 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18951 variables, 7/711 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18951 variables, 196/907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/18951 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/18951 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18951/18951 variables, and 907 constraints, problems are : Problem set: 0 solved, 5 unsolved in 42008 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 296/304 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:34] [INFO ] Deduced a trap composed of 40 places in 2015 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:35] [INFO ] Deduced a trap composed of 48 places in 1488 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 14380/14684 variables, 304/312 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14684 variables, 72/384 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14684 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 4267/18951 variables, 322/706 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18951 variables, 7/713 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 18951/18951 variables, and 909 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45048 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 87537ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 245 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 244 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2025-06-04 16:45:17] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2025-06-04 16:45:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:45:22] [INFO ] Implicit Places using invariants in 5262 ms returned []
Implicit Place search using SMT only with invariants took 5270 ms to find 0 implicit places.
Running 31351 sub problems to find dead transitions.
[2025-06-04 16:45:23] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2025-06-04 16:45:23] [INFO ] Invariant cache hit.
[2025-06-04 16:45:23] [INFO ] State equation strengthened by 268 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 31351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/18951 variables, and 13 constraints, problems are : Problem set: 0 solved, 31351 unsolved in 30557 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/626 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 31351/31351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31351 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 31351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/18951 variables, and 13 constraints, problems are : Problem set: 0 solved, 31351 unsolved in 30731 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/626 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 0/31351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 222887ms problems are : Problem set: 0 solved, 31351 unsolved
Search for dead transitions found 0 dead transitions in 222945ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228503 ms. Remains : 626/626 places, 31352/31352 transitions.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT p3)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p3) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3 p1))), (F (NOT (OR p0 (NOT p2) p3))), (F p0), (F p2), (F p1), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p3) (NOT p1))))]
Knowledge based reduction with 12 factoid took 472 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 358 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), (NOT p0), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 368 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), (NOT p0), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p2))]
[2025-06-04 16:49:07] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2025-06-04 16:49:07] [INFO ] Computed 13 invariants in 86 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 349 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), (NOT p0), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 28647 reset in 7026 ms.
Product exploration explored 100000 steps with 28573 reset in 6108 ms.
Applying partial POR strategy [false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 439 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), (NOT p0), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p2))]
Support contains 8 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 457 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Running 31352 sub problems to find dead transitions.
[2025-06-04 16:49:37] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2025-06-04 16:49:37] [INFO ] Invariant cache hit.
[2025-06-04 16:49:37] [INFO ] State equation strengthened by 829 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/18953 variables, and 0 constraints, problems are : Problem set: 0 solved, 31352 unsolved in 31253 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 31352/31352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31352 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/18953 variables, and 0 constraints, problems are : Problem set: 0 solved, 31352 unsolved in 30521 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 0/31352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 229584ms problems are : Problem set: 0 solved, 31352 unsolved
Search for dead transitions found 0 dead transitions in 229667ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 230159 ms. Remains : 627/627 places, 31353/31353 transitions.
Built C files in :
/tmp/ltsmin4254626539540091238
[2025-06-04 16:53:27] [INFO ] Built C files in 578ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4254626539540091238
Running compilation step : cd /tmp/ltsmin4254626539540091238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4254626539540091238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4254626539540091238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 8 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 152 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2025-06-04 16:53:31] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2025-06-04 16:53:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:53:34] [INFO ] Implicit Places using invariants in 3504 ms returned []
Implicit Place search using SMT only with invariants took 3507 ms to find 0 implicit places.
Running 31352 sub problems to find dead transitions.
[2025-06-04 16:53:34] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2025-06-04 16:53:34] [INFO ] Invariant cache hit.
[2025-06-04 16:53:35] [INFO ] State equation strengthened by 829 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/18953 variables, and 0 constraints, problems are : Problem set: 0 solved, 31352 unsolved in 31006 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 31352/31352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31352 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/18953 variables, and 0 constraints, problems are : Problem set: 0 solved, 31352 unsolved in 30800 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 0/31352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 230099ms problems are : Problem set: 0 solved, 31352 unsolved
Search for dead transitions found 0 dead transitions in 230157ms
Finished structural reductions in LTL mode , in 1 iterations and 233853 ms. Remains : 627/627 places, 31353/31353 transitions.
Built C files in :
/tmp/ltsmin6609008478635825189
[2025-06-04 16:57:25] [INFO ] Built C files in 422ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6609008478635825189
Running compilation step : cd /tmp/ltsmin6609008478635825189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6609008478635825189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6609008478635825189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-04 16:57:31] [INFO ] Flatten gal took : 839 ms
[2025-06-04 16:57:32] [INFO ] Flatten gal took : 1099 ms
[2025-06-04 16:57:32] [INFO ] Time to serialize gal into /tmp/LTL7513630861480388140.gal : 231 ms
[2025-06-04 16:57:32] [INFO ] Time to serialize properties into /tmp/LTL17587713002709696506.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7513630861480388140.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8598441765216786396.hoa' '-atoms' '/tmp/LTL17587713002709696506.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17587713002709696506.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8598441765216786396.hoa
Detected timeout of ITS tools.
[2025-06-04 16:57:49] [INFO ] Flatten gal took : 759 ms
[2025-06-04 16:57:50] [INFO ] Flatten gal took : 839 ms
[2025-06-04 16:57:50] [INFO ] Time to serialize gal into /tmp/LTL17440973980317063080.gal : 176 ms
[2025-06-04 16:57:50] [INFO ] Time to serialize properties into /tmp/LTL16196175016906668271.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17440973980317063080.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16196175016906668271.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(((F("((p447>=1)&&(p251>=1))"))&&(F("((p470>=1)&&(p60>=1))")))U(X((!("((p196>=1)&&(p298>=1))"))U(G("((p448>=1)&&(p237>=1))")))))))
Formula 0 simplified : X((G!"((p447>=1)&&(p251>=1))" | G!"((p470>=1)&&(p60>=1))") R X("((p196>=1)&&(p298>=1))" R F!"((p448>=1)&&(p237>=1))"))
Detected timeout of ITS tools.
[2025-06-04 16:58:06] [INFO ] Flatten gal took : 786 ms
[2025-06-04 16:58:06] [INFO ] Applying decomposition
[2025-06-04 16:58:07] [INFO ] Flatten gal took : 841 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10670987114307687986.txt' '-o' '/tmp/graph10670987114307687986.bin' '-w' '/tmp/graph10670987114307687986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10670987114307687986.bin' '-l' '-1' '-v' '-w' '/tmp/graph10670987114307687986.weights' '-q' '0' '-e' '0.001'
[2025-06-04 16:58:10] [INFO ] Decomposing Gal with order
[2025-06-04 16:58:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 16:58:13] [INFO ] Removed a total of 91938 redundant transitions.
[2025-06-04 16:58:14] [INFO ] Flatten gal took : 2495 ms
[2025-06-04 16:58:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 1638 labels/synchronizations in 1425 ms.
[2025-06-04 16:58:17] [INFO ] Time to serialize gal into /tmp/LTL12301587082692133099.gal : 180 ms
[2025-06-04 16:58:17] [INFO ] Time to serialize properties into /tmp/LTL15756965440989918438.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12301587082692133099.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15756965440989918438.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(((F("((i4.u162.p447>=1)&&(i0.i1.i1.i1.u175.p251>=1))"))&&(F("((i1.u113.p470>=1)&&(i3.i1.i1.i1.u207.p60>=1))")))U(X((!("((i3.i1.i3...263
Formula 0 simplified : X((G!"((i4.u162.p447>=1)&&(i0.i1.i1.i1.u175.p251>=1))" | G!"((i1.u113.p470>=1)&&(i3.i1.i1.i1.u207.p60>=1))") R X("((i3.i1.i3.i9.u25....249
Detected timeout of ITS tools.
Treatment of property RERS17pb113-PT-2-LTLFireability-00 finished in 1871963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 270 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2025-06-04 16:58:32] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2025-06-04 16:58:32] [INFO ] Computed 13 invariants in 58 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:58:36] [INFO ] Implicit Places using invariants in 3552 ms returned []
Implicit Place search using SMT only with invariants took 3555 ms to find 0 implicit places.
Running 31351 sub problems to find dead transitions.
[2025-06-04 16:58:36] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2025-06-04 16:58:36] [INFO ] Invariant cache hit.
[2025-06-04 16:58:36] [INFO ] State equation strengthened by 268 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 31351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/18951 variables, and 13 constraints, problems are : Problem set: 0 solved, 31351 unsolved in 30878 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/626 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 31351/31351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31351 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 31351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/18951 variables, and 13 constraints, problems are : Problem set: 0 solved, 31351 unsolved in 31722 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/626 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 0/31351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 233875ms problems are : Problem set: 0 solved, 31351 unsolved
Search for dead transitions found 0 dead transitions in 233928ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 237803 ms. Remains : 626/627 places, 31352/31353 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0)]
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 5567 ms.
Product exploration explored 100000 steps with 0 reset in 3887 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 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 48 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 1815 ms. (22 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 13708 steps, run timeout after 3002 ms. (steps per millisecond=4 ) properties seen :0 out of 1
Probabilistic random walk after 13708 steps, saw 11961 distinct states, run finished after 3008 ms. (steps per millisecond=4 ) properties seen :0
[2025-06-04 17:02:43] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2025-06-04 17:02:43] [INFO ] Invariant cache hit.
[2025-06-04 17:02:44] [INFO ] State equation strengthened by 268 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 126/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:02:45] [INFO ] Deduced a trap composed of 64 places in 1105 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6912/18951 variables, and 131 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3413 ms.
Refiners :[Positive P Invariants (semi-flows): 2/13 constraints, State Equation: 128/626 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 126/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6784/6912 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6912 variables, 16/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6912 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 8769ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 236 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 626/626 places, 31352/31352 transitions.
RANDOM walk for 40000 steps (8 resets) in 2169 ms. (18 steps per ms) remains 1/1 properties
BEST_FIRST walk for 32377 steps (6 resets) in 203 ms. (158 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA RERS17pb113-PT-2-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property RERS17pb113-PT-2-LTLFireability-01 finished in 261640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 109 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2025-06-04 17:02:53] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2025-06-04 17:02:54] [INFO ] Computed 13 invariants in 82 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:02:58] [INFO ] Implicit Places using invariants in 4984 ms returned []
Implicit Place search using SMT only with invariants took 4990 ms to find 0 implicit places.
Running 31352 sub problems to find dead transitions.
[2025-06-04 17:02:59] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2025-06-04 17:02:59] [INFO ] Invariant cache hit.
[2025-06-04 17:02:59] [INFO ] State equation strengthened by 829 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/18953 variables, and 0 constraints, problems are : Problem set: 0 solved, 31352 unsolved in 31042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 31352/31352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31352 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/18953 variables, and 0 constraints, problems are : Problem set: 0 solved, 31352 unsolved in 30956 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 0/31352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 241523ms problems are : Problem set: 0 solved, 31352 unsolved
Search for dead transitions found 0 dead transitions in 241593ms
Finished structural reductions in LTL mode , in 1 iterations and 246731 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 403 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-02
Product exploration timeout after 71070 steps with 23690 reset in 10001 ms.
Product exploration explored 100000 steps with 33333 reset in 7583 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 25 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS17pb113-PT-2-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS17pb113-PT-2-LTLFireability-02 finished in 265011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G((F(p1) U X(X(p2)))))))'
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 106 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2025-06-04 17:07:19] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2025-06-04 17:07:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:07:22] [INFO ] Implicit Places using invariants in 3413 ms returned []
Implicit Place search using SMT only with invariants took 3421 ms to find 0 implicit places.
Running 31352 sub problems to find dead transitions.
[2025-06-04 17:07:22] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2025-06-04 17:07:22] [INFO ] Invariant cache hit.
[2025-06-04 17:07:22] [INFO ] State equation strengthened by 829 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/18953 variables, and 0 constraints, problems are : Problem set: 0 solved, 31352 unsolved in 31428 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 31352/31352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31352 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/18953 variables, and 0 constraints, problems are : Problem set: 0 solved, 31352 unsolved in 30767 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 0/31352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 228697ms problems are : Problem set: 0 solved, 31352 unsolved
Search for dead transitions found 0 dead transitions in 228750ms
Finished structural reductions in LTL mode , in 1 iterations and 232313 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 1177 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1)), false, false]
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-03
Product exploration explored 100000 steps with 8 reset in 5283 ms.
Product exploration explored 100000 steps with 2 reset in 5528 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 706 ms. Reduced automaton from 16 states, 32 edges and 3 AP (stutter sensitive) to 16 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1013 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (8 resets) in 3513 ms. (11 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 202 ms. (197 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 435 ms. (91 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 458 ms. (87 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 5/5 properties
[2025-06-04 17:11:27] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2025-06-04 17:11:27] [INFO ] Invariant cache hit.
[2025-06-04 17:11:27] [INFO ] State equation strengthened by 829 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 285/291 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:11:29] [INFO ] Deduced a trap composed of 65 places in 1069 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 336/627 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:11:34] [INFO ] Deduced a trap composed of 41 places in 3870 ms of which 164 ms to minimize.
SMT process timed out in 7764ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 435 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 440 ms. Remains : 626/627 places, 31352/31353 transitions.
RANDOM walk for 40000 steps (8 resets) in 2704 ms. (14 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 13956 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :0 out of 5
Probabilistic random walk after 13956 steps, saw 12178 distinct states, run finished after 3008 ms. (steps per millisecond=4 ) properties seen :0
[2025-06-04 17:11:39] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2025-06-04 17:11:39] [INFO ] Computed 13 invariants in 57 ms
[2025-06-04 17:11:39] [INFO ] State equation strengthened by 268 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 284/290 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:11:41] [INFO ] Deduced a trap composed of 64 places in 1833 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:11:43] [INFO ] Deduced a trap composed of 64 places in 1216 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 11153/11443 variables, 290/297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11443 variables, 56/353 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/11443 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 7494/18937 variables, 328/681 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18937 variables, 7/688 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/18937 variables, 210/898 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/18937 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SMT process timed out in 45620ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 322 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 324 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 292 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2025-06-04 17:12:25] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2025-06-04 17:12:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:12:29] [INFO ] Implicit Places using invariants in 4354 ms returned []
Implicit Place search using SMT only with invariants took 4359 ms to find 0 implicit places.
Running 31351 sub problems to find dead transitions.
[2025-06-04 17:12:30] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2025-06-04 17:12:30] [INFO ] Invariant cache hit.
[2025-06-04 17:12:30] [INFO ] State equation strengthened by 268 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 31351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/18951 variables, and 13 constraints, problems are : Problem set: 0 solved, 31351 unsolved in 30914 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/626 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 31351/31351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31351 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 31351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/18951 variables, and 13 constraints, problems are : Problem set: 0 solved, 31351 unsolved in 31323 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/626 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 0/31351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 253410ms problems are : Problem set: 0 solved, 31351 unsolved
Search for dead transitions found 0 dead transitions in 253504ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258215 ms. Remains : 626/626 places, 31352/31352 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 444 ms. Reduced automaton from 16 states, 32 edges and 3 AP (stutter sensitive) to 16 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 874 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 862 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1)), false, false]
[2025-06-04 17:16:45] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2025-06-04 17:16:45] [INFO ] Computed 13 invariants in 85 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (NOT p2)
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 184 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2025-06-04 17:17:01] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2025-06-04 17:17:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:17:06] [INFO ] Implicit Places using invariants in 5026 ms returned []
Implicit Place search using SMT only with invariants took 5027 ms to find 0 implicit places.
Running 31352 sub problems to find dead transitions.
[2025-06-04 17:17:06] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2025-06-04 17:17:06] [INFO ] Invariant cache hit.
[2025-06-04 17:17:07] [INFO ] State equation strengthened by 829 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/18953 variables, and 0 constraints, problems are : Problem set: 0 solved, 31352 unsolved in 31094 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 31352/31352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31352 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/18953 variables, and 0 constraints, problems are : Problem set: 0 solved, 31352 unsolved in 31505 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 0/31352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 238684ms problems are : Problem set: 0 solved, 31352 unsolved
Search for dead transitions found 0 dead transitions in 238759ms
Finished structural reductions in LTL mode , in 1 iterations and 244091 ms. Remains : 627/627 places, 31353/31353 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 613 ms. Reduced automaton from 16 states, 32 edges and 3 AP (stutter sensitive) to 16 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1218 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (8 resets) in 3438 ms. (11 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 781 ms. (51 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 319 ms. (125 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 419 ms. (95 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 22164 steps, run timeout after 6001 ms. (steps per millisecond=3 ) properties seen :0 out of 9
Probabilistic random walk after 22164 steps, saw 19341 distinct states, run finished after 6003 ms. (steps per millisecond=3 ) properties seen :0
[2025-06-04 17:21:16] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2025-06-04 17:21:16] [INFO ] Invariant cache hit.
[2025-06-04 17:21:16] [INFO ] State equation strengthened by 829 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 285/291 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 336/627 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:22] [INFO ] Deduced a trap composed of 41 places in 4834 ms of which 171 ms to minimize.
SMT process timed out in 6356ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 654 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 663 ms. Remains : 626/627 places, 31352/31353 transitions.
RANDOM walk for 40000 steps (8 resets) in 2678 ms. (14 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 364 ms. (109 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 5/5 properties
[2025-06-04 17:21:24] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2025-06-04 17:21:24] [INFO ] Computed 13 invariants in 70 ms
[2025-06-04 17:21:24] [INFO ] State equation strengthened by 268 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 284/290 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:26] [INFO ] Deduced a trap composed of 64 places in 1457 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:27] [INFO ] Deduced a trap composed of 64 places in 996 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 11153/11443 variables, 290/297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RERS17pb113-PT-2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is RERS17pb113-PT-2, 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 r170-smll-174889233800380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb113-PT-2.tgz
mv RERS17pb113-PT-2 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.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;