About the Execution of GreatSPN+red for RingSingleMessageInMbox-PT-d1m005
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1220.479 | 196014.00 | 242897.00 | 658.30 | TFFTFTFFTFFTFFFT | 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.r333-tall-171679077600059.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is RingSingleMessageInMbox-PT-d1m005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679077600059
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 13 00:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 13 00:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 00:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 00:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M 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 RingSingleMessageInMbox-PT-d1m005-LTLCardinality-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLCardinality-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLCardinality-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLCardinality-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLCardinality-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLCardinality-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLCardinality-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLCardinality-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLCardinality-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLCardinality-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLCardinality-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLCardinality-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLCardinality-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLCardinality-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLCardinality-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716793104139
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m005
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 06:58:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 06:58:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 06:58:25] [INFO ] Load time of PNML (sax parser for PT used): 458 ms
[2024-05-27 06:58:25] [INFO ] Transformed 6690 places.
[2024-05-27 06:58:25] [INFO ] Transformed 11934 transitions.
[2024-05-27 06:58:25] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 624 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 4305 places in 42 ms
Reduce places removed 4305 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1103 places :
Symmetric choice reduction at 1 with 1103 rule applications. Total rules 1222 place count 1265 transition count 2428
Iterating global reduction 1 with 1103 rules applied. Total rules applied 2325 place count 1265 transition count 2428
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 2400 place count 1265 transition count 2353
Discarding 904 places :
Symmetric choice reduction at 2 with 904 rule applications. Total rules 3304 place count 361 transition count 1449
Iterating global reduction 2 with 904 rules applied. Total rules applied 4208 place count 361 transition count 1449
Ensure Unique test removed 857 transitions
Reduce isomorphic transitions removed 857 transitions.
Iterating post reduction 2 with 857 rules applied. Total rules applied 5065 place count 361 transition count 592
Discarding 160 places :
Symmetric choice reduction at 3 with 160 rule applications. Total rules 5225 place count 201 transition count 432
Iterating global reduction 3 with 160 rules applied. Total rules applied 5385 place count 201 transition count 432
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 3 with 122 rules applied. Total rules applied 5507 place count 201 transition count 310
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 5515 place count 193 transition count 302
Iterating global reduction 4 with 8 rules applied. Total rules applied 5523 place count 193 transition count 302
Applied a total of 5523 rules in 448 ms. Remains 193 /2385 variables (removed 2192) and now considering 302/11934 (removed 11632) transitions.
// Phase 1: matrix 302 rows 193 cols
[2024-05-27 06:58:26] [INFO ] Computed 3 invariants in 24 ms
[2024-05-27 06:58:26] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-27 06:58:26] [INFO ] Invariant cache hit.
[2024-05-27 06:58:27] [INFO ] State equation strengthened by 121 read => feed constraints.
[2024-05-27 06:58:27] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-05-27 06:58:27] [INFO ] Invariant cache hit.
[2024-05-27 06:58:27] [INFO ] State equation strengthened by 121 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
At refinement iteration 4 (OVERLAPS) 302/495 variables, 193/196 constraints. Problems are: Problem set: 24 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 121/317 constraints. Problems are: Problem set: 24 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/317 constraints. Problems are: Problem set: 24 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 0/495 variables, 0/317 constraints. Problems are: Problem set: 24 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 317 constraints, problems are : Problem set: 24 solved, 277 unsolved in 11462 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 193/193 constraints, ReadFeed: 121/121 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 17/185 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 8/193 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 302/495 variables, 193/196 constraints. Problems are: Problem set: 24 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 121/317 constraints. Problems are: Problem set: 24 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 277/594 constraints. Problems are: Problem set: 24 solved, 277 unsolved
[2024-05-27 06:58:48] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 15 ms to minimize.
[2024-05-27 06:58:48] [INFO ] Deduced a trap composed of 98 places in 70 ms of which 2 ms to minimize.
[2024-05-27 06:58:49] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-05-27 06:58:49] [INFO ] Deduced a trap composed of 89 places in 68 ms of which 2 ms to minimize.
[2024-05-27 06:58:50] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
[2024-05-27 06:58:50] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
[2024-05-27 06:58:50] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 2 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
[2024-05-27 06:58:54] [INFO ] Deduced a trap composed of 95 places in 57 ms of which 1 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
[2024-05-27 06:58:54] [INFO ] Deduced a trap composed of 95 places in 63 ms of which 1 ms to minimize.
[2024-05-27 06:58:54] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 2 ms to minimize.
[2024-05-27 06:58:55] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 11/605 constraints. Problems are: Problem set: 46 solved, 255 unsolved
[2024-05-27 06:59:03] [INFO ] Deduced a trap composed of 92 places in 68 ms of which 2 ms to minimize.
[2024-05-27 06:59:03] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 2/607 constraints. Problems are: Problem set: 46 solved, 255 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
(s0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/495 variables, and 607 constraints, problems are : Problem set: 46 solved, 255 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 193/193 constraints, ReadFeed: 121/121 constraints, PredecessorRefiner: 277/301 constraints, Known Traps: 13/13 constraints]
After SMT, in 42263ms problems are : Problem set: 46 solved, 255 unsolved
Search for dead transitions found 46 dead transitions in 42278ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 193/2385 places, 256/11934 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 151 transition count 238
Applied a total of 60 rules in 3 ms. Remains 151 /193 variables (removed 42) and now considering 238/256 (removed 18) transitions.
// Phase 1: matrix 238 rows 151 cols
[2024-05-27 06:59:09] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:59:09] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-27 06:59:09] [INFO ] Invariant cache hit.
[2024-05-27 06:59:09] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-05-27 06:59:10] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 151/2385 places, 238/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44071 ms. Remains : 151/2385 places, 238/11934 transitions.
Support contains 9 out of 151 places after structural reductions.
[2024-05-27 06:59:10] [INFO ] Flatten gal took : 50 ms
[2024-05-27 06:59:10] [INFO ] Flatten gal took : 23 ms
[2024-05-27 06:59:10] [INFO ] Input system was already deterministic with 238 transitions.
RANDOM walk for 40000 steps (7143 resets) in 1876 ms. (21 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40002 steps (1831 resets) in 138 ms. (287 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1899 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1814 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1719 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1792 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
[2024-05-27 06:59:11] [INFO ] Invariant cache hit.
[2024-05-27 06:59:11] [INFO ] State equation strengthened by 113 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 167/182 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 54/236 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 24/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 7/243 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 5/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
At refinement iteration 12 (OVERLAPS) 146/389 variables, 105/193 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/389 variables, 73/266 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 0/266 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/389 variables, 0/266 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 266 constraints, problems are : Problem set: 4 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/133 variables, 5/6 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 2/8 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 56/189 variables, 1/10 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 24/34 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/34 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/196 variables, 1/35 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 5/40 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 0/40 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 190/386 variables, 113/153 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 111/264 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-27 06:59:12] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/386 variables, 1/265 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/386 variables, 0/265 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/389 variables, 3/268 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 0/268 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/389 variables, 0/268 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 268 constraints, problems are : Problem set: 4 solved, 1 unsolved in 398 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 717ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 238/238 transitions.
Graph (complete) has 498 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 148 transition count 229
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 20 place count 140 transition count 221
Iterating global reduction 1 with 8 rules applied. Total rules applied 28 place count 140 transition count 221
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 33 place count 140 transition count 216
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 38 place count 135 transition count 197
Iterating global reduction 2 with 5 rules applied. Total rules applied 43 place count 135 transition count 197
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 51 place count 135 transition count 189
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 54 place count 132 transition count 162
Iterating global reduction 3 with 3 rules applied. Total rules applied 57 place count 132 transition count 162
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 62 place count 127 transition count 157
Iterating global reduction 3 with 5 rules applied. Total rules applied 67 place count 127 transition count 157
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 72 place count 127 transition count 152
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 76 place count 125 transition count 150
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 125 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 123 transition count 148
Applied a total of 80 rules in 104 ms. Remains 123 /151 variables (removed 28) and now considering 148/238 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 123/151 places, 148/238 transitions.
RANDOM walk for 40000 steps (8408 resets) in 738 ms. (54 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3139 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 52103 steps, run visited all 1 properties in 145 ms. (steps per millisecond=359 )
Probabilistic random walk after 52103 steps, saw 23813 distinct states, run finished after 153 ms. (steps per millisecond=340 ) properties seen :1
Successfully simplified 4 atomic propositions for a total of 7 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 63 stable transitions
Graph (complete) has 550 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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)||X(X(!p0))))'
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 238/238 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 143 transition count 230
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 143 transition count 230
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 143 transition count 226
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 139 transition count 222
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 139 transition count 222
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 38 place count 139 transition count 212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 137 transition count 186
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 137 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 136 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 136 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 136 transition count 184
Applied a total of 45 rules in 10 ms. Remains 136 /151 variables (removed 15) and now considering 184/238 (removed 54) transitions.
// Phase 1: matrix 184 rows 136 cols
[2024-05-27 06:59:12] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 06:59:13] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-27 06:59:13] [INFO ] Invariant cache hit.
[2024-05-27 06:59:13] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-27 06:59:13] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-27 06:59:13] [INFO ] Invariant cache hit.
[2024-05-27 06:59:13] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/320 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 71/209 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-27 06:59:16] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-27 06:59:16] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 0/320 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 211 constraints, problems are : Problem set: 0 solved, 183 unsolved in 7434 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (OVERLAPS) 1/136 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/320 variables, 136/140 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 71/211 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 183/394 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-27 06:59:25] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2024-05-27 06:59:25] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-05-27 06:59:25] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-05-27 06:59:26] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-27 06:59:28] [INFO ] Deduced a trap composed of 52 places in 37 ms of which 1 ms to minimize.
[2024-05-27 06:59:29] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 2/400 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 11 (OVERLAPS) 0/320 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 400 constraints, problems are : Problem set: 0 solved, 183 unsolved in 19516 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 8/8 constraints]
After SMT, in 27184ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 27187ms
Starting structural reductions in LTL mode, iteration 1 : 136/151 places, 184/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27637 ms. Remains : 136/151 places, 184/238 transitions.
Stuttering acceptance computed with spot in 361 ms :[p0, false, false, p0, true, false, (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 773 steps with 159 reset in 31 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLCardinality-02 finished in 28077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 238/238 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 144 transition count 231
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 144 transition count 231
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 144 transition count 227
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 140 transition count 223
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 140 transition count 223
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 36 place count 140 transition count 213
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 138 transition count 187
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 138 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 137 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 137 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 137 transition count 185
Applied a total of 43 rules in 29 ms. Remains 137 /151 variables (removed 14) and now considering 185/238 (removed 53) transitions.
// Phase 1: matrix 185 rows 137 cols
[2024-05-27 06:59:40] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 06:59:40] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-27 06:59:40] [INFO ] Invariant cache hit.
[2024-05-27 06:59:41] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-27 06:59:41] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-05-27 06:59:41] [INFO ] Redundant transitions in 11 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-27 06:59:41] [INFO ] Invariant cache hit.
[2024-05-27 06:59:41] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/322 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 71/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 210 constraints, problems are : Problem set: 0 solved, 184 unsolved in 5548 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/322 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 71/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 184/394 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-27 06:59:51] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-05-27 06:59:51] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-27 06:59:53] [INFO ] Deduced a trap composed of 52 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-27 06:59:58] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-27 07:00:01] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (OVERLAPS) 0/322 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 399 constraints, problems are : Problem set: 0 solved, 184 unsolved in 24809 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 5/5 constraints]
After SMT, in 30572ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 30578ms
Starting structural reductions in SI_LTL mode, iteration 1 : 137/151 places, 185/238 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30915 ms. Remains : 137/151 places, 185/238 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLCardinality-10
Product exploration explored 100000 steps with 20607 reset in 205 ms.
Product exploration explored 100000 steps with 20597 reset in 199 ms.
Computed a total of 4 stabilizing places and 23 stable transitions
Graph (complete) has 472 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 4 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 121 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8213 resets) in 247 ms. (161 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (2673 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2617 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
[2024-05-27 07:00:12] [INFO ] Invariant cache hit.
[2024-05-27 07:00:12] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 135/141 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 57/198 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/201 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 121/322 variables, 98/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 54/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 135/141 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 57/198 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/201 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 121/322 variables, 98/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 54/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 07:00:12] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/322 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/322 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/322 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 344ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 46 ms.
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 185/185 transitions.
Graph (complete) has 423 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 134 transition count 176
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 132 transition count 174
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 132 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 130 transition count 172
Applied a total of 20 rules in 21 ms. Remains 130 /137 variables (removed 7) and now considering 172/185 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 130/137 places, 172/185 transitions.
RANDOM walk for 40000 steps (8274 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (2530 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2633 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 60240 steps, run visited all 2 properties in 170 ms. (steps per millisecond=354 )
Probabilistic random walk after 60240 steps, saw 27225 distinct states, run finished after 171 ms. (steps per millisecond=352 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 196 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 185/185 transitions.
Applied a total of 0 rules in 10 ms. Remains 137 /137 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2024-05-27 07:00:13] [INFO ] Invariant cache hit.
[2024-05-27 07:00:13] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-27 07:00:13] [INFO ] Invariant cache hit.
[2024-05-27 07:00:13] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-27 07:00:13] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-27 07:00:13] [INFO ] Redundant transitions in 8 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-27 07:00:13] [INFO ] Invariant cache hit.
[2024-05-27 07:00:13] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/322 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 71/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 210 constraints, problems are : Problem set: 0 solved, 184 unsolved in 5780 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/322 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 71/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 184/394 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-27 07:00:24] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:00:24] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-27 07:00:26] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-27 07:00:31] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-27 07:00:35] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (OVERLAPS) 0/322 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 399 constraints, problems are : Problem set: 0 solved, 184 unsolved in 25093 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 5/5 constraints]
After SMT, in 31127ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 31129ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31443 ms. Remains : 137/137 places, 185/185 transitions.
Computed a total of 4 stabilizing places and 23 stable transitions
Graph (complete) has 472 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 4 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8169 resets) in 135 ms. (294 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (2558 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (2697 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
[2024-05-27 07:00:45] [INFO ] Invariant cache hit.
[2024-05-27 07:00:45] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 135/141 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 57/198 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/201 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 121/322 variables, 98/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 54/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 135/141 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 57/198 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/201 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 121/322 variables, 98/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 54/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 07:00:45] [INFO ] Deduced a trap composed of 52 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/322 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/322 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/322 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 316ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 185/185 transitions.
Graph (complete) has 423 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 134 transition count 176
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 132 transition count 174
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 132 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 130 transition count 172
Applied a total of 20 rules in 22 ms. Remains 130 /137 variables (removed 7) and now considering 172/185 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 130/137 places, 172/185 transitions.
RANDOM walk for 40000 steps (8256 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2567 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2469 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 60240 steps, run visited all 2 properties in 197 ms. (steps per millisecond=305 )
Probabilistic random walk after 60240 steps, saw 27225 distinct states, run finished after 197 ms. (steps per millisecond=305 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 253 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20752 reset in 143 ms.
Product exploration explored 100000 steps with 20461 reset in 146 ms.
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 185/185 transitions.
Applied a total of 0 rules in 5 ms. Remains 137 /137 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2024-05-27 07:00:46] [INFO ] Invariant cache hit.
[2024-05-27 07:00:46] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 07:00:46] [INFO ] Invariant cache hit.
[2024-05-27 07:00:46] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-27 07:00:47] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-05-27 07:00:47] [INFO ] Redundant transitions in 2 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-27 07:00:47] [INFO ] Invariant cache hit.
[2024-05-27 07:00:47] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/322 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 71/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 210 constraints, problems are : Problem set: 0 solved, 184 unsolved in 5675 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/322 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 71/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 184/394 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-27 07:00:58] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 5 ms to minimize.
[2024-05-27 07:00:58] [INFO ] Deduced a trap composed of 51 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-27 07:00:59] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-27 07:01:04] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-27 07:01:08] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (OVERLAPS) 0/322 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 399 constraints, problems are : Problem set: 0 solved, 184 unsolved in 25496 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 5/5 constraints]
After SMT, in 31378ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 31381ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31680 ms. Remains : 137/137 places, 185/185 transitions.
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLCardinality-10 finished in 97755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 238/238 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 144 transition count 231
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 144 transition count 231
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 144 transition count 227
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 141 transition count 210
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 141 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 141 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 139 transition count 192
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 139 transition count 192
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 35 place count 134 transition count 187
Iterating global reduction 2 with 5 rules applied. Total rules applied 40 place count 134 transition count 187
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 50 place count 134 transition count 177
Applied a total of 50 rules in 6 ms. Remains 134 /151 variables (removed 17) and now considering 177/238 (removed 61) transitions.
// Phase 1: matrix 177 rows 134 cols
[2024-05-27 07:01:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:01:18] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-27 07:01:18] [INFO ] Invariant cache hit.
[2024-05-27 07:01:18] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 07:01:18] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-27 07:01:18] [INFO ] Invariant cache hit.
[2024-05-27 07:01:18] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/311 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 67/203 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 203 constraints, problems are : Problem set: 0 solved, 176 unsolved in 5135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/311 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 67/203 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 176/379 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-27 07:01:27] [INFO ] Deduced a trap composed of 53 places in 37 ms of which 1 ms to minimize.
[2024-05-27 07:01:28] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-05-27 07:01:28] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 0 ms to minimize.
[2024-05-27 07:01:28] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2024-05-27 07:01:28] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 5/384 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (OVERLAPS) 0/311 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 384 constraints, problems are : Problem set: 0 solved, 176 unsolved in 12968 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 5/5 constraints]
After SMT, in 18300ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 18304ms
Starting structural reductions in LTL mode, iteration 1 : 134/151 places, 177/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18649 ms. Remains : 134/151 places, 177/238 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 351 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Computed a total of 7 stabilizing places and 36 stable transitions
Graph (complete) has 457 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 10 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLCardinality-15 finished in 19278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
[2024-05-27 07:01:38] [INFO ] Flatten gal took : 19 ms
[2024-05-27 07:01:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-27 07:01:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 151 places, 238 transitions and 931 arcs took 5 ms.
Total runtime 192804 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running RingSingleMessageInMbox-PT-d1m005
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 151
TRANSITIONS: 238
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.006s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 957
MODEL NAME: /home/mcc/execution/411/model
151 places, 238 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716793300153
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RingSingleMessageInMbox-PT-d1m005"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is RingSingleMessageInMbox-PT-d1m005, 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 r333-tall-171679077600059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m005.tgz
mv RingSingleMessageInMbox-PT-d1m005 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 '
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 ;