MCC'2024- Execution of r268-smll-171654407300283

About the Execution of ITS-Tools for Peterson-PT-6

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1739.779	742483.00	929146.00	2373.40	FFTFTFFFFFFTFFFT	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r268-smll-171654407300283.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Peterson-PT-6, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407300283
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.9M
-rw-r--r-- 1 mcc users 150K Apr 12 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 608K Apr 12 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 135K Apr 12 02:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 633K Apr 12 02:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 84K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 254K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 294K Apr 12 03:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 12 03:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 432K Apr 12 03:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.9M Apr 12 03:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 877K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716782830094

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-6
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-27 04:07:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 04:07:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 04:07:13] [INFO ] Load time of PNML (sax parser for PT used): 438 ms
[2024-05-27 04:07:13] [INFO ] Transformed 1330 places.
[2024-05-27 04:07:13] [INFO ] Transformed 2030 transitions.
[2024-05-27 04:07:13] [INFO ] Found NUPN structural information;
[2024-05-27 04:07:13] [INFO ] Parsed PT model containing 1330 places and 2030 transitions and 6272 arcs in 703 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 70 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-PT-6-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1276 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 67 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:07:14] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-27 04:07:14] [INFO ] Computed 27 invariants in 68 ms
[2024-05-27 04:07:15] [INFO ] Implicit Places using invariants in 1386 ms returned []
[2024-05-27 04:07:15] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:07:15] [INFO ] Invariant cache hit.
[2024-05-27 04:07:17] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:07:19] [INFO ] Implicit Places using invariants and state equation in 4011 ms returned []
Implicit Place search using SMT with State Equation took 5459 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-05-27 04:07:19] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:07:19] [INFO ] Invariant cache hit.
[2024-05-27 04:07:19] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 31570ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 31659ms
Finished structural reductions in LTL mode , in 1 iterations and 37248 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Support contains 1276 out of 1330 places after structural reductions.
[2024-05-27 04:07:51] [INFO ] Flatten gal took : 259 ms
[2024-05-27 04:07:52] [INFO ] Flatten gal took : 139 ms
[2024-05-27 04:07:52] [INFO ] Input system was already deterministic with 2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 2930 ms. (13 steps per ms) remains 2/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 894 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
[2024-05-27 04:07:53] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:07:53] [INFO ] Invariant cache hit.
[2024-05-27 04:07:53] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/588 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 688/1276 variables, 9/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1276 variables, 688/1285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1276 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/1281 variables, 5/1290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1281 variables, 5/1295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1281 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/1288 variables, 7/1302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1288 variables, 7/1309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1288 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1820/3108 variables, 1288/2597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3108 variables, 330/2927 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3108 variables, 0/2927 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 42/3150 variables, 42/2969 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3150 variables, 42/3011 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3150 variables, 6/3017 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3150 variables, 0/3017 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/3150 variables, 0/3017 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3150/3150 variables, and 3017 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3240 ms.
Refiners :[Domain max(s): 1330/1330 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1330/1330 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/588 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 688/1276 variables, 9/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1276 variables, 688/1285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1276 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/1281 variables, 5/1290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1281 variables, 5/1295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1281 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/1288 variables, 7/1302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1288 variables, 7/1309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1288 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1820/3108 variables, 1288/2597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3108 variables, 330/2927 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3108 variables, 1/2928 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3108 variables, 0/2928 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 42/3150 variables, 42/2970 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3150 variables, 42/3012 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3150 variables, 6/3018 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3150 variables, 0/3018 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/3150 variables, 0/3018 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3150/3150 variables, and 3018 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3286 ms.
Refiners :[Domain max(s): 1330/1330 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1330/1330 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 6754ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 429 ms.
Support contains 588 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1330 transition count 1988
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 1288 transition count 1988
Applied a total of 84 rules in 226 ms. Remains 1288 /1330 variables (removed 42) and now considering 1988/2030 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 1288/1330 places, 1988/2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 982 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 634 ms. (62 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 129560 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 2
Probabilistic random walk after 129560 steps, saw 79800 distinct states, run finished after 3010 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-27 04:08:04] [INFO ] Flow matrix only has 1778 transitions (discarded 210 similar events)
// Phase 1: matrix 1778 rows 1288 cols
[2024-05-27 04:08:04] [INFO ] Computed 27 invariants in 10 ms
[2024-05-27 04:08:04] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/588 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 645/1233 variables, 8/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1233 variables, 645/1241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1233 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/1239 variables, 6/1247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1239 variables, 6/1253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1239 variables, 0/1253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/1246 variables, 7/1260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1246 variables, 7/1267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1246 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1778/3024 variables, 1246/2513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3024 variables, 330/2843 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3024 variables, 0/2843 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 42/3066 variables, 42/2885 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3066 variables, 42/2927 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3066 variables, 6/2933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3066 variables, 0/2933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/3066 variables, 0/2933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3066/3066 variables, and 2933 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3290 ms.
Refiners :[Domain max(s): 1288/1288 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1288/1288 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/588 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 645/1233 variables, 8/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1233 variables, 645/1241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1233 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/1239 variables, 6/1247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1239 variables, 6/1253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1239 variables, 0/1253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/1246 variables, 7/1260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1246 variables, 7/1267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1246 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1778/3024 variables, 1246/2513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3024 variables, 330/2843 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3024 variables, 1/2844 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3024 variables, 0/2844 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 42/3066 variables, 42/2886 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3066 variables, 42/2928 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3066 variables, 6/2934 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 04:08:12] [INFO ] Deduced a trap composed of 22 places in 1178 ms of which 100 ms to minimize.
[2024-05-27 04:08:13] [INFO ] Deduced a trap composed of 26 places in 1405 ms of which 11 ms to minimize.
[2024-05-27 04:08:14] [INFO ] Deduced a trap composed of 12 places in 1060 ms of which 11 ms to minimize.
[2024-05-27 04:08:16] [INFO ] Deduced a trap composed of 24 places in 1090 ms of which 12 ms to minimize.
[2024-05-27 04:08:17] [INFO ] Deduced a trap composed of 12 places in 995 ms of which 10 ms to minimize.
[2024-05-27 04:08:18] [INFO ] Deduced a trap composed of 12 places in 929 ms of which 11 ms to minimize.
[2024-05-27 04:08:19] [INFO ] Deduced a trap composed of 12 places in 1079 ms of which 10 ms to minimize.
[2024-05-27 04:08:20] [INFO ] Deduced a trap composed of 26 places in 988 ms of which 12 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/3066 variables, 8/2942 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3066 variables, 0/2942 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/3066 variables, 0/2942 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3066/3066 variables, and 2942 constraints, problems are : Problem set: 0 solved, 2 unsolved in 13851 ms.
Refiners :[Domain max(s): 1288/1288 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1288/1288 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 17260ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 75 ms.
Support contains 1 out of 1288 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1288/1288 places, 1988/1988 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 543 transitions
Trivial Post-agglo rules discarded 543 transitions
Performed 543 trivial Post agglomeration. Transition count delta: 543
Iterating post reduction 0 with 543 rules applied. Total rules applied 543 place count 1288 transition count 1445
Reduce places removed 543 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 544 rules applied. Total rules applied 1087 place count 745 transition count 1444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1088 place count 744 transition count 1444
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 294 Pre rules applied. Total rules applied 1088 place count 744 transition count 1150
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 3 with 588 rules applied. Total rules applied 1676 place count 450 transition count 1150
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1760 place count 408 transition count 1108
Applied a total of 1760 rules in 159 ms. Remains 408 /1288 variables (removed 880) and now considering 1108/1988 (removed 880) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 408/1288 places, 1108/1988 transitions.
RANDOM walk for 40000 steps (8 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 710312 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :0 out of 1
Probabilistic random walk after 710312 steps, saw 92982 distinct states, run finished after 3002 ms. (steps per millisecond=236 ) properties seen :0
[2024-05-27 04:08:25] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 408 cols
[2024-05-27 04:08:25] [INFO ] Computed 27 invariants in 7 ms
[2024-05-27 04:08:25] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 51/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/54 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 130/184 variables, 54/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 258/442 variables, 42/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/442 variables, 42/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/442 variables, 6/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/442 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 432/874 variables, 72/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/874 variables, 72/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/874 variables, 318/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/874 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 228/1102 variables, 6/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1102 variables, 228/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1102 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 6/1108 variables, 6/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1108 variables, 6/921 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1108 variables, 0/921 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/1114 variables, 6/927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1114 variables, 6/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1114 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 192/1306 variables, 240/1173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1306 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/1306 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1306/1306 variables, and 1173 constraints, problems are : Problem set: 0 solved, 1 unsolved in 796 ms.
Refiners :[Domain max(s): 408/408 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 408/408 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 51/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/54 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 130/184 variables, 54/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/184 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 258/442 variables, 42/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/442 variables, 42/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/442 variables, 6/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/442 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 432/874 variables, 72/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/874 variables, 72/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/874 variables, 318/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/874 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 228/1102 variables, 6/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1102 variables, 228/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1102 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 6/1108 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1108 variables, 6/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1108 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 6/1114 variables, 6/928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1114 variables, 6/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:08:26] [INFO ] Deduced a trap composed of 19 places in 343 ms of which 4 ms to minimize.
[2024-05-27 04:08:27] [INFO ] Deduced a trap composed of 42 places in 305 ms of which 4 ms to minimize.
[2024-05-27 04:08:27] [INFO ] Deduced a trap composed of 37 places in 449 ms of which 8 ms to minimize.
[2024-05-27 04:08:28] [INFO ] Deduced a trap composed of 76 places in 350 ms of which 6 ms to minimize.
[2024-05-27 04:08:28] [INFO ] Deduced a trap composed of 78 places in 500 ms of which 6 ms to minimize.
[2024-05-27 04:08:29] [INFO ] Deduced a trap composed of 10 places in 542 ms of which 6 ms to minimize.
[2024-05-27 04:08:29] [INFO ] Deduced a trap composed of 14 places in 469 ms of which 6 ms to minimize.
[2024-05-27 04:08:30] [INFO ] Deduced a trap composed of 20 places in 523 ms of which 6 ms to minimize.
[2024-05-27 04:08:30] [INFO ] Deduced a trap composed of 21 places in 537 ms of which 7 ms to minimize.
[2024-05-27 04:08:30] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 4 ms to minimize.
[2024-05-27 04:08:31] [INFO ] Deduced a trap composed of 11 places in 329 ms of which 5 ms to minimize.
[2024-05-27 04:08:31] [INFO ] Deduced a trap composed of 38 places in 247 ms of which 4 ms to minimize.
[2024-05-27 04:08:31] [INFO ] Deduced a trap composed of 40 places in 337 ms of which 4 ms to minimize.
[2024-05-27 04:08:32] [INFO ] Deduced a trap composed of 13 places in 364 ms of which 7 ms to minimize.
[2024-05-27 04:08:32] [INFO ] Deduced a trap composed of 13 places in 431 ms of which 4 ms to minimize.
[2024-05-27 04:08:33] [INFO ] Deduced a trap composed of 15 places in 331 ms of which 4 ms to minimize.
[2024-05-27 04:08:33] [INFO ] Deduced a trap composed of 54 places in 296 ms of which 3 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1114 variables, 17/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1114 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 192/1306 variables, 240/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1306 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/1306 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1306/1306 variables, and 1191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7802 ms.
Refiners :[Domain max(s): 408/408 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 408/408 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
After SMT, in 8625ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 1108/1108 transitions.
Applied a total of 0 rules in 29 ms. Remains 408 /408 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 408/408 places, 1108/1108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 1108/1108 transitions.
Applied a total of 0 rules in 26 ms. Remains 408 /408 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
[2024-05-27 04:08:33] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2024-05-27 04:08:33] [INFO ] Invariant cache hit.
[2024-05-27 04:08:34] [INFO ] Implicit Places using invariants in 572 ms returned [389, 390, 392, 400, 401, 402, 403]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 575 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 401/408 places, 1108/1108 transitions.
Applied a total of 0 rules in 23 ms. Remains 401 /401 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 626 ms. Remains : 401/408 places, 1108/1108 transitions.
RANDOM walk for 40000 steps (8 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 738736 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :0 out of 1
Probabilistic random walk after 738736 steps, saw 99783 distinct states, run finished after 3003 ms. (steps per millisecond=245 ) properties seen :0
[2024-05-27 04:08:37] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 401 cols
[2024-05-27 04:08:37] [INFO ] Computed 20 invariants in 8 ms
[2024-05-27 04:08:37] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 51/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 130/183 variables, 53/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 12/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/441 variables, 42/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 42/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 6/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/873 variables, 72/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/873 variables, 72/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 318/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1101 variables, 6/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1101 variables, 228/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1101 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1107 variables, 6/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1107 variables, 6/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1107 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1299 variables, 234/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1299 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1299 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1299/1299 variables, and 1152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 692 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 401/401 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 51/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 130/183 variables, 53/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 12/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 258/441 variables, 42/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 42/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 6/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/441 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 432/873 variables, 72/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 72/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 318/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/873 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 228/1101 variables, 6/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1101 variables, 228/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:08:39] [INFO ] Deduced a trap composed of 30 places in 509 ms of which 6 ms to minimize.
[2024-05-27 04:08:39] [INFO ] Deduced a trap composed of 29 places in 516 ms of which 6 ms to minimize.
[2024-05-27 04:08:40] [INFO ] Deduced a trap composed of 21 places in 521 ms of which 6 ms to minimize.
[2024-05-27 04:08:40] [INFO ] Deduced a trap composed of 39 places in 501 ms of which 6 ms to minimize.
[2024-05-27 04:08:41] [INFO ] Deduced a trap composed of 29 places in 413 ms of which 6 ms to minimize.
[2024-05-27 04:08:41] [INFO ] Deduced a trap composed of 66 places in 532 ms of which 6 ms to minimize.
[2024-05-27 04:08:42] [INFO ] Deduced a trap composed of 51 places in 532 ms of which 6 ms to minimize.
[2024-05-27 04:08:43] [INFO ] Deduced a trap composed of 14 places in 503 ms of which 6 ms to minimize.
[2024-05-27 04:08:43] [INFO ] Deduced a trap composed of 31 places in 492 ms of which 6 ms to minimize.
[2024-05-27 04:08:44] [INFO ] Deduced a trap composed of 10 places in 483 ms of which 8 ms to minimize.
[2024-05-27 04:08:44] [INFO ] Deduced a trap composed of 12 places in 480 ms of which 6 ms to minimize.
[2024-05-27 04:08:45] [INFO ] Deduced a trap composed of 11 places in 504 ms of which 6 ms to minimize.
[2024-05-27 04:08:45] [INFO ] Deduced a trap composed of 13 places in 451 ms of which 6 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1101 variables, 13/920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1101 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/1107 variables, 6/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1107 variables, 6/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1107 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 192/1299 variables, 234/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1299 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1299 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1299/1299 variables, and 1166 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7766 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 401/401 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 8485ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 1108/1108 transitions.
Applied a total of 0 rules in 37 ms. Remains 401 /401 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 401/401 places, 1108/1108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 1108/1108 transitions.
Applied a total of 0 rules in 32 ms. Remains 401 /401 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
[2024-05-27 04:08:46] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2024-05-27 04:08:46] [INFO ] Invariant cache hit.
[2024-05-27 04:08:46] [INFO ] Implicit Places using invariants in 733 ms returned []
[2024-05-27 04:08:46] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2024-05-27 04:08:46] [INFO ] Invariant cache hit.
[2024-05-27 04:08:47] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:08:49] [INFO ] Implicit Places using invariants and state equation in 2605 ms returned []
Implicit Place search using SMT with State Equation took 3340 ms to find 0 implicit places.
[2024-05-27 04:08:49] [INFO ] Redundant transitions in 81 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-05-27 04:08:49] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2024-05-27 04:08:49] [INFO ] Invariant cache hit.
[2024-05-27 04:08:49] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 401/401 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 20/421 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-27 04:09:04] [INFO ] Deduced a trap composed of 13 places in 425 ms of which 6 ms to minimize.
[2024-05-27 04:09:04] [INFO ] Deduced a trap composed of 50 places in 343 ms of which 4 ms to minimize.
[2024-05-27 04:09:05] [INFO ] Deduced a trap composed of 31 places in 356 ms of which 4 ms to minimize.
[2024-05-27 04:09:05] [INFO ] Deduced a trap composed of 63 places in 321 ms of which 4 ms to minimize.
[2024-05-27 04:09:05] [INFO ] Deduced a trap composed of 40 places in 319 ms of which 4 ms to minimize.
[2024-05-27 04:09:06] [INFO ] Deduced a trap composed of 18 places in 314 ms of which 4 ms to minimize.
[2024-05-27 04:09:06] [INFO ] Deduced a trap composed of 22 places in 340 ms of which 4 ms to minimize.
[2024-05-27 04:09:06] [INFO ] Deduced a trap composed of 19 places in 337 ms of which 5 ms to minimize.
[2024-05-27 04:09:07] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 3 ms to minimize.
[2024-05-27 04:09:07] [INFO ] Deduced a trap composed of 29 places in 272 ms of which 4 ms to minimize.
[2024-05-27 04:09:07] [INFO ] Deduced a trap composed of 63 places in 261 ms of which 3 ms to minimize.
[2024-05-27 04:09:07] [INFO ] Deduced a trap composed of 54 places in 237 ms of which 3 ms to minimize.
[2024-05-27 04:09:08] [INFO ] Deduced a trap composed of 60 places in 251 ms of which 4 ms to minimize.
[2024-05-27 04:09:08] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 3 ms to minimize.
[2024-05-27 04:09:08] [INFO ] Deduced a trap composed of 54 places in 220 ms of which 3 ms to minimize.
[2024-05-27 04:09:08] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 3 ms to minimize.
[2024-05-27 04:09:09] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 4 ms to minimize.
[2024-05-27 04:09:09] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 3 ms to minimize.
[2024-05-27 04:09:09] [INFO ] Deduced a trap composed of 77 places in 206 ms of which 3 ms to minimize.
[2024-05-27 04:09:09] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/441 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-27 04:09:10] [INFO ] Deduced a trap composed of 20 places in 365 ms of which 4 ms to minimize.
[2024-05-27 04:09:11] [INFO ] Deduced a trap composed of 10 places in 269 ms of which 4 ms to minimize.
[2024-05-27 04:09:11] [INFO ] Deduced a trap composed of 10 places in 436 ms of which 6 ms to minimize.
[2024-05-27 04:09:12] [INFO ] Deduced a trap composed of 13 places in 524 ms of which 6 ms to minimize.
[2024-05-27 04:09:12] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 6 ms to minimize.
[2024-05-27 04:09:13] [INFO ] Deduced a trap composed of 10 places in 542 ms of which 7 ms to minimize.
[2024-05-27 04:09:13] [INFO ] Deduced a trap composed of 35 places in 373 ms of which 4 ms to minimize.
[2024-05-27 04:09:14] [INFO ] Deduced a trap composed of 20 places in 511 ms of which 6 ms to minimize.
[2024-05-27 04:09:14] [INFO ] Deduced a trap composed of 20 places in 522 ms of which 13 ms to minimize.
[2024-05-27 04:09:15] [INFO ] Deduced a trap composed of 26 places in 502 ms of which 6 ms to minimize.
[2024-05-27 04:09:15] [INFO ] Deduced a trap composed of 18 places in 324 ms of which 4 ms to minimize.
[2024-05-27 04:09:15] [INFO ] Deduced a trap composed of 13 places in 315 ms of which 4 ms to minimize.
[2024-05-27 04:09:16] [INFO ] Deduced a trap composed of 10 places in 342 ms of which 6 ms to minimize.
[2024-05-27 04:09:16] [INFO ] Deduced a trap composed of 18 places in 294 ms of which 4 ms to minimize.
[2024-05-27 04:09:16] [INFO ] Deduced a trap composed of 79 places in 313 ms of which 4 ms to minimize.
[2024-05-27 04:09:17] [INFO ] Deduced a trap composed of 38 places in 334 ms of which 6 ms to minimize.
[2024-05-27 04:09:17] [INFO ] Deduced a trap composed of 59 places in 461 ms of which 6 ms to minimize.
[2024-05-27 04:09:17] [INFO ] Deduced a trap composed of 20 places in 297 ms of which 4 ms to minimize.
[2024-05-27 04:09:18] [INFO ] Deduced a trap composed of 21 places in 363 ms of which 6 ms to minimize.
[2024-05-27 04:09:18] [INFO ] Deduced a trap composed of 54 places in 272 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/461 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1299 variables, and 461 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30027 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/401 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 401/401 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 20/421 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 40/461 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-27 04:09:22] [INFO ] Deduced a trap composed of 19 places in 313 ms of which 5 ms to minimize.
[2024-05-27 04:09:23] [INFO ] Deduced a trap composed of 36 places in 295 ms of which 5 ms to minimize.
[2024-05-27 04:09:23] [INFO ] Deduced a trap composed of 34 places in 458 ms of which 5 ms to minimize.
[2024-05-27 04:09:23] [INFO ] Deduced a trap composed of 34 places in 294 ms of which 4 ms to minimize.
[2024-05-27 04:09:24] [INFO ] Deduced a trap composed of 46 places in 350 ms of which 5 ms to minimize.
[2024-05-27 04:09:24] [INFO ] Deduced a trap composed of 46 places in 282 ms of which 4 ms to minimize.
[2024-05-27 04:09:24] [INFO ] Deduced a trap composed of 53 places in 282 ms of which 4 ms to minimize.
[2024-05-27 04:09:25] [INFO ] Deduced a trap composed of 30 places in 439 ms of which 5 ms to minimize.
[2024-05-27 04:09:25] [INFO ] Deduced a trap composed of 27 places in 287 ms of which 4 ms to minimize.
[2024-05-27 04:09:25] [INFO ] Deduced a trap composed of 37 places in 302 ms of which 4 ms to minimize.
[2024-05-27 04:09:26] [INFO ] Deduced a trap composed of 45 places in 458 ms of which 6 ms to minimize.
[2024-05-27 04:09:26] [INFO ] Deduced a trap composed of 43 places in 278 ms of which 3 ms to minimize.
[2024-05-27 04:09:27] [INFO ] Deduced a trap composed of 42 places in 446 ms of which 5 ms to minimize.
[2024-05-27 04:09:27] [INFO ] Deduced a trap composed of 28 places in 439 ms of which 6 ms to minimize.
[2024-05-27 04:09:27] [INFO ] Deduced a trap composed of 28 places in 270 ms of which 4 ms to minimize.
[2024-05-27 04:09:28] [INFO ] Deduced a trap composed of 29 places in 268 ms of which 5 ms to minimize.
[2024-05-27 04:09:28] [INFO ] Deduced a trap composed of 46 places in 316 ms of which 5 ms to minimize.
[2024-05-27 04:09:28] [INFO ] Deduced a trap composed of 44 places in 271 ms of which 4 ms to minimize.
[2024-05-27 04:09:29] [INFO ] Deduced a trap composed of 35 places in 303 ms of which 5 ms to minimize.
[2024-05-27 04:09:29] [INFO ] Deduced a trap composed of 33 places in 354 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/481 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-27 04:09:30] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 3 ms to minimize.
[2024-05-27 04:09:31] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 3 ms to minimize.
[2024-05-27 04:09:31] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 4 ms to minimize.
[2024-05-27 04:09:31] [INFO ] Deduced a trap composed of 45 places in 262 ms of which 4 ms to minimize.
[2024-05-27 04:09:31] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 4 ms to minimize.
[2024-05-27 04:09:32] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 5 ms to minimize.
[2024-05-27 04:09:32] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 3 ms to minimize.
[2024-05-27 04:09:32] [INFO ] Deduced a trap composed of 54 places in 282 ms of which 3 ms to minimize.
[2024-05-27 04:09:33] [INFO ] Deduced a trap composed of 67 places in 289 ms of which 4 ms to minimize.
[2024-05-27 04:09:33] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 4 ms to minimize.
[2024-05-27 04:09:33] [INFO ] Deduced a trap composed of 28 places in 395 ms of which 5 ms to minimize.
[2024-05-27 04:09:34] [INFO ] Deduced a trap composed of 23 places in 377 ms of which 5 ms to minimize.
[2024-05-27 04:09:34] [INFO ] Deduced a trap composed of 19 places in 405 ms of which 5 ms to minimize.
[2024-05-27 04:09:35] [INFO ] Deduced a trap composed of 21 places in 413 ms of which 7 ms to minimize.
[2024-05-27 04:09:35] [INFO ] Deduced a trap composed of 31 places in 303 ms of which 4 ms to minimize.
[2024-05-27 04:09:35] [INFO ] Deduced a trap composed of 29 places in 312 ms of which 4 ms to minimize.
[2024-05-27 04:09:36] [INFO ] Deduced a trap composed of 31 places in 320 ms of which 4 ms to minimize.
[2024-05-27 04:09:36] [INFO ] Deduced a trap composed of 29 places in 352 ms of which 4 ms to minimize.
[2024-05-27 04:09:36] [INFO ] Deduced a trap composed of 27 places in 386 ms of which 5 ms to minimize.
[2024-05-27 04:09:37] [INFO ] Deduced a trap composed of 29 places in 445 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/501 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-27 04:09:39] [INFO ] Deduced a trap composed of 18 places in 337 ms of which 6 ms to minimize.
[2024-05-27 04:09:39] [INFO ] Deduced a trap composed of 19 places in 447 ms of which 5 ms to minimize.
[2024-05-27 04:09:40] [INFO ] Deduced a trap composed of 23 places in 417 ms of which 5 ms to minimize.
[2024-05-27 04:09:40] [INFO ] Deduced a trap composed of 37 places in 377 ms of which 5 ms to minimize.
[2024-05-27 04:09:40] [INFO ] Deduced a trap composed of 46 places in 214 ms of which 3 ms to minimize.
[2024-05-27 04:09:41] [INFO ] Deduced a trap composed of 38 places in 304 ms of which 5 ms to minimize.
[2024-05-27 04:09:41] [INFO ] Deduced a trap composed of 45 places in 233 ms of which 4 ms to minimize.
[2024-05-27 04:09:41] [INFO ] Deduced a trap composed of 30 places in 336 ms of which 4 ms to minimize.
[2024-05-27 04:09:42] [INFO ] Deduced a trap composed of 10 places in 497 ms of which 6 ms to minimize.
[2024-05-27 04:09:42] [INFO ] Deduced a trap composed of 19 places in 388 ms of which 5 ms to minimize.
[2024-05-27 04:09:43] [INFO ] Deduced a trap composed of 19 places in 343 ms of which 4 ms to minimize.
[2024-05-27 04:09:43] [INFO ] Deduced a trap composed of 36 places in 394 ms of which 5 ms to minimize.
[2024-05-27 04:09:44] [INFO ] Deduced a trap composed of 30 places in 383 ms of which 5 ms to minimize.
[2024-05-27 04:09:44] [INFO ] Deduced a trap composed of 21 places in 388 ms of which 5 ms to minimize.
[2024-05-27 04:09:44] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 3 ms to minimize.
[2024-05-27 04:09:45] [INFO ] Deduced a trap composed of 35 places in 408 ms of which 6 ms to minimize.
[2024-05-27 04:09:45] [INFO ] Deduced a trap composed of 21 places in 398 ms of which 6 ms to minimize.
[2024-05-27 04:09:45] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 3 ms to minimize.
[2024-05-27 04:09:45] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 3 ms to minimize.
[2024-05-27 04:09:46] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/521 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-27 04:09:48] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 4 ms to minimize.
[2024-05-27 04:09:49] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 2 ms to minimize.
[2024-05-27 04:09:49] [INFO ] Deduced a trap composed of 55 places in 200 ms of which 4 ms to minimize.
[2024-05-27 04:09:49] [INFO ] Deduced a trap composed of 47 places in 240 ms of which 4 ms to minimize.
[2024-05-27 04:09:50] [INFO ] Deduced a trap composed of 52 places in 404 ms of which 8 ms to minimize.
SMT process timed out in 60584ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 60599ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64066 ms. Remains : 401/401 places, 1108/1108 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 588 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 29 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:09:50] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-27 04:09:50] [INFO ] Computed 27 invariants in 17 ms
[2024-05-27 04:09:51] [INFO ] Implicit Places using invariants in 902 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 905 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 16 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 952 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 1504 ms.
Stack based approach found an accepted trace after 252 steps with 0 reset with depth 253 and stack size 253 in 4 ms.
FORMULA Peterson-PT-6-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLCardinality-00 finished in 2863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||G(p1))) U X(X(p2)))))'
Support contains 595 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 18 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:09:53] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:09:53] [INFO ] Invariant cache hit.
[2024-05-27 04:09:54] [INFO ] Implicit Places using invariants in 742 ms returned []
[2024-05-27 04:09:54] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:09:54] [INFO ] Invariant cache hit.
[2024-05-27 04:09:55] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:09:58] [INFO ] Implicit Places using invariants and state equation in 3921 ms returned []
Implicit Place search using SMT with State Equation took 4666 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-05-27 04:09:58] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:09:58] [INFO ] Invariant cache hit.
[2024-05-27 04:09:58] [INFO ] State equation strengthened by 330 read => feed constraints.
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 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30739ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30763ms
Finished structural reductions in LTL mode , in 1 iterations and 35453 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 451 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-01
Product exploration explored 100000 steps with 26778 reset in 1580 ms.
Product exploration explored 100000 steps with 26742 reset in 1144 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 393 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
RANDOM walk for 36068 steps (8 resets) in 1104 ms. (32 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 p2))), (F (NOT (OR p1 p0))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 450 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 411 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 393 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 595 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 30 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:10:34] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:10:34] [INFO ] Invariant cache hit.
[2024-05-27 04:10:35] [INFO ] Implicit Places using invariants in 886 ms returned []
[2024-05-27 04:10:35] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:10:35] [INFO ] Invariant cache hit.
[2024-05-27 04:10:36] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:10:39] [INFO ] Implicit Places using invariants and state equation in 4068 ms returned []
Implicit Place search using SMT with State Equation took 4959 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-05-27 04:10:39] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:10:39] [INFO ] Invariant cache hit.
[2024-05-27 04:10:39] [INFO ] State equation strengthened by 330 read => feed constraints.
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 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30919ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30942ms
Finished structural reductions in LTL mode , in 1 iterations and 35936 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 217 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
RANDOM walk for 21500 steps (5 resets) in 487 ms. (44 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 p2))), (F (NOT (OR p1 p0))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 437 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 403 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 368 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 366 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 26764 reset in 1497 ms.
Product exploration explored 100000 steps with 26732 reset in 967 ms.
Applying partial POR strategy [false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 331 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 595 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1330 transition count 2030
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 252 place count 1330 transition count 2030
Deduced a syphon composed of 301 places in 2 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 301 place count 1330 transition count 2030
Deduced a syphon composed of 301 places in 1 ms
Applied a total of 301 rules in 246 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:11:16] [INFO ] Redundant transitions in 112 ms returned []
Running 2023 sub problems to find dead transitions.
[2024-05-27 04:11:16] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-27 04:11:16] [INFO ] Computed 27 invariants in 17 ms
[2024-05-27 04:11:16] [INFO ] State equation strengthened by 330 read => feed constraints.
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 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30887ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30922ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1330/1330 places, 2030/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31297 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Built C files in :
/tmp/ltsmin9574951051111469489
[2024-05-27 04:11:47] [INFO ] Built C files in 120ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9574951051111469489
Running compilation step : cd /tmp/ltsmin9574951051111469489;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin9574951051111469489;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin9574951051111469489;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
Support contains 595 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 24 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:11:50] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-27 04:11:50] [INFO ] Computed 27 invariants in 8 ms
[2024-05-27 04:11:51] [INFO ] Implicit Places using invariants in 723 ms returned []
[2024-05-27 04:11:51] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:11:51] [INFO ] Invariant cache hit.
[2024-05-27 04:11:52] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:11:55] [INFO ] Implicit Places using invariants and state equation in 4445 ms returned []
Implicit Place search using SMT with State Equation took 5171 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-05-27 04:11:55] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:11:55] [INFO ] Invariant cache hit.
[2024-05-27 04:11:55] [INFO ] State equation strengthened by 330 read => feed constraints.
(s1155 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
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 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30881ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30908ms
Finished structural reductions in LTL mode , in 1 iterations and 36109 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Built C files in :
/tmp/ltsmin14574143853418851851
[2024-05-27 04:12:26] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14574143853418851851
Running compilation step : cd /tmp/ltsmin14574143853418851851;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin14574143853418851851;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin14574143853418851851;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
[2024-05-27 04:12:30] [INFO ] Flatten gal took : 153 ms
[2024-05-27 04:12:30] [INFO ] Flatten gal took : 140 ms
[2024-05-27 04:12:30] [INFO ] Time to serialize gal into /tmp/LTL4704693938279111229.gal : 28 ms
[2024-05-27 04:12:30] [INFO ] Time to serialize properties into /tmp/LTL10732023826385865193.prop : 4 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4704693938279111229.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11840744384977336397.hoa' '-atoms' '/tmp/LTL10732023826385865193.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10732023826385865193.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11840744384977336397.hoa
Detected timeout of ITS tools.
[2024-05-27 04:12:45] [INFO ] Flatten gal took : 74 ms
[2024-05-27 04:12:45] [INFO ] Flatten gal took : 70 ms
[2024-05-27 04:12:45] [INFO ] Time to serialize gal into /tmp/LTL1853008520158875342.gal : 16 ms
[2024-05-27 04:12:45] [INFO ] Time to serialize properties into /tmp/LTL17939325391991157108.ltl : 7 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1853008520158875342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17939325391991157108.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F(("(((((((AskForSection_2_3+AskForSection_1_3)+(AskForSection_0_3+AskForSection_6_2))+((AskForSection_6_3+AskForSection_5_3)+(A...15323
Formula 0 simplified : F(G(!"(((((((AskForSection_2_3+AskForSection_1_3)+(AskForSection_0_3+AskForSection_6_2))+((AskForSection_6_3+AskForSection_5_3)+(Ask...15312
Detected timeout of ITS tools.
[2024-05-27 04:13:00] [INFO ] Flatten gal took : 64 ms
[2024-05-27 04:13:00] [INFO ] Applying decomposition
[2024-05-27 04:13:00] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6291654244982694452.txt' '-o' '/tmp/graph6291654244982694452.bin' '-w' '/tmp/graph6291654244982694452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6291654244982694452.bin' '-l' '-1' '-v' '-w' '/tmp/graph6291654244982694452.weights' '-q' '0' '-e' '0.001'
[2024-05-27 04:13:01] [INFO ] Decomposing Gal with order
[2024-05-27 04:13:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 04:13:04] [INFO ] Removed a total of 1623 redundant transitions.
[2024-05-27 04:13:04] [INFO ] Flatten gal took : 2346 ms
[2024-05-27 04:13:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 1112 labels/synchronizations in 213 ms.
[2024-05-27 04:13:05] [INFO ] Time to serialize gal into /tmp/LTL8583077597258578470.gal : 26 ms
[2024-05-27 04:13:05] [INFO ] Time to serialize properties into /tmp/LTL13580474541812003050.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8583077597258578470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13580474541812003050.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F(("(((((((gu172.AskForSection_2_3+gu172.AskForSection_1_3)+(gu172.AskForSection_0_3+gu172.AskForSection_6_2))+((gu172.AskForSec...20993
Formula 0 simplified : F(G(!"(((((((gu172.AskForSection_2_3+gu172.AskForSection_1_3)+(gu172.AskForSection_0_3+gu172.AskForSection_6_2))+((gu172.AskForSecti...20982
Detected timeout of ITS tools.
Treatment of property Peterson-PT-6-LTLCardinality-01 finished in 206764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(((X(p0)&&F(p1)) U p2))) U p3)))'
Support contains 602 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 32 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:13:20] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:13:20] [INFO ] Invariant cache hit.
[2024-05-27 04:13:20] [INFO ] Implicit Places using invariants in 706 ms returned []
[2024-05-27 04:13:20] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:13:20] [INFO ] Invariant cache hit.
[2024-05-27 04:13:22] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:13:24] [INFO ] Implicit Places using invariants and state equation in 3122 ms returned []
Implicit Place search using SMT with State Equation took 3831 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-05-27 04:13:24] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:13:24] [INFO ] Invariant cache hit.
[2024-05-27 04:13:24] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30680ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30701ms
Finished structural reductions in LTL mode , in 1 iterations and 34568 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p3), (NOT p3), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 1253 ms.
Product exploration explored 100000 steps with 50000 reset in 1257 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 p2 p1 p0), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 28 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-6-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-6-LTLCardinality-02 finished in 37429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)&&G(p1))))))'
Support contains 882 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 10 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:13:57] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:13:57] [INFO ] Invariant cache hit.
[2024-05-27 04:13:58] [INFO ] Implicit Places using invariants in 606 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 612 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 9 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 632 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLCardinality-03 finished in 874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 49 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 582 transitions
Trivial Post-agglo rules discarded 582 transitions
Performed 582 trivial Post agglomeration. Transition count delta: 582
Iterating post reduction 0 with 582 rules applied. Total rules applied 582 place count 1330 transition count 1448
Reduce places removed 582 places and 0 transitions.
Iterating post reduction 1 with 582 rules applied. Total rules applied 1164 place count 748 transition count 1448
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 258 Pre rules applied. Total rules applied 1164 place count 748 transition count 1190
Deduced a syphon composed of 258 places in 0 ms
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 2 with 516 rules applied. Total rules applied 1680 place count 490 transition count 1190
Applied a total of 1680 rules in 73 ms. Remains 490 /1330 variables (removed 840) and now considering 1190/2030 (removed 840) transitions.
[2024-05-27 04:13:58] [INFO ] Flow matrix only has 980 transitions (discarded 210 similar events)
// Phase 1: matrix 980 rows 490 cols
[2024-05-27 04:13:58] [INFO ] Computed 27 invariants in 3 ms
[2024-05-27 04:13:59] [INFO ] Implicit Places using invariants in 526 ms returned [429, 430, 432, 461, 462, 463, 464]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 530 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 483/1330 places, 1190/2030 transitions.
Applied a total of 0 rules in 23 ms. Remains 483 /483 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 629 ms. Remains : 483/1330 places, 1190/2030 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 388 ms.
Stack based approach found an accepted trace after 197 steps with 0 reset with depth 198 and stack size 179 in 2 ms.
FORMULA Peterson-PT-6-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLCardinality-05 finished in 1169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(G(p1)))))'
Support contains 56 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 64 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:13:59] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-27 04:13:59] [INFO ] Computed 27 invariants in 8 ms
[2024-05-27 04:14:00] [INFO ] Implicit Places using invariants in 1004 ms returned []
[2024-05-27 04:14:00] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:14:00] [INFO ] Invariant cache hit.
[2024-05-27 04:14:01] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:14:08] [INFO ] Implicit Places using invariants and state equation in 7436 ms returned []
Implicit Place search using SMT with State Equation took 8449 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-05-27 04:14:08] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:14:08] [INFO ] Invariant cache hit.
[2024-05-27 04:14:08] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30703ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30723ms
Finished structural reductions in LTL mode , in 1 iterations and 39243 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLCardinality-06 finished in 39425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 84 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 582 transitions
Trivial Post-agglo rules discarded 582 transitions
Performed 582 trivial Post agglomeration. Transition count delta: 582
Iterating post reduction 0 with 582 rules applied. Total rules applied 582 place count 1330 transition count 1448
Reduce places removed 582 places and 0 transitions.
Iterating post reduction 1 with 582 rules applied. Total rules applied 1164 place count 748 transition count 1448
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 258 Pre rules applied. Total rules applied 1164 place count 748 transition count 1190
Deduced a syphon composed of 258 places in 0 ms
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 2 with 516 rules applied. Total rules applied 1680 place count 490 transition count 1190
Applied a total of 1680 rules in 68 ms. Remains 490 /1330 variables (removed 840) and now considering 1190/2030 (removed 840) transitions.
[2024-05-27 04:14:39] [INFO ] Flow matrix only has 980 transitions (discarded 210 similar events)
// Phase 1: matrix 980 rows 490 cols
[2024-05-27 04:14:39] [INFO ] Computed 27 invariants in 3 ms
[2024-05-27 04:14:39] [INFO ] Implicit Places using invariants in 468 ms returned [429, 430, 432, 461, 462, 463, 464]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 471 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 483/1330 places, 1190/2030 transitions.
Applied a total of 0 rules in 18 ms. Remains 483 /483 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 558 ms. Remains : 483/1330 places, 1190/2030 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-07
Product exploration explored 100000 steps with 8067 reset in 663 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA Peterson-PT-6-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLCardinality-07 finished in 1308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 3 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 585 rules applied. Total rules applied 585 place count 1330 transition count 1445
Reduce places removed 585 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 586 rules applied. Total rules applied 1171 place count 745 transition count 1444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1172 place count 744 transition count 1444
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 294 Pre rules applied. Total rules applied 1172 place count 744 transition count 1150
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 3 with 588 rules applied. Total rules applied 1760 place count 450 transition count 1150
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1844 place count 408 transition count 1108
Applied a total of 1844 rules in 71 ms. Remains 408 /1330 variables (removed 922) and now considering 1108/2030 (removed 922) transitions.
[2024-05-27 04:14:40] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 408 cols
[2024-05-27 04:14:40] [INFO ] Computed 27 invariants in 2 ms
[2024-05-27 04:14:40] [INFO ] Implicit Places using invariants in 516 ms returned [389, 392, 400, 401, 402, 403]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 520 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 402/1330 places, 1108/2030 transitions.
Applied a total of 0 rules in 25 ms. Remains 402 /402 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 617 ms. Remains : 402/1330 places, 1108/2030 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 400 ms.
Product exploration explored 100000 steps with 0 reset in 456 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 289 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 196 ms. (203 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
[2024-05-27 04:14:42] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 402 cols
[2024-05-27 04:14:42] [INFO ] Computed 21 invariants in 2 ms
[2024-05-27 04:14:42] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 102/105 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/155 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 50/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/156 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 386/542 variables, 156/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 72/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 186/728 variables, 42/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/728 variables, 42/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/728 variables, 6/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/728 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 288/1016 variables, 48/529 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1016 variables, 48/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1016 variables, 258/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1016 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 152/1168 variables, 4/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1168 variables, 152/991 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1168 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 4/1172 variables, 4/995 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1172 variables, 4/999 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1172 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 128/1300 variables, 156/1155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1300 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/1300 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1300/1300 variables, and 1155 constraints, problems are : Problem set: 0 solved, 2 unsolved in 694 ms.
Refiners :[Domain max(s): 402/402 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 402/402 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 102/105 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/155 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 50/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/156 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 386/542 variables, 156/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 72/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 186/728 variables, 42/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/728 variables, 42/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/728 variables, 6/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 04:14:43] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 3 ms to minimize.
[2024-05-27 04:14:43] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 3 ms to minimize.
[2024-05-27 04:14:43] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-05-27 04:14:44] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/728 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/728 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 288/1016 variables, 48/535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1016 variables, 48/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1016 variables, 258/841 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 04:14:44] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 1 ms to minimize.
[2024-05-27 04:14:44] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1016 variables, 2/843 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1016 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 152/1168 variables, 4/847 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1168 variables, 152/999 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 04:14:45] [INFO ] Deduced a trap composed of 45 places in 356 ms of which 5 ms to minimize.
[2024-05-27 04:14:45] [INFO ] Deduced a trap composed of 34 places in 373 ms of which 4 ms to minimize.
[2024-05-27 04:14:45] [INFO ] Deduced a trap composed of 10 places in 291 ms of which 4 ms to minimize.
[2024-05-27 04:14:46] [INFO ] Deduced a trap composed of 10 places in 401 ms of which 6 ms to minimize.
[2024-05-27 04:14:46] [INFO ] Deduced a trap composed of 29 places in 297 ms of which 3 ms to minimize.
[2024-05-27 04:14:46] [INFO ] Deduced a trap composed of 35 places in 375 ms of which 5 ms to minimize.
[2024-05-27 04:14:47] [INFO ] Deduced a trap composed of 64 places in 353 ms of which 4 ms to minimize.
[2024-05-27 04:14:47] [INFO ] Deduced a trap composed of 23 places in 373 ms of which 5 ms to minimize.
[2024-05-27 04:14:48] [INFO ] Deduced a trap composed of 53 places in 429 ms of which 6 ms to minimize.
[2024-05-27 04:14:48] [INFO ] Deduced a trap composed of 22 places in 433 ms of which 5 ms to minimize.
SMT process timed out in 6107ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 1108/1108 transitions.
Applied a total of 0 rules in 23 ms. Remains 402 /402 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 402/402 places, 1108/1108 transitions.
RANDOM walk for 40000 steps (8 resets) in 360 ms. (110 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 545968 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 2
Probabilistic random walk after 545968 steps, saw 73648 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
[2024-05-27 04:14:51] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2024-05-27 04:14:51] [INFO ] Invariant cache hit.
[2024-05-27 04:14:51] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 102/105 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/155 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 50/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/156 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 386/542 variables, 156/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 72/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 186/728 variables, 42/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/728 variables, 42/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/728 variables, 6/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/728 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 288/1016 variables, 48/529 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1016 variables, 48/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1016 variables, 258/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1016 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 152/1168 variables, 4/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1168 variables, 152/991 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1168 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 4/1172 variables, 4/995 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1172 variables, 4/999 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1172 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 128/1300 variables, 156/1155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1300 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/1300 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1300/1300 variables, and 1155 constraints, problems are : Problem set: 0 solved, 2 unsolved in 728 ms.
Refiners :[Domain max(s): 402/402 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 402/402 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 102/105 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/155 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 50/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/156 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 386/542 variables, 156/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 72/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 186/728 variables, 42/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/728 variables, 42/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/728 variables, 6/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 04:14:53] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-27 04:14:53] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/728 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/728 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 288/1016 variables, 48/533 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1016 variables, 48/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1016 variables, 258/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1016 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 152/1168 variables, 4/843 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1168 variables, 152/995 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 04:14:54] [INFO ] Deduced a trap composed of 10 places in 490 ms of which 6 ms to minimize.
[2024-05-27 04:14:54] [INFO ] Deduced a trap composed of 43 places in 485 ms of which 6 ms to minimize.
[2024-05-27 04:14:55] [INFO ] Deduced a trap composed of 11 places in 423 ms of which 5 ms to minimize.
[2024-05-27 04:14:55] [INFO ] Deduced a trap composed of 15 places in 460 ms of which 5 ms to minimize.
[2024-05-27 04:14:56] [INFO ] Deduced a trap composed of 72 places in 436 ms of which 5 ms to minimize.
[2024-05-27 04:14:56] [INFO ] Deduced a trap composed of 38 places in 266 ms of which 4 ms to minimize.
[2024-05-27 04:14:56] [INFO ] Deduced a trap composed of 14 places in 436 ms of which 6 ms to minimize.
[2024-05-27 04:14:57] [INFO ] Deduced a trap composed of 54 places in 450 ms of which 6 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1168 variables, 8/1003 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1168 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 4/1172 variables, 4/1007 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1172 variables, 4/1011 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1172 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 128/1300 variables, 156/1167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1300 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/1300 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1300/1300 variables, and 1167 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5375 ms.
Refiners :[Domain max(s): 402/402 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 402/402 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 6121ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 127 ms.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 1108/1108 transitions.
Applied a total of 0 rules in 24 ms. Remains 402 /402 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 402/402 places, 1108/1108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 1108/1108 transitions.
Applied a total of 0 rules in 24 ms. Remains 402 /402 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
[2024-05-27 04:14:58] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2024-05-27 04:14:58] [INFO ] Invariant cache hit.
[2024-05-27 04:14:58] [INFO ] Implicit Places using invariants in 792 ms returned []
[2024-05-27 04:14:58] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2024-05-27 04:14:58] [INFO ] Invariant cache hit.
[2024-05-27 04:14:59] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:15:01] [INFO ] Implicit Places using invariants and state equation in 2217 ms returned []
Implicit Place search using SMT with State Equation took 3014 ms to find 0 implicit places.
[2024-05-27 04:15:01] [INFO ] Redundant transitions in 12 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-05-27 04:15:01] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2024-05-27 04:15:01] [INFO ] Invariant cache hit.
[2024-05-27 04:15:01] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 401/401 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 18/419 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-27 04:15:16] [INFO ] Deduced a trap composed of 19 places in 413 ms of which 5 ms to minimize.
[2024-05-27 04:15:17] [INFO ] Deduced a trap composed of 10 places in 411 ms of which 6 ms to minimize.
[2024-05-27 04:15:17] [INFO ] Deduced a trap composed of 10 places in 410 ms of which 5 ms to minimize.
[2024-05-27 04:15:18] [INFO ] Deduced a trap composed of 34 places in 461 ms of which 5 ms to minimize.
[2024-05-27 04:15:18] [INFO ] Deduced a trap composed of 52 places in 383 ms of which 5 ms to minimize.
[2024-05-27 04:15:18] [INFO ] Deduced a trap composed of 42 places in 381 ms of which 5 ms to minimize.
[2024-05-27 04:15:19] [INFO ] Deduced a trap composed of 30 places in 387 ms of which 6 ms to minimize.
[2024-05-27 04:15:19] [INFO ] Deduced a trap composed of 16 places in 400 ms of which 6 ms to minimize.
[2024-05-27 04:15:20] [INFO ] Deduced a trap composed of 21 places in 380 ms of which 5 ms to minimize.
[2024-05-27 04:15:20] [INFO ] Deduced a trap composed of 10 places in 367 ms of which 5 ms to minimize.
[2024-05-27 04:15:20] [INFO ] Deduced a trap composed of 49 places in 318 ms of which 5 ms to minimize.
[2024-05-27 04:15:21] [INFO ] Deduced a trap composed of 23 places in 334 ms of which 5 ms to minimize.
[2024-05-27 04:15:21] [INFO ] Deduced a trap composed of 64 places in 327 ms of which 4 ms to minimize.
[2024-05-27 04:15:21] [INFO ] Deduced a trap composed of 22 places in 304 ms of which 4 ms to minimize.
[2024-05-27 04:15:22] [INFO ] Deduced a trap composed of 34 places in 389 ms of which 5 ms to minimize.
[2024-05-27 04:15:22] [INFO ] Deduced a trap composed of 29 places in 323 ms of which 5 ms to minimize.
[2024-05-27 04:15:22] [INFO ] Deduced a trap composed of 18 places in 311 ms of which 5 ms to minimize.
[2024-05-27 04:15:23] [INFO ] Deduced a trap composed of 12 places in 346 ms of which 5 ms to minimize.
[2024-05-27 04:15:23] [INFO ] Deduced a trap composed of 14 places in 362 ms of which 5 ms to minimize.
[2024-05-27 04:15:23] [INFO ] Deduced a trap composed of 54 places in 331 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-27 04:15:24] [INFO ] Deduced a trap composed of 12 places in 329 ms of which 3 ms to minimize.
[2024-05-27 04:15:25] [INFO ] Deduced a trap composed of 36 places in 241 ms of which 4 ms to minimize.
[2024-05-27 04:15:25] [INFO ] Deduced a trap composed of 45 places in 354 ms of which 5 ms to minimize.
[2024-05-27 04:15:25] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 3 ms to minimize.
[2024-05-27 04:15:26] [INFO ] Deduced a trap composed of 18 places in 342 ms of which 5 ms to minimize.
[2024-05-27 04:15:26] [INFO ] Deduced a trap composed of 54 places in 302 ms of which 4 ms to minimize.
[2024-05-27 04:15:26] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 3 ms to minimize.
[2024-05-27 04:15:26] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-27 04:15:26] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 3 ms to minimize.
[2024-05-27 04:15:27] [INFO ] Deduced a trap composed of 34 places in 249 ms of which 5 ms to minimize.
[2024-05-27 04:15:27] [INFO ] Deduced a trap composed of 53 places in 297 ms of which 4 ms to minimize.
[2024-05-27 04:15:27] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 3 ms to minimize.
[2024-05-27 04:15:27] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 2 ms to minimize.
[2024-05-27 04:15:28] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 2 ms to minimize.
[2024-05-27 04:15:28] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
[2024-05-27 04:15:28] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 3 ms to minimize.
[2024-05-27 04:15:28] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 3 ms to minimize.
[2024-05-27 04:15:28] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-05-27 04:15:28] [INFO ] Deduced a trap composed of 52 places in 195 ms of which 3 ms to minimize.
[2024-05-27 04:15:29] [INFO ] Deduced a trap composed of 57 places in 184 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/459 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1300 variables, and 459 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30031 ms.
Refiners :[Domain max(s): 401/402 constraints, Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/402 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 401/401 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 18/419 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 40/459 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-27 04:15:33] [INFO ] Deduced a trap composed of 54 places in 243 ms of which 3 ms to minimize.
[2024-05-27 04:15:33] [INFO ] Deduced a trap composed of 64 places in 169 ms of which 2 ms to minimize.
[2024-05-27 04:15:34] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 2 ms to minimize.
[2024-05-27 04:15:34] [INFO ] Deduced a trap composed of 70 places in 158 ms of which 2 ms to minimize.
[2024-05-27 04:15:34] [INFO ] Deduced a trap composed of 62 places in 168 ms of which 2 ms to minimize.
[2024-05-27 04:15:34] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 3 ms to minimize.
[2024-05-27 04:15:34] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-05-27 04:15:35] [INFO ] Deduced a trap composed of 18 places in 213 ms of which 3 ms to minimize.
[2024-05-27 04:15:36] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 3 ms to minimize.
[2024-05-27 04:15:36] [INFO ] Deduced a trap composed of 64 places in 177 ms of which 3 ms to minimize.
[2024-05-27 04:15:36] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 3 ms to minimize.
[2024-05-27 04:15:36] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 2 ms to minimize.
[2024-05-27 04:15:37] [INFO ] Deduced a trap composed of 18 places in 246 ms of which 3 ms to minimize.
[2024-05-27 04:15:37] [INFO ] Deduced a trap composed of 28 places in 221 ms of which 3 ms to minimize.
[2024-05-27 04:15:38] [INFO ] Deduced a trap composed of 52 places in 145 ms of which 2 ms to minimize.
[2024-05-27 04:15:38] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 3 ms to minimize.
[2024-05-27 04:15:38] [INFO ] Deduced a trap composed of 29 places in 217 ms of which 2 ms to minimize.
[2024-05-27 04:15:38] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 2 ms to minimize.
[2024-05-27 04:15:38] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2024-05-27 04:15:39] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/479 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-27 04:15:40] [INFO ] Deduced a trap composed of 30 places in 333 ms of which 3 ms to minimize.
[2024-05-27 04:15:40] [INFO ] Deduced a trap composed of 51 places in 237 ms of which 3 ms to minimize.
[2024-05-27 04:15:40] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 3 ms to minimize.
[2024-05-27 04:15:40] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 3 ms to minimize.
[2024-05-27 04:15:41] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 2 ms to minimize.
[2024-05-27 04:15:42] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 4 ms to minimize.
[2024-05-27 04:15:42] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 3 ms to minimize.
[2024-05-27 04:15:43] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 4 ms to minimize.
[2024-05-27 04:15:43] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 2 ms to minimize.
[2024-05-27 04:15:43] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 3 ms to minimize.
[2024-05-27 04:15:44] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2024-05-27 04:15:44] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 3 ms to minimize.
[2024-05-27 04:15:44] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 2 ms to minimize.
[2024-05-27 04:15:44] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 3 ms to minimize.
[2024-05-27 04:15:44] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 3 ms to minimize.
[2024-05-27 04:15:45] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 3 ms to minimize.
[2024-05-27 04:15:45] [INFO ] Deduced a trap composed of 11 places in 331 ms of which 5 ms to minimize.
[2024-05-27 04:15:45] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 4 ms to minimize.
[2024-05-27 04:15:45] [INFO ] Deduced a trap composed of 14 places in 317 ms of which 5 ms to minimize.
[2024-05-27 04:15:46] [INFO ] Deduced a trap composed of 66 places in 313 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/499 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-27 04:15:47] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 2 ms to minimize.
[2024-05-27 04:15:47] [INFO ] Deduced a trap composed of 51 places in 183 ms of which 3 ms to minimize.
[2024-05-27 04:15:48] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 4 ms to minimize.
[2024-05-27 04:15:49] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 1 ms to minimize.
[2024-05-27 04:15:49] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 3 ms to minimize.
[2024-05-27 04:15:49] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 3 ms to minimize.
[2024-05-27 04:15:49] [INFO ] Deduced a trap composed of 60 places in 223 ms of which 3 ms to minimize.
[2024-05-27 04:15:50] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 3 ms to minimize.
[2024-05-27 04:15:50] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 4 ms to minimize.
[2024-05-27 04:15:50] [INFO ] Deduced a trap composed of 29 places in 223 ms of which 3 ms to minimize.
[2024-05-27 04:15:51] [INFO ] Deduced a trap composed of 15 places in 274 ms of which 3 ms to minimize.
[2024-05-27 04:15:51] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 2 ms to minimize.
[2024-05-27 04:15:51] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2024-05-27 04:15:51] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-27 04:15:52] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 2 ms to minimize.
[2024-05-27 04:15:52] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-05-27 04:15:52] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-05-27 04:15:52] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-05-27 04:15:52] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 2 ms to minimize.
[2024-05-27 04:15:52] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/519 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-27 04:15:53] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 2 ms to minimize.
[2024-05-27 04:15:54] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 4 ms to minimize.
[2024-05-27 04:15:55] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 3 ms to minimize.
[2024-05-27 04:15:55] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 3 ms to minimize.
[2024-05-27 04:15:56] [INFO ] Deduced a trap composed of 16 places in 303 ms of which 4 ms to minimize.
[2024-05-27 04:15:56] [INFO ] Deduced a trap composed of 28 places in 253 ms of which 4 ms to minimize.
[2024-05-27 04:15:57] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
[2024-05-27 04:15:57] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 1 ms to minimize.
[2024-05-27 04:15:57] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 2 ms to minimize.
[2024-05-27 04:15:57] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 2 ms to minimize.
[2024-05-27 04:15:58] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 2 ms to minimize.
[2024-05-27 04:15:58] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 3 ms to minimize.
[2024-05-27 04:15:58] [INFO ] Deduced a trap composed of 50 places in 163 ms of which 3 ms to minimize.
[2024-05-27 04:15:58] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 3 ms to minimize.
[2024-05-27 04:15:59] [INFO ] Deduced a trap composed of 15 places in 335 ms of which 5 ms to minimize.
[2024-05-27 04:15:59] [INFO ] Deduced a trap composed of 61 places in 187 ms of which 3 ms to minimize.
[2024-05-27 04:15:59] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 3 ms to minimize.
[2024-05-27 04:15:59] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 3 ms to minimize.
[2024-05-27 04:16:00] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 2 ms to minimize.
[2024-05-27 04:16:00] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 20/539 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 1)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 1)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 1)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 0)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 1)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 1)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 1)
(s342 0)
(s343 0)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 1)
(s362 1)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 1)
(s372 0)
(s373 1)
(s374 1)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s390 0)
(s391 0)
(s392 0)
(s393 1)
(s394 0)
(s395 0)
(s396 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1300 variables, and 539 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30020 ms.
Refiners :[Domain max(s): 401/402 constraints, Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/402 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/1101 constraints, Known Traps: 120/120 constraints]
After SMT, in 60428ms problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 60441ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63503 ms. Remains : 402/402 places, 1108/1108 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 840 edges and 402 vertex of which 293 / 402 are part of one of the 42 SCC in 5 ms
Free SCC test removed 251 places
Drop transitions (Empty/Sink Transition effects.) removed 502 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 753 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 150 transition count 355
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 2 place count 150 transition count 314
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 1 with 82 rules applied. Total rules applied 84 place count 109 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 108 transition count 313
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 17 rules applied. Total rules applied 103 place count 97 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 48 edges and 97 vertex of which 35 / 97 are part of one of the 5 SCC in 0 ms
Free SCC test removed 30 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 67 transition count 313
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Graph (trivial) has 157 edges and 63 vertex of which 24 / 63 are part of one of the 6 SCC in 1 ms
Free SCC test removed 18 places
Iterating post reduction 2 with 40 rules applied. Total rules applied 145 place count 45 transition count 278
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 183 transitions.
Iterating post reduction 3 with 183 rules applied. Total rules applied 328 place count 45 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 332 place count 45 transition count 91
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 333 place count 45 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 334 place count 44 transition count 90
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 336 place count 44 transition count 90
Applied a total of 336 rules in 48 ms. Remains 44 /402 variables (removed 358) and now considering 90/1108 (removed 1018) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 90 rows 44 cols
[2024-05-27 04:16:01] [INFO ] Computed 11 invariants in 1 ms
[2024-05-27 04:16:01] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 04:16:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 04:16:01] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-27 04:16:01] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-27 04:16:01] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 214 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) p0))), (F p1)]
Knowledge based reduction with 5 factoid took 439 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), true, (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), true, (NOT p0)]
[2024-05-27 04:16:02] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 402 cols
[2024-05-27 04:16:02] [INFO ] Computed 21 invariants in 4 ms
[2024-05-27 04:16:03] [INFO ] [Real]Absence check using 20 positive place invariants in 20 ms returned sat
[2024-05-27 04:16:03] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 5 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) p0))), (F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 5 factoid took 374 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-6-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-6-LTLCardinality-09 finished in 83514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||X(G(p1)))))))'
Support contains 4 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 45 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:16:03] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-27 04:16:03] [INFO ] Computed 27 invariants in 6 ms
[2024-05-27 04:16:04] [INFO ] Implicit Places using invariants in 907 ms returned [1205, 1206, 1301, 1302, 1303, 1304]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 911 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1324/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 40 ms. Remains 1324 /1324 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 997 ms. Remains : 1324/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLCardinality-10 finished in 1196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||G(p1))) U X(X(p2)))))'
Found a Lengthening insensitive property : Peterson-PT-6-LTLCardinality-01
Stuttering acceptance computed with spot in 265 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 595 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1330 transition count 1778
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 1 with 252 rules applied. Total rules applied 504 place count 1078 transition count 1778
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 504 place count 1078 transition count 1729
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 602 place count 1029 transition count 1729
Applied a total of 602 rules in 110 ms. Remains 1029 /1330 variables (removed 301) and now considering 1729/2030 (removed 301) transitions.
[2024-05-27 04:16:05] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
// Phase 1: matrix 1519 rows 1029 cols
[2024-05-27 04:16:05] [INFO ] Computed 27 invariants in 4 ms
[2024-05-27 04:16:06] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-05-27 04:16:06] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
[2024-05-27 04:16:06] [INFO ] Invariant cache hit.
[2024-05-27 04:16:06] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:16:08] [INFO ] Implicit Places using invariants and state equation in 2419 ms returned []
Implicit Place search using SMT with State Equation took 2896 ms to find 0 implicit places.
Running 1722 sub problems to find dead transitions.
[2024-05-27 04:16:08] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
[2024-05-27 04:16:08] [INFO ] Invariant cache hit.
[2024-05-27 04:16:08] [INFO ] State equation strengthened by 330 read => feed constraints.
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 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1022 variables, 1022/1022 constraints. Problems are: Problem set: 0 solved, 1722 unsolved
SMT process timed out in 30568ms, After SMT, problems are : Problem set: 0 solved, 1722 unsolved
Search for dead transitions found 0 dead transitions in 30591ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1029/1330 places, 1729/2030 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 33602 ms. Remains : 1029/1330 places, 1729/2030 transitions.
Running random walk in product with property : Peterson-PT-6-LTLCardinality-01
Product exploration explored 100000 steps with 26807 reset in 1254 ms.
Product exploration explored 100000 steps with 26834 reset in 1040 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
RANDOM walk for 31563 steps (7 resets) in 484 ms. (65 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 p2))), (F (NOT (OR p1 p0))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 434 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 384 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 385 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 595 out of 1029 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1029/1029 places, 1729/1729 transitions.
Applied a total of 0 rules in 13 ms. Remains 1029 /1029 variables (removed 0) and now considering 1729/1729 (removed 0) transitions.
[2024-05-27 04:16:43] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
[2024-05-27 04:16:43] [INFO ] Invariant cache hit.
[2024-05-27 04:16:44] [INFO ] Implicit Places using invariants in 727 ms returned []
[2024-05-27 04:16:44] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
[2024-05-27 04:16:44] [INFO ] Invariant cache hit.
[2024-05-27 04:16:45] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:16:46] [INFO ] Implicit Places using invariants and state equation in 2870 ms returned []
Implicit Place search using SMT with State Equation took 3608 ms to find 0 implicit places.
Running 1722 sub problems to find dead transitions.
[2024-05-27 04:16:46] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
[2024-05-27 04:16:46] [INFO ] Invariant cache hit.
[2024-05-27 04:16:46] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1022 variables, 1022/1022 constraints. Problems are: Problem set: 0 solved, 1722 unsolved
SMT process timed out in 30745ms, After SMT, problems are : Problem set: 0 solved, 1722 unsolved
Search for dead transitions found 0 dead transitions in 30763ms
Finished structural reductions in LTL mode , in 1 iterations and 34387 ms. Remains : 1029/1029 places, 1729/1729 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 221 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
RANDOM walk for 32323 steps (6 resets) in 475 ms. (67 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 p2))), (F (NOT (OR p1 p0))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 434 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 368 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 356 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 334 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 26794 reset in 1268 ms.
Product exploration explored 100000 steps with 26828 reset in 1006 ms.
Applying partial POR strategy [false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 595 out of 1029 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1029/1029 places, 1729/1729 transitions.
Applied a total of 0 rules in 21 ms. Remains 1029 /1029 variables (removed 0) and now considering 1729/1729 (removed 0) transitions.
[2024-05-27 04:17:22] [INFO ] Redundant transitions in 40 ms returned []
Running 1722 sub problems to find dead transitions.
[2024-05-27 04:17:22] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
[2024-05-27 04:17:22] [INFO ] Invariant cache hit.
[2024-05-27 04:17:22] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1022 variables, 1022/1022 constraints. Problems are: Problem set: 0 solved, 1722 unsolved
SMT process timed out in 30709ms, After SMT, problems are : Problem set: 0 solved, 1722 unsolved
Search for dead transitions found 0 dead transitions in 30739ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30811 ms. Remains : 1029/1029 places, 1729/1729 transitions.
Built C files in :
/tmp/ltsmin1216844453871305171
[2024-05-27 04:17:53] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1216844453871305171
Running compilation step : cd /tmp/ltsmin1216844453871305171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin1216844453871305171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin1216844453871305171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
Support contains 595 out of 1029 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1029/1029 places, 1729/1729 transitions.
Applied a total of 0 rules in 9 ms. Remains 1029 /1029 variables (removed 0) and now considering 1729/1729 (removed 0) transitions.
[2024-05-27 04:17:56] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
[2024-05-27 04:17:56] [INFO ] Invariant cache hit.
[2024-05-27 04:17:57] [INFO ] Implicit Places using invariants in 673 ms returned []
[2024-05-27 04:17:57] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
[2024-05-27 04:17:57] [INFO ] Invariant cache hit.
[2024-05-27 04:17:58] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:18:00] [INFO ] Implicit Places using invariants and state equation in 3169 ms returned []
Implicit Place search using SMT with State Equation took 3844 ms to find 0 implicit places.
Running 1722 sub problems to find dead transitions.
[2024-05-27 04:18:00] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
[2024-05-27 04:18:00] [INFO ] Invariant cache hit.
[2024-05-27 04:18:00] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1022 variables, 1022/1022 constraints. Problems are: Problem set: 0 solved, 1722 unsolved
SMT process timed out in 30708ms, After SMT, problems are : Problem set: 0 solved, 1722 unsolved
Search for dead transitions found 0 dead transitions in 30732ms
Finished structural reductions in LTL mode , in 1 iterations and 34589 ms. Remains : 1029/1029 places, 1729/1729 transitions.
Built C files in :
/tmp/ltsmin3831967166447961625
[2024-05-27 04:18:31] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3831967166447961625
Running compilation step : cd /tmp/ltsmin3831967166447961625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin3831967166447961625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin3831967166447961625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
[2024-05-27 04:18:34] [INFO ] Flatten gal took : 94 ms
[2024-05-27 04:18:34] [INFO ] Flatten gal took : 93 ms
[2024-05-27 04:18:34] [INFO ] Time to serialize gal into /tmp/LTL16425895815962071208.gal : 8 ms
[2024-05-27 04:18:34] [INFO ] Time to serialize properties into /tmp/LTL238881281481586324.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16425895815962071208.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1877184295539407833.hoa' '-atoms' '/tmp/LTL238881281481586324.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL238881281481586324.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1877184295539407833.hoa
Detected timeout of ITS tools.
[2024-05-27 04:18:49] [INFO ] Flatten gal took : 43 ms
[2024-05-27 04:18:49] [INFO ] Flatten gal took : 44 ms
[2024-05-27 04:18:49] [INFO ] Time to serialize gal into /tmp/LTL1571444411980122312.gal : 9 ms
[2024-05-27 04:18:49] [INFO ] Time to serialize properties into /tmp/LTL15465258711110221731.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1571444411980122312.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15465258711110221731.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F(("(((((((AskForSection_2_3+AskForSection_1_3)+(AskForSection_0_3+AskForSection_6_2))+((AskForSection_6_3+AskForSection_5_3)+(A...15323
Formula 0 simplified : F(G(!"(((((((AskForSection_2_3+AskForSection_1_3)+(AskForSection_0_3+AskForSection_6_2))+((AskForSection_6_3+AskForSection_5_3)+(Ask...15312
Detected timeout of ITS tools.
[2024-05-27 04:19:04] [INFO ] Flatten gal took : 41 ms
[2024-05-27 04:19:04] [INFO ] Applying decomposition
[2024-05-27 04:19:04] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2413839852476429830.txt' '-o' '/tmp/graph2413839852476429830.bin' '-w' '/tmp/graph2413839852476429830.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2413839852476429830.bin' '-l' '-1' '-v' '-w' '/tmp/graph2413839852476429830.weights' '-q' '0' '-e' '0.001'
[2024-05-27 04:19:05] [INFO ] Decomposing Gal with order
[2024-05-27 04:19:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 04:19:06] [INFO ] Removed a total of 1623 redundant transitions.
[2024-05-27 04:19:06] [INFO ] Flatten gal took : 834 ms
[2024-05-27 04:19:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 1136 labels/synchronizations in 73 ms.
[2024-05-27 04:19:06] [INFO ] Time to serialize gal into /tmp/LTL16217804255580449367.gal : 14 ms
[2024-05-27 04:19:06] [INFO ] Time to serialize properties into /tmp/LTL7296158385335833166.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16217804255580449367.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7296158385335833166.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F(("(((((((gu19.AskForSection_2_3+gu19.AskForSection_1_3)+(gu19.AskForSection_0_3+gu19.AskForSection_6_2))+((gu19.AskForSection_...19264
Formula 0 simplified : F(G(!"(((((((gu19.AskForSection_2_3+gu19.AskForSection_1_3)+(gu19.AskForSection_0_3+gu19.AskForSection_6_2))+((gu19.AskForSection_6_...19253
Detected timeout of ITS tools.
Treatment of property Peterson-PT-6-LTLCardinality-01 finished in 196452 ms.
[2024-05-27 04:19:21] [INFO ] Flatten gal took : 55 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10048429846993809851
[2024-05-27 04:19:21] [INFO ] Too many transitions (2030) to apply POR reductions. Disabling POR matrices.
[2024-05-27 04:19:21] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10048429846993809851
Running compilation step : cd /tmp/ltsmin10048429846993809851;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-27 04:19:21] [INFO ] Applying decomposition
[2024-05-27 04:19:21] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6031051312062435277.txt' '-o' '/tmp/graph6031051312062435277.bin' '-w' '/tmp/graph6031051312062435277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6031051312062435277.bin' '-l' '-1' '-v' '-w' '/tmp/graph6031051312062435277.weights' '-q' '0' '-e' '0.001'
[2024-05-27 04:19:22] [INFO ] Decomposing Gal with order
[2024-05-27 04:19:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 04:19:23] [INFO ] Removed a total of 1623 redundant transitions.
[2024-05-27 04:19:23] [INFO ] Flatten gal took : 758 ms
[2024-05-27 04:19:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 1110 labels/synchronizations in 61 ms.
[2024-05-27 04:19:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality7211930272080310170.gal : 20 ms
[2024-05-27 04:19:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality2004083505748749713.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7211930272080310170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2004083505748749713.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G((F(("(((((((gu169.AskForSection_2_3+gu169.AskForSection_1_3)+(gu169.AskForSection_0_3+gu169.AskForSection_6_2))+((gu169.AskForSec...20993
Formula 0 simplified : F(G(!"(((((((gu169.AskForSection_2_3+gu169.AskForSection_1_3)+(gu169.AskForSection_0_3+gu169.AskForSection_6_2))+((gu169.AskForSecti...20982
Compilation finished in 8845 ms.
Running link step : cd /tmp/ltsmin10048429846993809851;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin10048429846993809851;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>(((LTLAPp0==true)||[]((LTLAPp1==true)))) U X(X((LTLAPp2==true)))))' '--buchi-type=spotba'
LTSmin run took 1950 ms.
FORMULA Peterson-PT-6-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 739888 ms.

BK_STOP 1716783572577

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="Peterson-PT-6"
export BK_EXAMINATION="LTLCardinality"
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-5568"
echo " Executing tool itstools"
echo " Input is Peterson-PT-6, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-171654407300283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-6.tgz
mv Peterson-PT-6 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;