About the Execution of GreatSPN+red for CANInsertWithFailure-PT-080
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16189.323 | 3277612.00 | 6169186.00 | 6098.10 | FFF????F???????F | 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.r069-tall-171620503900156.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 CANInsertWithFailure-PT-080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503900156
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 39M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716405375309
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-080
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 19:16:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 19:16:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 19:16:17] [INFO ] Load time of PNML (sax parser for PT used): 888 ms
[2024-05-22 19:16:17] [INFO ] Transformed 13764 places.
[2024-05-22 19:16:17] [INFO ] Transformed 38880 transitions.
[2024-05-22 19:16:17] [INFO ] Parsed PT model containing 13764 places and 38880 transitions and 104000 arcs in 1126 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 13764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13764/13764 places, 38880/38880 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13763 transition count 38880
Applied a total of 1 rules in 4905 ms. Remains 13763 /13764 variables (removed 1) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2024-05-22 19:16:33] [INFO ] Computed 82 invariants in 10059 ms
[2024-05-22 19:16:53] [INFO ] Implicit Places using invariants in 30326 ms returned []
Implicit Place search using SMT only with invariants took 30357 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2024-05-22 19:16:53] [INFO ] Invariant cache hit.
[2024-05-22 19:16:54] [INFO ] State equation strengthened by 12720 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13762 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 38800 unsolved
SMT process timed out in 172318ms, After SMT, problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 172749ms
Starting structural reductions in LTL mode, iteration 1 : 13763/13764 places, 38880/38880 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 208163 ms. Remains : 13763/13764 places, 38880/38880 transitions.
Support contains 44 out of 13763 places after structural reductions.
[2024-05-22 19:19:47] [INFO ] Flatten gal took : 1098 ms
[2024-05-22 19:19:48] [INFO ] Flatten gal took : 797 ms
[2024-05-22 19:19:50] [INFO ] Input system was already deterministic with 38880 transitions.
Support contains 42 out of 13763 places (down from 44) after GAL structural reductions.
RANDOM walk for 40000 steps (20 resets) in 3910 ms. (10 steps per ms) remains 15/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
[2024-05-22 19:19:51] [INFO ] Invariant cache hit.
[2024-05-22 19:19:52] [INFO ] State equation strengthened by 12720 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 13587/13605 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-22 19:19:54] [INFO ] Deduced a trap composed of 5 places in 606 ms of which 26 ms to minimize.
[2024-05-22 19:19:55] [INFO ] Deduced a trap composed of 5 places in 521 ms of which 3 ms to minimize.
[2024-05-22 19:19:56] [INFO ] Deduced a trap composed of 5 places in 513 ms of which 3 ms to minimize.
[2024-05-22 19:19:56] [INFO ] Deduced a trap composed of 5 places in 465 ms of which 3 ms to minimize.
[2024-05-22 19:19:57] [INFO ] Deduced a trap composed of 5 places in 472 ms of which 3 ms to minimize.
SMT process timed out in 5526ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 18 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 13763 transition count 38322
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 13205 transition count 38322
Performed 6309 Post agglomeration using F-continuation condition.Transition count delta: 6309
Deduced a syphon composed of 6309 places in 19 ms
Reduce places removed 6309 places and 0 transitions.
Iterating global reduction 2 with 12618 rules applied. Total rules applied 13734 place count 6896 transition count 32013
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13737 place count 6896 transition count 32010
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 13740 place count 6893 transition count 32010
Partial Free-agglomeration rule applied 6476 times.
Drop transitions (Partial Free agglomeration) removed 6476 transitions
Iterating global reduction 3 with 6476 rules applied. Total rules applied 20216 place count 6893 transition count 32010
Applied a total of 20216 rules in 13253 ms. Remains 6893 /13763 variables (removed 6870) and now considering 32010/38880 (removed 6870) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13256 ms. Remains : 6893/13763 places, 32010/38880 transitions.
RANDOM walk for 40000 steps (80 resets) in 2543 ms. (15 steps per ms) remains 4/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
[2024-05-22 19:20:11] [INFO ] Flow matrix only has 32005 transitions (discarded 5 similar events)
// Phase 1: matrix 32005 rows 6893 cols
[2024-05-22 19:20:13] [INFO ] Computed 82 invariants in 2128 ms
[2024-05-22 19:20:14] [INFO ] State equation strengthened by 31728 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6727/6731 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 19:20:15] [INFO ] Deduced a trap composed of 2 places in 214 ms of which 2 ms to minimize.
[2024-05-22 19:20:15] [INFO ] Deduced a trap composed of 2 places in 206 ms of which 2 ms to minimize.
[2024-05-22 19:20:15] [INFO ] Deduced a trap composed of 2 places in 201 ms of which 2 ms to minimize.
[2024-05-22 19:20:15] [INFO ] Deduced a trap composed of 2 places in 186 ms of which 2 ms to minimize.
[2024-05-22 19:20:16] [INFO ] Deduced a trap composed of 2 places in 188 ms of which 1 ms to minimize.
[2024-05-22 19:20:16] [INFO ] Deduced a trap composed of 2 places in 191 ms of which 1 ms to minimize.
[2024-05-22 19:20:16] [INFO ] Deduced a trap composed of 2 places in 189 ms of which 2 ms to minimize.
[2024-05-22 19:20:17] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
[2024-05-22 19:20:17] [INFO ] Deduced a trap composed of 2 places in 188 ms of which 2 ms to minimize.
[2024-05-22 19:20:17] [INFO ] Deduced a trap composed of 2 places in 185 ms of which 1 ms to minimize.
[2024-05-22 19:20:17] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 1 ms to minimize.
[2024-05-22 19:20:18] [INFO ] Deduced a trap composed of 2 places in 187 ms of which 1 ms to minimize.
[2024-05-22 19:20:18] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 1 ms to minimize.
[2024-05-22 19:20:18] [INFO ] Deduced a trap composed of 2 places in 186 ms of which 1 ms to minimize.
[2024-05-22 19:20:18] [INFO ] Deduced a trap composed of 2 places in 185 ms of which 1 ms to minimize.
[2024-05-22 19:20:19] [INFO ] Deduced a trap composed of 2 places in 205 ms of which 1 ms to minimize.
[2024-05-22 19:20:19] [INFO ] Deduced a trap composed of 2 places in 194 ms of which 1 ms to minimize.
[2024-05-22 19:20:19] [INFO ] Deduced a trap composed of 2 places in 200 ms of which 2 ms to minimize.
[2024-05-22 19:20:20] [INFO ] Deduced a trap composed of 2 places in 184 ms of which 2 ms to minimize.
[2024-05-22 19:20:20] [INFO ] Deduced a trap composed of 2 places in 194 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6731 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 19:20:20] [INFO ] Deduced a trap composed of 2 places in 187 ms of which 1 ms to minimize.
[2024-05-22 19:20:20] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 2 ms to minimize.
[2024-05-22 19:20:21] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 1 ms to minimize.
[2024-05-22 19:20:21] [INFO ] Deduced a trap composed of 2 places in 185 ms of which 2 ms to minimize.
[2024-05-22 19:20:21] [INFO ] Deduced a trap composed of 2 places in 303 ms of which 2 ms to minimize.
[2024-05-22 19:20:22] [INFO ] Deduced a trap composed of 2 places in 189 ms of which 2 ms to minimize.
[2024-05-22 19:20:22] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 1 ms to minimize.
[2024-05-22 19:20:22] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 1 ms to minimize.
[2024-05-22 19:20:22] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 2 ms to minimize.
[2024-05-22 19:20:23] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 1 ms to minimize.
[2024-05-22 19:20:23] [INFO ] Deduced a trap composed of 2 places in 184 ms of which 2 ms to minimize.
[2024-05-22 19:20:23] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 1 ms to minimize.
[2024-05-22 19:20:23] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 1 ms to minimize.
[2024-05-22 19:20:24] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 1 ms to minimize.
[2024-05-22 19:20:24] [INFO ] Deduced a trap composed of 2 places in 185 ms of which 1 ms to minimize.
[2024-05-22 19:20:24] [INFO ] Deduced a trap composed of 2 places in 179 ms of which 1 ms to minimize.
[2024-05-22 19:20:25] [INFO ] Deduced a trap composed of 2 places in 195 ms of which 1 ms to minimize.
[2024-05-22 19:20:25] [INFO ] Deduced a trap composed of 2 places in 192 ms of which 1 ms to minimize.
[2024-05-22 19:20:25] [INFO ] Deduced a trap composed of 2 places in 189 ms of which 1 ms to minimize.
[2024-05-22 19:20:25] [INFO ] Deduced a trap composed of 2 places in 198 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/6731 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 19:20:26] [INFO ] Deduced a trap composed of 2 places in 186 ms of which 1 ms to minimize.
[2024-05-22 19:20:26] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
[2024-05-22 19:20:26] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 1 ms to minimize.
[2024-05-22 19:20:27] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
[2024-05-22 19:20:27] [INFO ] Deduced a trap composed of 2 places in 190 ms of which 1 ms to minimize.
[2024-05-22 19:20:27] [INFO ] Deduced a trap composed of 2 places in 188 ms of which 2 ms to minimize.
[2024-05-22 19:20:28] [INFO ] Deduced a trap composed of 2 places in 185 ms of which 1 ms to minimize.
[2024-05-22 19:20:28] [INFO ] Deduced a trap composed of 2 places in 184 ms of which 1 ms to minimize.
[2024-05-22 19:20:28] [INFO ] Deduced a trap composed of 2 places in 179 ms of which 1 ms to minimize.
[2024-05-22 19:20:28] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 1 ms to minimize.
[2024-05-22 19:20:29] [INFO ] Deduced a trap composed of 2 places in 179 ms of which 2 ms to minimize.
[2024-05-22 19:20:29] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 1 ms to minimize.
[2024-05-22 19:20:29] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 1 ms to minimize.
[2024-05-22 19:20:29] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 1 ms to minimize.
[2024-05-22 19:20:30] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
[2024-05-22 19:20:30] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-22 19:20:30] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-22 19:20:30] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
[2024-05-22 19:20:31] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 1 ms to minimize.
[2024-05-22 19:20:31] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/6731 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 19:20:31] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-22 19:20:32] [INFO ] Deduced a trap composed of 2 places in 186 ms of which 1 ms to minimize.
[2024-05-22 19:20:32] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-22 19:20:32] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 0 ms to minimize.
[2024-05-22 19:20:32] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-22 19:20:33] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-22 19:20:33] [INFO ] Deduced a trap composed of 2 places in 187 ms of which 1 ms to minimize.
[2024-05-22 19:20:33] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
[2024-05-22 19:20:33] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
[2024-05-22 19:20:34] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-22 19:20:34] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-22 19:20:34] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-22 19:20:34] [INFO ] Deduced a trap composed of 2 places in 164 ms of which 1 ms to minimize.
[2024-05-22 19:20:35] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
[2024-05-22 19:20:35] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-22 19:20:35] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 1 ms to minimize.
[2024-05-22 19:20:35] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-22 19:20:36] [INFO ] Deduced a trap composed of 2 places in 167 ms of which 1 ms to minimize.
[2024-05-22 19:20:36] [INFO ] Deduced a trap composed of 2 places in 165 ms of which 1 ms to minimize.
[2024-05-22 19:20:36] [INFO ] Deduced a trap composed of 2 places in 159 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/6731 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/6731 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 158/6889 variables, 79/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6889 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/6891 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6891 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 32005/38896 variables, 6891/7053 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 38896/38898 variables, and 38781 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45058 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6891/6893 constraints, ReadFeed: 31728/31728 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6727/6731 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6731 variables, 80/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6731 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 158/6889 variables, 79/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6889 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/6891 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 19:21:17] [INFO ] Deduced a trap composed of 87 places in 16138 ms of which 50 ms to minimize.
[2024-05-22 19:21:33] [INFO ] Deduced a trap composed of 93 places in 15073 ms of which 43 ms to minimize.
[2024-05-22 19:21:48] [INFO ] Deduced a trap composed of 90 places in 15118 ms of which 43 ms to minimize.
SMT process timed out in 96823ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 6893 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6893/6893 places, 32010/32010 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 8 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 6886 transition count 32003
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 6886 transition count 32003
Applied a total of 19 rules in 7312 ms. Remains 6886 /6893 variables (removed 7) and now considering 32003/32010 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7312 ms. Remains : 6886/6893 places, 32003/32010 transitions.
Computed a total of 322 stabilizing places and 560 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6318 Post agglomeration using F-continuation condition.Transition count delta: 6318
Deduced a syphon composed of 6318 places in 11 ms
Reduce places removed 6318 places and 0 transitions.
Iterating global reduction 2 with 12636 rules applied. Total rules applied 13756 place count 6885 transition count 32002
Applied a total of 13756 rules in 8130 ms. Remains 6885 /13763 variables (removed 6878) and now considering 32002/38880 (removed 6878) transitions.
[2024-05-22 19:22:04] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
// Phase 1: matrix 25842 rows 6885 cols
[2024-05-22 19:22:08] [INFO ] Computed 82 invariants in 4255 ms
[2024-05-22 19:22:19] [INFO ] Implicit Places using invariants in 15520 ms returned []
Implicit Place search using SMT only with invariants took 15524 ms to find 0 implicit places.
Running 31922 sub problems to find dead transitions.
[2024-05-22 19:22:20] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2024-05-22 19:22:20] [INFO ] Invariant cache hit.
[2024-05-22 19:22:20] [INFO ] State equation strengthened by 19116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6884 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31922 unsolved
SMT process timed out in 149263ms, After SMT, problems are : Problem set: 0 solved, 31922 unsolved
Search for dead transitions found 0 dead transitions in 149668ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6885/13763 places, 32002/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173383 ms. Remains : 6885/13763 places, 32002/38880 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-00
Stuttering criterion allowed to conclude after 376 steps with 0 reset in 23 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-00 finished in 173707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||(p0 U p1))))'
Support contains 4 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 478 transitions
Trivial Post-agglo rules discarded 478 transitions
Performed 478 trivial Post agglomeration. Transition count delta: 478
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 13763 transition count 38402
Reduce places removed 478 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 479 rules applied. Total rules applied 957 place count 13285 transition count 38401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 958 place count 13284 transition count 38401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 958 place count 13284 transition count 38400
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 960 place count 13283 transition count 38400
Performed 6319 Post agglomeration using F-continuation condition.Transition count delta: 6319
Deduced a syphon composed of 6319 places in 13 ms
Reduce places removed 6319 places and 0 transitions.
Iterating global reduction 3 with 12638 rules applied. Total rules applied 13598 place count 6964 transition count 32081
Applied a total of 13598 rules in 8641 ms. Remains 6964 /13763 variables (removed 6799) and now considering 32081/38880 (removed 6799) transitions.
[2024-05-22 19:24:58] [INFO ] Flow matrix only has 25919 transitions (discarded 6162 similar events)
// Phase 1: matrix 25919 rows 6964 cols
[2024-05-22 19:25:02] [INFO ] Computed 82 invariants in 4201 ms
[2024-05-22 19:25:13] [INFO ] Implicit Places using invariants in 15346 ms returned []
Implicit Place search using SMT only with invariants took 15347 ms to find 0 implicit places.
Running 32001 sub problems to find dead transitions.
[2024-05-22 19:25:14] [INFO ] Flow matrix only has 25919 transitions (discarded 6162 similar events)
[2024-05-22 19:25:14] [INFO ] Invariant cache hit.
[2024-05-22 19:25:14] [INFO ] State equation strengthened by 19117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6963 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 32001 unsolved
SMT process timed out in 126890ms, After SMT, problems are : Problem set: 0 solved, 32001 unsolved
Search for dead transitions found 0 dead transitions in 127156ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6964/13763 places, 32081/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151189 ms. Remains : 6964/13763 places, 32081/38880 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-01
Stuttering criterion allowed to conclude after 410 steps with 0 reset in 20 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-01 finished in 151352 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(p1))))'
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3230 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2024-05-22 19:27:34] [INFO ] Computed 82 invariants in 10257 ms
[2024-05-22 19:27:56] [INFO ] Implicit Places using invariants in 32012 ms returned []
Implicit Place search using SMT only with invariants took 32013 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2024-05-22 19:27:56] [INFO ] Invariant cache hit.
[2024-05-22 19:27:56] [INFO ] State equation strengthened by 12720 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13762 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 38800 unsolved
SMT process timed out in 202785ms, After SMT, problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 203086ms
Finished structural reductions in LTL mode , in 1 iterations and 238375 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-02 finished in 238580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6318 Post agglomeration using F-continuation condition.Transition count delta: 6318
Deduced a syphon composed of 6318 places in 12 ms
Reduce places removed 6318 places and 0 transitions.
Iterating global reduction 2 with 12636 rules applied. Total rules applied 13756 place count 6885 transition count 32002
Applied a total of 13756 rules in 7997 ms. Remains 6885 /13763 variables (removed 6878) and now considering 32002/38880 (removed 6878) transitions.
[2024-05-22 19:31:27] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
// Phase 1: matrix 25842 rows 6885 cols
[2024-05-22 19:31:31] [INFO ] Computed 82 invariants in 4093 ms
[2024-05-22 19:31:43] [INFO ] Implicit Places using invariants in 15320 ms returned []
Implicit Place search using SMT only with invariants took 15321 ms to find 0 implicit places.
Running 31922 sub problems to find dead transitions.
[2024-05-22 19:31:43] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2024-05-22 19:31:43] [INFO ] Invariant cache hit.
[2024-05-22 19:31:43] [INFO ] State equation strengthened by 19116 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/6884 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31922 unsolved
SMT process timed out in 127323ms, After SMT, problems are : Problem set: 0 solved, 31922 unsolved
Search for dead transitions found 0 dead transitions in 127588ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6885/13763 places, 32002/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150953 ms. Remains : 6885/13763 places, 32002/38880 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-03
Product exploration explored 100000 steps with 246 reset in 2880 ms.
Product exploration explored 100000 steps with 249 reset in 2972 ms.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 93 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 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (97 resets) in 1296 ms. (30 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
[2024-05-22 19:33:57] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2024-05-22 19:33:57] [INFO ] Invariant cache hit.
[2024-05-22 19:33:57] [INFO ] State equation strengthened by 19116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6722/6723 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:33:58] [INFO ] Deduced a trap composed of 2 places in 259 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6723 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6723 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 158/6881 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6881 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/6883 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:34:14] [INFO ] Deduced a trap composed of 99 places in 14995 ms of which 41 ms to minimize.
SMT process timed out in 17341ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 6885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 6884 transition count 32001
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 6884 transition count 32000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 6883 transition count 32000
Partial Free-agglomeration rule applied 6481 times.
Drop transitions (Partial Free agglomeration) removed 6481 transitions
Iterating global reduction 1 with 6481 rules applied. Total rules applied 6485 place count 6883 transition count 32000
Applied a total of 6485 rules in 7152 ms. Remains 6883 /6885 variables (removed 2) and now considering 32000/32002 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7153 ms. Remains : 6883/6885 places, 32000/32002 transitions.
RANDOM walk for 36553 steps (75 resets) in 1915 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 216 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 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 6885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Applied a total of 0 rules in 1641 ms. Remains 6885 /6885 variables (removed 0) and now considering 32002/32002 (removed 0) transitions.
[2024-05-22 19:34:24] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2024-05-22 19:34:24] [INFO ] Invariant cache hit.
[2024-05-22 19:34:35] [INFO ] Implicit Places using invariants in 11065 ms returned []
Implicit Place search using SMT only with invariants took 11066 ms to find 0 implicit places.
Running 31922 sub problems to find dead transitions.
[2024-05-22 19:34:35] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2024-05-22 19:34:35] [INFO ] Invariant cache hit.
[2024-05-22 19:34:36] [INFO ] State equation strengthened by 19116 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/6884 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31922 unsolved
SMT process timed out in 130607ms, After SMT, problems are : Problem set: 0 solved, 31922 unsolved
Search for dead transitions found 0 dead transitions in 130872ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 143632 ms. Remains : 6885/6885 places, 32002/32002 transitions.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 95 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 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (96 resets) in 2071 ms. (19 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 55082 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 3
Probabilistic random walk after 55082 steps, saw 46268 distinct states, run finished after 3005 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-22 19:36:50] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2024-05-22 19:36:50] [INFO ] Invariant cache hit.
[2024-05-22 19:36:50] [INFO ] State equation strengthened by 19116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6721/6723 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 19:36:51] [INFO ] Deduced a trap composed of 2 places in 253 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6723 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6723 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 158/6881 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6881 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/6883 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 19:37:09] [INFO ] Deduced a trap composed of 87 places in 15934 ms of which 39 ms to minimize.
SMT process timed out in 18819ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 6885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6885 transition count 32001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 6481 times.
Drop transitions (Partial Free agglomeration) removed 6481 transitions
Iterating global reduction 1 with 6481 rules applied. Total rules applied 6483 place count 6884 transition count 32001
Applied a total of 6483 rules in 5490 ms. Remains 6884 /6885 variables (removed 1) and now considering 32001/32002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5491 ms. Remains : 6884/6885 places, 32001/32002 transitions.
RANDOM walk for 40000 steps (81 resets) in 1890 ms. (21 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 71577 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 3
Probabilistic random walk after 71577 steps, saw 63689 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
// Phase 1: matrix 32001 rows 6884 cols
[2024-05-22 19:37:20] [INFO ] Computed 82 invariants in 2262 ms
[2024-05-22 19:37:21] [INFO ] State equation strengthened by 31756 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6720/6722 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 19:37:22] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6722 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6722 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 158/6880 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6880 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/6882 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 19:37:40] [INFO ] Deduced a trap composed of 97 places in 16245 ms of which 49 ms to minimize.
[2024-05-22 19:37:56] [INFO ] Deduced a trap composed of 96 places in 16309 ms of which 44 ms to minimize.
[2024-05-22 19:38:12] [INFO ] Deduced a trap composed of 140 places in 15378 ms of which 43 ms to minimize.
SMT process timed out in 53391ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 1983 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1983 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 1991 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
[2024-05-22 19:38:15] [INFO ] Invariant cache hit.
[2024-05-22 19:38:33] [INFO ] Implicit Places using invariants in 17228 ms returned []
Implicit Place search using SMT only with invariants took 17232 ms to find 0 implicit places.
Running 31921 sub problems to find dead transitions.
[2024-05-22 19:38:33] [INFO ] Invariant cache hit.
[2024-05-22 19:38:33] [INFO ] State equation strengthened by 31756 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/6883 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31921 unsolved
SMT process timed out in 138578ms, After SMT, problems are : Problem set: 0 solved, 31921 unsolved
Search for dead transitions found 0 dead transitions in 138833ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158198 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 92 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 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 248 reset in 2982 ms.
Product exploration explored 100000 steps with 250 reset in 2722 ms.
Support contains 2 out of 6885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Applied a total of 0 rules in 1721 ms. Remains 6885 /6885 variables (removed 0) and now considering 32002/32002 (removed 0) transitions.
[2024-05-22 19:40:59] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
// Phase 1: matrix 25842 rows 6885 cols
[2024-05-22 19:41:04] [INFO ] Computed 82 invariants in 4063 ms
[2024-05-22 19:41:15] [INFO ] Implicit Places using invariants in 15223 ms returned []
Implicit Place search using SMT only with invariants took 15224 ms to find 0 implicit places.
Running 31922 sub problems to find dead transitions.
[2024-05-22 19:41:15] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2024-05-22 19:41:15] [INFO ] Invariant cache hit.
[2024-05-22 19:41:15] [INFO ] State equation strengthened by 19116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6884 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31922 unsolved
SMT process timed out in 131609ms, After SMT, problems are : Problem set: 0 solved, 31922 unsolved
Search for dead transitions found 0 dead transitions in 131878ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 148859 ms. Remains : 6885/6885 places, 32002/32002 transitions.
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-03 finished in 728435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))) U (G((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))||(G(p2)&&(X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))))))'
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3542 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2024-05-22 19:43:40] [INFO ] Computed 82 invariants in 8484 ms
[2024-05-22 19:44:00] [INFO ] Implicit Places using invariants in 29063 ms returned []
Implicit Place search using SMT only with invariants took 29063 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2024-05-22 19:44:01] [INFO ] Invariant cache hit.
[2024-05-22 19:44:01] [INFO ] State equation strengthened by 12720 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13762/52643 variables, and 80 constraints, problems are : Problem set: 0 solved, 38800 unsolved in 30439 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 38800/38800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 13762/52643 variables, and 80 constraints, problems are : Problem set: 0 solved, 38800 unsolved in 30425 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 0/38800 constraints, Known Traps: 0/0 constraints]
After SMT, in 220797ms problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 221113ms
Finished structural reductions in LTL mode , in 1 iterations and 253762 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 257 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-04
Product exploration explored 100000 steps with 33342 reset in 4596 ms.
Product exploration explored 100000 steps with 33459 reset in 4269 ms.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 212 ms. Reduced automaton from 6 states, 26 edges and 3 AP (stutter sensitive) to 6 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
RANDOM walk for 40000 steps (19 resets) in 1527 ms. (26 steps per ms) remains 10/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
[2024-05-22 19:47:52] [INFO ] Invariant cache hit.
[2024-05-22 19:47:52] [INFO ] State equation strengthened by 12720 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 13601/13607 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 19:47:55] [INFO ] Deduced a trap composed of 5 places in 425 ms of which 3 ms to minimize.
[2024-05-22 19:47:55] [INFO ] Deduced a trap composed of 5 places in 435 ms of which 3 ms to minimize.
[2024-05-22 19:47:56] [INFO ] Deduced a trap composed of 5 places in 420 ms of which 4 ms to minimize.
[2024-05-22 19:47:56] [INFO ] Deduced a trap composed of 5 places in 423 ms of which 3 ms to minimize.
[2024-05-22 19:47:57] [INFO ] Deduced a trap composed of 5 places in 426 ms of which 3 ms to minimize.
[2024-05-22 19:47:58] [INFO ] Deduced a trap composed of 5 places in 433 ms of which 3 ms to minimize.
SMT process timed out in 5372ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 555 transitions
Trivial Post-agglo rules discarded 555 transitions
Performed 555 trivial Post agglomeration. Transition count delta: 555
Iterating post reduction 0 with 555 rules applied. Total rules applied 555 place count 13763 transition count 38325
Reduce places removed 555 places and 0 transitions.
Iterating post reduction 1 with 555 rules applied. Total rules applied 1110 place count 13208 transition count 38325
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1110 place count 13208 transition count 38323
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1114 place count 13206 transition count 38323
Performed 6318 Post agglomeration using F-continuation condition.Transition count delta: 6318
Deduced a syphon composed of 6318 places in 13 ms
Reduce places removed 6318 places and 0 transitions.
Iterating global reduction 2 with 12636 rules applied. Total rules applied 13750 place count 6888 transition count 32005
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13754 place count 6888 transition count 32001
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 13758 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 6482 times.
Drop transitions (Partial Free agglomeration) removed 6482 transitions
Iterating global reduction 3 with 6482 rules applied. Total rules applied 20240 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 160 times.
Drop transitions (Partial Free agglomeration) removed 160 transitions
Iterating global reduction 3 with 160 rules applied. Total rules applied 20400 place count 6884 transition count 32001
Applied a total of 20400 rules in 15877 ms. Remains 6884 /13763 variables (removed 6879) and now considering 32001/38880 (removed 6879) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15877 ms. Remains : 6884/13763 places, 32001/38880 transitions.
RANDOM walk for 40000 steps (81 resets) in 3919 ms. (10 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
[2024-05-22 19:48:15] [INFO ] Flow matrix only has 32000 transitions (discarded 1 similar events)
// Phase 1: matrix 32000 rows 6884 cols
[2024-05-22 19:48:17] [INFO ] Computed 82 invariants in 2113 ms
[2024-05-22 19:48:17] [INFO ] State equation strengthened by 31758 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6722/6728 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 19:48:19] [INFO ] Deduced a trap composed of 2 places in 194 ms of which 2 ms to minimize.
[2024-05-22 19:48:19] [INFO ] Deduced a trap composed of 2 places in 196 ms of which 2 ms to minimize.
[2024-05-22 19:48:19] [INFO ] Deduced a trap composed of 2 places in 192 ms of which 1 ms to minimize.
[2024-05-22 19:48:19] [INFO ] Deduced a trap composed of 2 places in 198 ms of which 2 ms to minimize.
[2024-05-22 19:48:20] [INFO ] Deduced a trap composed of 2 places in 194 ms of which 2 ms to minimize.
[2024-05-22 19:48:20] [INFO ] Deduced a trap composed of 2 places in 200 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6728 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6728 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 152/6880 variables, 76/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6880 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/6882 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6882 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 32000/38882 variables, 6882/6970 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 38882/38884 variables, and 38728 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45091 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6882/6884 constraints, ReadFeed: 31758/31758 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6722/6728 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6728 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6728 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 152/6880 variables, 76/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6880 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/6882 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6882 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 32000/38882 variables, 6882/6970 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38882 variables, 31758/38728 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38882 variables, 6/38734 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 38882/38884 variables, and 38734 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45034 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6882/6884 constraints, ReadFeed: 31758/31758 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 92675ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2107 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2107 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p2) p0))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR p2 p0 (NOT p1)))), (F p2), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 25 factoid took 442 ms. Reduced automaton from 6 states, 26 edges and 3 AP (stutter sensitive) to 6 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
Stuttering acceptance computed with spot in 215 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3526 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2024-05-22 19:50:03] [INFO ] Computed 82 invariants in 8856 ms
[2024-05-22 19:50:24] [INFO ] Implicit Places using invariants in 30070 ms returned []
Implicit Place search using SMT only with invariants took 30071 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2024-05-22 19:50:25] [INFO ] Invariant cache hit.
[2024-05-22 19:50:25] [INFO ] State equation strengthened by 12720 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CANInsertWithFailure-PT-080
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 13764
TRANSITIONS: 38880
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.857s, Sys 0.084s]
SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.150s, Sys 0.007s]
----------------------------------------------------------------------
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: 1392
MODEL NAME: /home/mcc/execution/model
13764 places, 38880 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------
BK_STOP 1716408652921
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-080"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CANInsertWithFailure-PT-080, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620503900156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-080.tgz
mv CANInsertWithFailure-PT-080 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;