Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695100739.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANInsertWithFailure-PT-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100739
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.8K Feb 26 00:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 00:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 00:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 01:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 00:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 00:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 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-050-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678662312123

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 23:05:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 23:05:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 23:05:14] [INFO ] Load time of PNML (sax parser for PT used): 487 ms
[2023-03-12 23:05:14] [INFO ] Transformed 5604 places.
[2023-03-12 23:05:14] [INFO ] Transformed 15300 transitions.
[2023-03-12 23:05:15] [INFO ] Parsed PT model containing 5604 places and 15300 transitions and 41000 arcs in 618 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 5604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5604/5604 places, 15300/15300 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5603 transition count 15300
Applied a total of 1 rules in 894 ms. Remains 5603 /5604 variables (removed 1) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-12 23:05:17] [INFO ] Computed 52 place invariants in 1194 ms
[2023-03-12 23:05:18] [INFO ] Implicit Places using invariants in 2428 ms returned []
Implicit Place search using SMT only with invariants took 2471 ms to find 0 implicit places.
[2023-03-12 23:05:18] [INFO ] Invariant cache hit.
[2023-03-12 23:05:27] [INFO ] Dead Transitions using invariants and state equation in 8698 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5603/5604 places, 15300/15300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12072 ms. Remains : 5603/5604 places, 15300/15300 transitions.
Support contains 33 out of 5603 places after structural reductions.
[2023-03-12 23:05:28] [INFO ] Flatten gal took : 688 ms
[2023-03-12 23:05:28] [INFO ] Flatten gal took : 360 ms
[2023-03-12 23:05:29] [INFO ] Input system was already deterministic with 15300 transitions.
Support contains 30 out of 5603 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 792 ms. (steps per millisecond=12 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-12 23:05:30] [INFO ] Invariant cache hit.
[2023-03-12 23:05:33] [INFO ] [Real]Absence check using 50 positive place invariants in 102 ms returned sat
[2023-03-12 23:05:33] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 92 ms returned sat
[2023-03-12 23:05:33] [INFO ] After 2766ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-12 23:05:35] [INFO ] [Nat]Absence check using 50 positive place invariants in 78 ms returned sat
[2023-03-12 23:05:35] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 89 ms returned sat
[2023-03-12 23:05:52] [INFO ] After 15014ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-12 23:05:52] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-12 23:05:58] [INFO ] After 5836ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-12 23:05:58] [INFO ] After 5837ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-12 23:05:58] [INFO ] After 25122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 1 properties in 1071 ms.
Support contains 23 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 346 transitions
Trivial Post-agglo rules discarded 346 transitions
Performed 346 trivial Post agglomeration. Transition count delta: 346
Iterating post reduction 0 with 346 rules applied. Total rules applied 346 place count 5603 transition count 14954
Reduce places removed 346 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 347 rules applied. Total rules applied 693 place count 5257 transition count 14953
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 694 place count 5256 transition count 14953
Performed 2391 Post agglomeration using F-continuation condition.Transition count delta: 2391
Deduced a syphon composed of 2391 places in 7 ms
Reduce places removed 2391 places and 0 transitions.
Iterating global reduction 3 with 4782 rules applied. Total rules applied 5476 place count 2865 transition count 12562
Drop transitions removed 2294 transitions
Redundant transition composition rules discarded 2294 transitions
Iterating global reduction 3 with 2294 rules applied. Total rules applied 7770 place count 2865 transition count 10268
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7771 place count 2865 transition count 10267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7772 place count 2864 transition count 10267
Partial Free-agglomeration rule applied 2686 times.
Drop transitions removed 2686 transitions
Iterating global reduction 4 with 2686 rules applied. Total rules applied 10458 place count 2864 transition count 10267
Applied a total of 10458 rules in 3636 ms. Remains 2864 /5603 variables (removed 2739) and now considering 10267/15300 (removed 5033) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3638 ms. Remains : 2864/5603 places, 10267/15300 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 10267 rows 2864 cols
[2023-03-12 23:06:04] [INFO ] Computed 52 place invariants in 492 ms
[2023-03-12 23:06:05] [INFO ] [Real]Absence check using 50 positive place invariants in 30 ms returned sat
[2023-03-12 23:06:05] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 38 ms returned sat
[2023-03-12 23:06:05] [INFO ] After 1008ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 23:06:06] [INFO ] [Nat]Absence check using 50 positive place invariants in 28 ms returned sat
[2023-03-12 23:06:06] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 36 ms returned sat
[2023-03-12 23:06:11] [INFO ] After 4685ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 23:06:11] [INFO ] State equation strengthened by 10025 read => feed constraints.
[2023-03-12 23:06:18] [INFO ] After 6880ms SMT Verify possible using 10025 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-12 23:06:24] [INFO ] After 12717ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 4318 ms.
[2023-03-12 23:06:28] [INFO ] After 22761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 244 ms.
Support contains 15 out of 2864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2864/2864 places, 10267/10267 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2864 transition count 10266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2863 transition count 10266
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 2861 transition count 10264
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 2861 transition count 10264
Applied a total of 11 rules in 1409 ms. Remains 2861 /2864 variables (removed 3) and now considering 10264/10267 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1409 ms. Remains : 2861/2864 places, 10264/10267 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 10264 rows 2861 cols
[2023-03-12 23:06:31] [INFO ] Computed 52 place invariants in 563 ms
[2023-03-12 23:06:31] [INFO ] [Real]Absence check using 51 positive place invariants in 12 ms returned sat
[2023-03-12 23:06:31] [INFO ] [Real]Absence check using 51 positive and 1 generalized place invariants in 19 ms returned sat
[2023-03-12 23:06:36] [INFO ] After 4813ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:5
[2023-03-12 23:06:36] [INFO ] State equation strengthened by 10034 read => feed constraints.
[2023-03-12 23:06:39] [INFO ] After 2438ms SMT Verify possible using 10034 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 23:06:39] [INFO ] After 8170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 23:06:39] [INFO ] [Nat]Absence check using 51 positive place invariants in 11 ms returned sat
[2023-03-12 23:06:39] [INFO ] [Nat]Absence check using 51 positive and 1 generalized place invariants in 18 ms returned sat
[2023-03-12 23:06:45] [INFO ] After 5745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 23:06:50] [INFO ] After 4541ms SMT Verify possible using 10034 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 23:06:55] [INFO ] After 9630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 3198 ms.
[2023-03-12 23:06:58] [INFO ] After 19381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 168 ms.
Support contains 12 out of 2861 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2861/2861 places, 10264/10264 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2859 transition count 10262
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 2859 transition count 10262
Applied a total of 5 rules in 1179 ms. Remains 2859 /2861 variables (removed 2) and now considering 10262/10264 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1180 ms. Remains : 2859/2861 places, 10262/10264 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 72297 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72297 steps, saw 28694 distinct states, run finished after 3003 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 10262 rows 2859 cols
[2023-03-12 23:07:03] [INFO ] Computed 52 place invariants in 383 ms
[2023-03-12 23:07:04] [INFO ] [Real]Absence check using 50 positive place invariants in 48 ms returned sat
[2023-03-12 23:07:04] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 52 ms returned sat
[2023-03-12 23:07:04] [INFO ] After 997ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 23:07:05] [INFO ] [Nat]Absence check using 50 positive place invariants in 30 ms returned sat
[2023-03-12 23:07:05] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 38 ms returned sat
[2023-03-12 23:07:11] [INFO ] After 5772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 23:07:11] [INFO ] State equation strengthened by 10039 read => feed constraints.
[2023-03-12 23:07:17] [INFO ] After 5316ms SMT Verify possible using 10039 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 23:07:22] [INFO ] After 10333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 3274 ms.
[2023-03-12 23:07:25] [INFO ] After 20563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 120 ms.
Support contains 12 out of 2859 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2859/2859 places, 10262/10262 transitions.
Applied a total of 0 rules in 494 ms. Remains 2859 /2859 variables (removed 0) and now considering 10262/10262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 494 ms. Remains : 2859/2859 places, 10262/10262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2859/2859 places, 10262/10262 transitions.
Applied a total of 0 rules in 409 ms. Remains 2859 /2859 variables (removed 0) and now considering 10262/10262 (removed 0) transitions.
[2023-03-12 23:07:26] [INFO ] Invariant cache hit.
[2023-03-12 23:07:30] [INFO ] Implicit Places using invariants in 3608 ms returned []
Implicit Place search using SMT only with invariants took 3609 ms to find 0 implicit places.
[2023-03-12 23:07:30] [INFO ] Invariant cache hit.
[2023-03-12 23:07:34] [INFO ] Dead Transitions using invariants and state equation in 4830 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8852 ms. Remains : 2859/2859 places, 10262/10262 transitions.
Computed a total of 202 stabilizing places and 350 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2449 Post agglomeration using F-continuation condition.Transition count delta: 2449
Deduced a syphon composed of 2449 places in 5 ms
Reduce places removed 2449 places and 0 transitions.
Iterating global reduction 2 with 4898 rules applied. Total rules applied 5598 place count 2804 transition count 12501
Drop transitions removed 2351 transitions
Redundant transition composition rules discarded 2351 transitions
Iterating global reduction 2 with 2351 rules applied. Total rules applied 7949 place count 2804 transition count 10150
Applied a total of 7949 rules in 2237 ms. Remains 2804 /5603 variables (removed 2799) and now considering 10150/15300 (removed 5150) transitions.
// Phase 1: matrix 10150 rows 2804 cols
[2023-03-12 23:07:37] [INFO ] Computed 52 place invariants in 285 ms
[2023-03-12 23:07:39] [INFO ] Implicit Places using invariants in 2299 ms returned []
Implicit Place search using SMT only with invariants took 2300 ms to find 0 implicit places.
[2023-03-12 23:07:39] [INFO ] Invariant cache hit.
[2023-03-12 23:07:44] [INFO ] Dead Transitions using invariants and state equation in 5014 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5603 places, 10150/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9556 ms. Remains : 2804/5603 places, 10150/15300 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 3 s2276) (LEQ 2 s2062))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 224 steps with 0 reset in 17 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-01 finished in 9825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||F(p1))))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 583 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-12 23:07:46] [INFO ] Computed 52 place invariants in 1082 ms
[2023-03-12 23:07:47] [INFO ] Implicit Places using invariants in 1753 ms returned []
Implicit Place search using SMT only with invariants took 1754 ms to find 0 implicit places.
[2023-03-12 23:07:47] [INFO ] Invariant cache hit.
[2023-03-12 23:07:55] [INFO ] Dead Transitions using invariants and state equation in 7771 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10117 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s1064 s3496), p0:(LEQ 1 s4729)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 83 reset in 1188 ms.
Product exploration explored 100000 steps with 81 reset in 1385 ms.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 69037 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69037 steps, saw 59681 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 23:08:01] [INFO ] Invariant cache hit.
[2023-03-12 23:08:02] [INFO ] After 718ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 23:08:03] [INFO ] [Nat]Absence check using 50 positive place invariants in 97 ms returned sat
[2023-03-12 23:08:03] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 115 ms returned sat
[2023-03-12 23:08:11] [INFO ] After 7904ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 23:08:11] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-12 23:08:23] [INFO ] After 12478ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:08:24] [INFO ] After 13209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 429 ms.
[2023-03-12 23:08:25] [INFO ] After 22692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 32 ms.
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2448 Post agglomeration using F-continuation condition.Transition count delta: 2448
Deduced a syphon composed of 2448 places in 4 ms
Reduce places removed 2448 places and 0 transitions.
Iterating global reduction 2 with 4896 rules applied. Total rules applied 5596 place count 2805 transition count 12502
Drop transitions removed 2350 transitions
Redundant transition composition rules discarded 2350 transitions
Iterating global reduction 2 with 2350 rules applied. Total rules applied 7946 place count 2805 transition count 10152
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7947 place count 2805 transition count 10151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7948 place count 2804 transition count 10151
Partial Free-agglomeration rule applied 2550 times.
Drop transitions removed 2550 transitions
Iterating global reduction 3 with 2550 rules applied. Total rules applied 10498 place count 2804 transition count 10151
Applied a total of 10498 rules in 2991 ms. Remains 2804 /5603 variables (removed 2799) and now considering 10151/15300 (removed 5149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2993 ms. Remains : 2804/5603 places, 10151/15300 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 74633 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74633 steps, saw 27937 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10151 rows 2804 cols
[2023-03-12 23:08:31] [INFO ] Computed 52 place invariants in 443 ms
[2023-03-12 23:08:32] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 23:08:32] [INFO ] [Nat]Absence check using 50 positive place invariants in 26 ms returned sat
[2023-03-12 23:08:32] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 36 ms returned sat
[2023-03-12 23:08:36] [INFO ] After 4021ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 23:08:36] [INFO ] State equation strengthened by 9995 read => feed constraints.
[2023-03-12 23:08:39] [INFO ] After 2457ms SMT Verify possible using 9995 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 23:08:40] [INFO ] After 3511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 675 ms.
[2023-03-12 23:08:41] [INFO ] After 8812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 56 steps, including 2 resets, run visited all 2 properties in 3 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 638 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-12 23:08:43] [INFO ] Computed 52 place invariants in 1200 ms
[2023-03-12 23:08:44] [INFO ] Implicit Places using invariants in 2285 ms returned []
Implicit Place search using SMT only with invariants took 2286 ms to find 0 implicit places.
[2023-03-12 23:08:44] [INFO ] Invariant cache hit.
[2023-03-12 23:08:52] [INFO ] Dead Transitions using invariants and state equation in 7752 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10678 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 71927 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71927 steps, saw 60590 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 23:08:55] [INFO ] Invariant cache hit.
[2023-03-12 23:08:56] [INFO ] After 749ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 23:08:57] [INFO ] [Nat]Absence check using 50 positive place invariants in 51 ms returned sat
[2023-03-12 23:08:57] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 80 ms returned sat
[2023-03-12 23:09:05] [INFO ] After 7884ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 23:09:05] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-12 23:09:21] [INFO ] After 15826ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:09:28] [INFO ] Deduced a trap composed of 5 places in 7198 ms of which 11 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 23:09:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 23:09:28] [INFO ] After 32268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Finished Parikh walk after 28 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=14 )
Parikh walk visited 2 properties in 25 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 83 reset in 1187 ms.
Product exploration explored 100000 steps with 84 reset in 1055 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Performed 250 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 5603 transition count 15300
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 50 Pre rules applied. Total rules applied 250 place count 5603 transition count 15300
Deduced a syphon composed of 300 places in 4 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 300 place count 5603 transition count 15300
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 400 place count 5503 transition count 15200
Deduced a syphon composed of 200 places in 3 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 500 place count 5503 transition count 15200
Performed 2498 Post agglomeration using F-continuation condition.Transition count delta: -4796
Deduced a syphon composed of 2698 places in 5 ms
Iterating global reduction 1 with 2498 rules applied. Total rules applied 2998 place count 5503 transition count 19996
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 3198 place count 5303 transition count 19796
Deduced a syphon composed of 2498 places in 3 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 3398 place count 5303 transition count 19796
Deduced a syphon composed of 2498 places in 3 ms
Drop transitions removed 2350 transitions
Redundant transition composition rules discarded 2350 transitions
Iterating global reduction 1 with 2350 rules applied. Total rules applied 5748 place count 5303 transition count 17446
Deduced a syphon composed of 2498 places in 3 ms
Applied a total of 5748 rules in 5467 ms. Remains 5303 /5603 variables (removed 300) and now considering 17446/15300 (removed -2146) transitions.
// Phase 1: matrix 17446 rows 5303 cols
[2023-03-12 23:09:38] [INFO ] Computed 52 place invariants in 1260 ms
[2023-03-12 23:09:48] [INFO ] Dead Transitions using invariants and state equation in 11347 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5303/5603 places, 17446/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16817 ms. Remains : 5303/5603 places, 17446/15300 transitions.
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 770 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-12 23:09:50] [INFO ] Computed 52 place invariants in 1075 ms
[2023-03-12 23:09:51] [INFO ] Implicit Places using invariants in 2169 ms returned []
Implicit Place search using SMT only with invariants took 2169 ms to find 0 implicit places.
[2023-03-12 23:09:51] [INFO ] Invariant cache hit.
[2023-03-12 23:09:59] [INFO ] Dead Transitions using invariants and state equation in 8168 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11108 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-03 finished in 135359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2450 Post agglomeration using F-continuation condition.Transition count delta: 2450
Deduced a syphon composed of 2450 places in 5 ms
Reduce places removed 2450 places and 0 transitions.
Iterating global reduction 2 with 4900 rules applied. Total rules applied 5600 place count 2803 transition count 12500
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 2 with 2352 rules applied. Total rules applied 7952 place count 2803 transition count 10148
Applied a total of 7952 rules in 2670 ms. Remains 2803 /5603 variables (removed 2800) and now considering 10148/15300 (removed 5152) transitions.
// Phase 1: matrix 10148 rows 2803 cols
[2023-03-12 23:10:03] [INFO ] Computed 52 place invariants in 382 ms
[2023-03-12 23:10:05] [INFO ] Implicit Places using invariants in 2059 ms returned []
Implicit Place search using SMT only with invariants took 2060 ms to find 0 implicit places.
[2023-03-12 23:10:05] [INFO ] Invariant cache hit.
[2023-03-12 23:10:09] [INFO ] Dead Transitions using invariants and state equation in 4075 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2803/5603 places, 10148/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8808 ms. Remains : 2803/5603 places, 10148/15300 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1984 s867)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 249 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-04 finished in 8874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 5 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 347 rules applied. Total rules applied 347 place count 5603 transition count 14953
Reduce places removed 347 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 348 rules applied. Total rules applied 695 place count 5256 transition count 14952
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 696 place count 5255 transition count 14952
Performed 2447 Post agglomeration using F-continuation condition.Transition count delta: 2447
Deduced a syphon composed of 2447 places in 3 ms
Reduce places removed 2447 places and 0 transitions.
Iterating global reduction 3 with 4894 rules applied. Total rules applied 5590 place count 2808 transition count 12505
Drop transitions removed 2349 transitions
Redundant transition composition rules discarded 2349 transitions
Iterating global reduction 3 with 2349 rules applied. Total rules applied 7939 place count 2808 transition count 10156
Applied a total of 7939 rules in 2651 ms. Remains 2808 /5603 variables (removed 2795) and now considering 10156/15300 (removed 5144) transitions.
// Phase 1: matrix 10156 rows 2808 cols
[2023-03-12 23:10:12] [INFO ] Computed 52 place invariants in 399 ms
[2023-03-12 23:10:14] [INFO ] Implicit Places using invariants in 2673 ms returned []
Implicit Place search using SMT only with invariants took 2673 ms to find 0 implicit places.
[2023-03-12 23:10:14] [INFO ] Invariant cache hit.
[2023-03-12 23:10:19] [INFO ] Dead Transitions using invariants and state equation in 4404 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2808/5603 places, 10156/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9730 ms. Remains : 2808/5603 places, 10156/15300 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LEQ 1 s1359) (LEQ s2505 s867)), p0:(LEQ s2515 s71)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 249 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-07 finished in 9827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 673 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-12 23:10:20] [INFO ] Computed 52 place invariants in 1161 ms
[2023-03-12 23:10:22] [INFO ] Implicit Places using invariants in 2211 ms returned []
Implicit Place search using SMT only with invariants took 2212 ms to find 0 implicit places.
[2023-03-12 23:10:22] [INFO ] Invariant cache hit.
[2023-03-12 23:10:29] [INFO ] Dead Transitions using invariants and state equation in 7703 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10590 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s366 s4437)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-08 finished in 10721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U (p1||G((p2||G(p3))))))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2450 Post agglomeration using F-continuation condition.Transition count delta: 2450
Deduced a syphon composed of 2450 places in 4 ms
Reduce places removed 2450 places and 0 transitions.
Iterating global reduction 2 with 4900 rules applied. Total rules applied 5600 place count 2803 transition count 12500
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 2 with 2352 rules applied. Total rules applied 7952 place count 2803 transition count 10148
Applied a total of 7952 rules in 2509 ms. Remains 2803 /5603 variables (removed 2800) and now considering 10148/15300 (removed 5152) transitions.
// Phase 1: matrix 10148 rows 2803 cols
[2023-03-12 23:10:32] [INFO ] Computed 52 place invariants in 311 ms
[2023-03-12 23:10:34] [INFO ] Implicit Places using invariants in 2425 ms returned []
Implicit Place search using SMT only with invariants took 2426 ms to find 0 implicit places.
[2023-03-12 23:10:34] [INFO ] Invariant cache hit.
[2023-03-12 23:10:39] [INFO ] Dead Transitions using invariants and state equation in 4679 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2803/5603 places, 10148/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9615 ms. Remains : 2803/5603 places, 10148/15300 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), p0, p0, (AND p0 (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p3) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={1} source=0 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) p0), acceptance={} source=3 dest: 1}, { cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 3 s752), p2:(LEQ 1 s390), p3:(LEQ s1032 s1038), p0:(OR (LEQ 3 s752) (LEQ s1032 s1038))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 4894 steps with 19 reset in 76 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-09 finished in 9888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 5603 transition count 14952
Reduce places removed 348 places and 0 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 696 place count 5255 transition count 14952
Performed 2450 Post agglomeration using F-continuation condition.Transition count delta: 2450
Deduced a syphon composed of 2450 places in 4 ms
Reduce places removed 2450 places and 0 transitions.
Iterating global reduction 2 with 4900 rules applied. Total rules applied 5596 place count 2805 transition count 12502
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 2 with 2352 rules applied. Total rules applied 7948 place count 2805 transition count 10150
Applied a total of 7948 rules in 2572 ms. Remains 2805 /5603 variables (removed 2798) and now considering 10150/15300 (removed 5150) transitions.
// Phase 1: matrix 10150 rows 2805 cols
[2023-03-12 23:10:42] [INFO ] Computed 52 place invariants in 357 ms
[2023-03-12 23:10:44] [INFO ] Implicit Places using invariants in 2435 ms returned []
Implicit Place search using SMT only with invariants took 2437 ms to find 0 implicit places.
[2023-03-12 23:10:44] [INFO ] Invariant cache hit.
[2023-03-12 23:10:49] [INFO ] Dead Transitions using invariants and state equation in 4840 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2805/5603 places, 10150/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9851 ms. Remains : 2805/5603 places, 10150/15300 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT 3 s1662) (GT s2368 s119)), p0:(GT s2368 s119)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 289 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-10 finished in 9944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p1&&X((p1 U (p2||G(p1)))))||p0)))))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 689 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-12 23:10:51] [INFO ] Computed 52 place invariants in 1172 ms
[2023-03-12 23:10:52] [INFO ] Implicit Places using invariants in 2222 ms returned []
Implicit Place search using SMT only with invariants took 2224 ms to find 0 implicit places.
[2023-03-12 23:10:52] [INFO ] Invariant cache hit.
[2023-03-12 23:11:00] [INFO ] Dead Transitions using invariants and state equation in 7838 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10755 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (GT s336 s4662) (GT 2 s1128)), p1:(GT 3 s3110), p2:(GT 2 s1128)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 82 reset in 1044 ms.
Product exploration explored 100000 steps with 80 reset in 1063 ms.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 70034 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70034 steps, saw 60028 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 23:11:06] [INFO ] Invariant cache hit.
[2023-03-12 23:11:07] [INFO ] [Real]Absence check using 50 positive place invariants in 84 ms returned sat
[2023-03-12 23:11:07] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 119 ms returned sat
[2023-03-12 23:11:17] [INFO ] After 10557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:11:18] [INFO ] [Nat]Absence check using 50 positive place invariants in 64 ms returned sat
[2023-03-12 23:11:18] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 86 ms returned sat
[2023-03-12 23:11:31] [INFO ] After 12446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:11:31] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-12 23:11:42] [INFO ] After 10895ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 23:11:42] [INFO ] After 10896ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 23:11:42] [INFO ] After 25136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 249 ms.
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2398 Post agglomeration using F-continuation condition.Transition count delta: 2398
Deduced a syphon composed of 2398 places in 4 ms
Reduce places removed 2398 places and 0 transitions.
Iterating global reduction 2 with 4796 rules applied. Total rules applied 5496 place count 2855 transition count 12552
Drop transitions removed 2301 transitions
Redundant transition composition rules discarded 2301 transitions
Iterating global reduction 2 with 2301 rules applied. Total rules applied 7797 place count 2855 transition count 10251
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7798 place count 2855 transition count 10250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7799 place count 2854 transition count 10250
Partial Free-agglomeration rule applied 2649 times.
Drop transitions removed 2649 transitions
Iterating global reduction 3 with 2649 rules applied. Total rules applied 10448 place count 2854 transition count 10250
Applied a total of 10448 rules in 3553 ms. Remains 2854 /5603 variables (removed 2749) and now considering 10250/15300 (removed 5050) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3553 ms. Remains : 2854/5603 places, 10250/15300 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 74917 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74917 steps, saw 29156 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10250 rows 2854 cols
[2023-03-12 23:11:49] [INFO ] Computed 52 place invariants in 391 ms
[2023-03-12 23:11:50] [INFO ] [Real]Absence check using 50 positive place invariants in 27 ms returned sat
[2023-03-12 23:11:50] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 37 ms returned sat
[2023-03-12 23:11:53] [INFO ] After 3826ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:11:54] [INFO ] [Nat]Absence check using 50 positive place invariants in 27 ms returned sat
[2023-03-12 23:11:54] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 36 ms returned sat
[2023-03-12 23:11:59] [INFO ] After 4527ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:11:59] [INFO ] State equation strengthened by 10043 read => feed constraints.
[2023-03-12 23:12:03] [INFO ] After 4643ms SMT Verify possible using 10043 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 23:12:07] [INFO ] After 8157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2514 ms.
[2023-03-12 23:12:09] [INFO ] After 16161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 45 ms.
Support contains 4 out of 2854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2854/2854 places, 10250/10250 transitions.
Applied a total of 0 rules in 710 ms. Remains 2854 /2854 variables (removed 0) and now considering 10250/10250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 710 ms. Remains : 2854/2854 places, 10250/10250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2854/2854 places, 10250/10250 transitions.
Applied a total of 0 rules in 617 ms. Remains 2854 /2854 variables (removed 0) and now considering 10250/10250 (removed 0) transitions.
[2023-03-12 23:12:11] [INFO ] Invariant cache hit.
[2023-03-12 23:12:14] [INFO ] Implicit Places using invariants in 3469 ms returned []
Implicit Place search using SMT only with invariants took 3470 ms to find 0 implicit places.
[2023-03-12 23:12:14] [INFO ] Invariant cache hit.
[2023-03-12 23:12:19] [INFO ] Dead Transitions using invariants and state equation in 4627 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8716 ms. Remains : 2854/2854 places, 10250/10250 transitions.
Graph (trivial) has 9890 edges and 2854 vertex of which 2648 / 2854 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2646 places
Drop transitions removed 7493 transitions
Ensure Unique test removed 2541 transitions
Reduce isomorphic transitions removed 10034 transitions.
Graph (complete) has 517 edges and 208 vertex of which 59 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.1 ms
Discarding 149 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 59 transition count 67
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 58 transition count 66
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 152 place count 11 transition count 19
Iterating global reduction 2 with 47 rules applied. Total rules applied 199 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 204 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 8 transition count 13
Applied a total of 206 rules in 31 ms. Remains 8 /2854 variables (removed 2846) and now considering 13/10250 (removed 10237) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 13 rows 8 cols
[2023-03-12 23:12:19] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-12 23:12:19] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:12:19] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:12:19] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 23:12:19] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 778 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-12 23:12:21] [INFO ] Computed 52 place invariants in 1134 ms
[2023-03-12 23:12:22] [INFO ] Implicit Places using invariants in 1825 ms returned []
Implicit Place search using SMT only with invariants took 1827 ms to find 0 implicit places.
[2023-03-12 23:12:22] [INFO ] Invariant cache hit.
[2023-03-12 23:12:30] [INFO ] Dead Transitions using invariants and state equation in 7735 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10342 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 70326 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70326 steps, saw 60070 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 23:12:33] [INFO ] Invariant cache hit.
[2023-03-12 23:12:35] [INFO ] [Real]Absence check using 50 positive place invariants in 82 ms returned sat
[2023-03-12 23:12:35] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 91 ms returned sat
[2023-03-12 23:12:44] [INFO ] After 10558ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:12:45] [INFO ] [Nat]Absence check using 50 positive place invariants in 81 ms returned sat
[2023-03-12 23:12:45] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 90 ms returned sat
[2023-03-12 23:12:58] [INFO ] After 12671ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:12:58] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-12 23:13:09] [INFO ] After 10517ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 23:13:09] [INFO ] After 10518ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 23:13:09] [INFO ] After 25076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 164 ms.
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2398 Post agglomeration using F-continuation condition.Transition count delta: 2398
Deduced a syphon composed of 2398 places in 5 ms
Reduce places removed 2398 places and 0 transitions.
Iterating global reduction 2 with 4796 rules applied. Total rules applied 5496 place count 2855 transition count 12552
Drop transitions removed 2301 transitions
Redundant transition composition rules discarded 2301 transitions
Iterating global reduction 2 with 2301 rules applied. Total rules applied 7797 place count 2855 transition count 10251
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7798 place count 2855 transition count 10250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7799 place count 2854 transition count 10250
Partial Free-agglomeration rule applied 2649 times.
Drop transitions removed 2649 transitions
Iterating global reduction 3 with 2649 rules applied. Total rules applied 10448 place count 2854 transition count 10250
Applied a total of 10448 rules in 3107 ms. Remains 2854 /5603 variables (removed 2749) and now considering 10250/15300 (removed 5050) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3107 ms. Remains : 2854/5603 places, 10250/15300 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 75067 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75067 steps, saw 29171 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10250 rows 2854 cols
[2023-03-12 23:13:16] [INFO ] Computed 52 place invariants in 396 ms
[2023-03-12 23:13:17] [INFO ] [Real]Absence check using 50 positive place invariants in 22 ms returned sat
[2023-03-12 23:13:17] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2023-03-12 23:13:19] [INFO ] After 3420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:13:20] [INFO ] [Nat]Absence check using 50 positive place invariants in 33 ms returned sat
[2023-03-12 23:13:20] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 39 ms returned sat
[2023-03-12 23:13:25] [INFO ] After 4292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:13:25] [INFO ] State equation strengthened by 10043 read => feed constraints.
[2023-03-12 23:13:29] [INFO ] After 4554ms SMT Verify possible using 10043 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 23:13:33] [INFO ] After 7835ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2542 ms.
[2023-03-12 23:13:35] [INFO ] After 15666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 37 ms.
Support contains 4 out of 2854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2854/2854 places, 10250/10250 transitions.
Applied a total of 0 rules in 633 ms. Remains 2854 /2854 variables (removed 0) and now considering 10250/10250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 634 ms. Remains : 2854/2854 places, 10250/10250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2854/2854 places, 10250/10250 transitions.
Applied a total of 0 rules in 513 ms. Remains 2854 /2854 variables (removed 0) and now considering 10250/10250 (removed 0) transitions.
[2023-03-12 23:13:36] [INFO ] Invariant cache hit.
[2023-03-12 23:13:38] [INFO ] Implicit Places using invariants in 1786 ms returned []
Implicit Place search using SMT only with invariants took 1787 ms to find 0 implicit places.
[2023-03-12 23:13:38] [INFO ] Invariant cache hit.
[2023-03-12 23:13:43] [INFO ] Dead Transitions using invariants and state equation in 4574 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6877 ms. Remains : 2854/2854 places, 10250/10250 transitions.
Graph (trivial) has 9890 edges and 2854 vertex of which 2648 / 2854 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2646 places
Drop transitions removed 7493 transitions
Ensure Unique test removed 2541 transitions
Reduce isomorphic transitions removed 10034 transitions.
Graph (complete) has 517 edges and 208 vertex of which 59 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.1 ms
Discarding 149 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 59 transition count 67
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 58 transition count 66
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 152 place count 11 transition count 19
Iterating global reduction 2 with 47 rules applied. Total rules applied 199 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 204 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 8 transition count 13
Applied a total of 206 rules in 18 ms. Remains 8 /2854 variables (removed 2846) and now considering 13/10250 (removed 10237) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 13 rows 8 cols
[2023-03-12 23:13:43] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 23:13:43] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:13:43] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:13:43] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 23:13:43] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 83 reset in 1198 ms.
Product exploration explored 100000 steps with 83 reset in 1240 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 195 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Performed 250 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 5603 transition count 15300
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 50 Pre rules applied. Total rules applied 250 place count 5603 transition count 15300
Deduced a syphon composed of 300 places in 4 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 300 place count 5603 transition count 15300
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 400 place count 5503 transition count 15200
Deduced a syphon composed of 200 places in 4 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 500 place count 5503 transition count 15200
Performed 2448 Post agglomeration using F-continuation condition.Transition count delta: -4696
Deduced a syphon composed of 2648 places in 4 ms
Iterating global reduction 1 with 2448 rules applied. Total rules applied 2948 place count 5503 transition count 19896
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 3148 place count 5303 transition count 19696
Deduced a syphon composed of 2448 places in 3 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 3348 place count 5303 transition count 19696
Deduced a syphon composed of 2448 places in 3 ms
Drop transitions removed 2301 transitions
Redundant transition composition rules discarded 2301 transitions
Iterating global reduction 1 with 2301 rules applied. Total rules applied 5649 place count 5303 transition count 17395
Deduced a syphon composed of 2448 places in 3 ms
Applied a total of 5649 rules in 5575 ms. Remains 5303 /5603 variables (removed 300) and now considering 17395/15300 (removed -2095) transitions.
// Phase 1: matrix 17395 rows 5303 cols
[2023-03-12 23:13:53] [INFO ] Computed 52 place invariants in 1241 ms
[2023-03-12 23:14:02] [INFO ] Dead Transitions using invariants and state equation in 10286 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5303/5603 places, 17395/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15862 ms. Remains : 5303/5603 places, 17395/15300 transitions.
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 695 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-12 23:14:04] [INFO ] Computed 52 place invariants in 1154 ms
[2023-03-12 23:14:05] [INFO ] Implicit Places using invariants in 2332 ms returned []
Implicit Place search using SMT only with invariants took 2333 ms to find 0 implicit places.
[2023-03-12 23:14:05] [INFO ] Invariant cache hit.
[2023-03-12 23:14:13] [INFO ] Dead Transitions using invariants and state equation in 8276 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11308 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-11 finished in 204456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 796 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
[2023-03-12 23:14:14] [INFO ] Invariant cache hit.
[2023-03-12 23:14:15] [INFO ] Implicit Places using invariants in 928 ms returned []
Implicit Place search using SMT only with invariants took 930 ms to find 0 implicit places.
[2023-03-12 23:14:15] [INFO ] Invariant cache hit.
[2023-03-12 23:14:24] [INFO ] Dead Transitions using invariants and state equation in 8315 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10043 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GT s5108 s3069) (GT s3115 s186))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-12 finished in 10278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2449 Post agglomeration using F-continuation condition.Transition count delta: 2449
Deduced a syphon composed of 2449 places in 4 ms
Reduce places removed 2449 places and 0 transitions.
Iterating global reduction 2 with 4898 rules applied. Total rules applied 5598 place count 2804 transition count 12501
Drop transitions removed 2351 transitions
Redundant transition composition rules discarded 2351 transitions
Iterating global reduction 2 with 2351 rules applied. Total rules applied 7949 place count 2804 transition count 10150
Applied a total of 7949 rules in 2944 ms. Remains 2804 /5603 variables (removed 2799) and now considering 10150/15300 (removed 5150) transitions.
// Phase 1: matrix 10150 rows 2804 cols
[2023-03-12 23:14:27] [INFO ] Computed 52 place invariants in 392 ms
[2023-03-12 23:14:29] [INFO ] Implicit Places using invariants in 2524 ms returned []
Implicit Place search using SMT only with invariants took 2524 ms to find 0 implicit places.
[2023-03-12 23:14:29] [INFO ] Invariant cache hit.
[2023-03-12 23:14:35] [INFO ] Dead Transitions using invariants and state equation in 5169 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5603 places, 10150/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10639 ms. Remains : 2804/5603 places, 10150/15300 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s768)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 249 steps with 0 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-15 finished in 10769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||F(p1))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-050-LTLCardinality-03
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2448 Post agglomeration using F-continuation condition.Transition count delta: 2448
Deduced a syphon composed of 2448 places in 4 ms
Reduce places removed 2448 places and 0 transitions.
Iterating global reduction 2 with 4896 rules applied. Total rules applied 5596 place count 2805 transition count 12502
Drop transitions removed 2350 transitions
Redundant transition composition rules discarded 2350 transitions
Iterating global reduction 2 with 2350 rules applied. Total rules applied 7946 place count 2805 transition count 10152
Applied a total of 7946 rules in 2560 ms. Remains 2805 /5603 variables (removed 2798) and now considering 10152/15300 (removed 5148) transitions.
// Phase 1: matrix 10152 rows 2805 cols
[2023-03-12 23:14:38] [INFO ] Computed 52 place invariants in 404 ms
[2023-03-12 23:14:40] [INFO ] Implicit Places using invariants in 2675 ms returned []
Implicit Place search using SMT only with invariants took 2676 ms to find 0 implicit places.
[2023-03-12 23:14:40] [INFO ] Invariant cache hit.
[2023-03-12 23:14:45] [INFO ] Dead Transitions using invariants and state equation in 4983 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2805/5603 places, 10152/15300 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10222 ms. Remains : 2805/5603 places, 10152/15300 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s487 s1729), p0:(LEQ 1 s2359)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 395 reset in 1217 ms.
Product exploration explored 100000 steps with 394 reset in 1251 ms.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 8464 steps, including 34 resets, run visited all 2 properties in 195 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 2805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2805/2805 places, 10152/10152 transitions.
Applied a total of 0 rules in 463 ms. Remains 2805 /2805 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2023-03-12 23:14:49] [INFO ] Invariant cache hit.
[2023-03-12 23:14:51] [INFO ] Implicit Places using invariants in 2061 ms returned []
Implicit Place search using SMT only with invariants took 2061 ms to find 0 implicit places.
[2023-03-12 23:14:51] [INFO ] Invariant cache hit.
[2023-03-12 23:14:56] [INFO ] Dead Transitions using invariants and state equation in 4803 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7341 ms. Remains : 2805/2805 places, 10152/10152 transitions.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 80426 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80426 steps, saw 30829 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 23:14:59] [INFO ] Invariant cache hit.
[2023-03-12 23:15:00] [INFO ] After 353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 23:15:00] [INFO ] [Nat]Absence check using 50 positive place invariants in 20 ms returned sat
[2023-03-12 23:15:00] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-12 23:15:03] [INFO ] After 3121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 23:15:03] [INFO ] State equation strengthened by 7446 read => feed constraints.
[2023-03-12 23:15:07] [INFO ] After 4068ms SMT Verify possible using 7446 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 23:15:08] [INFO ] After 5066ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 695 ms.
[2023-03-12 23:15:09] [INFO ] After 9402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 10152/10152 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2805 transition count 10151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2804 transition count 10151
Partial Free-agglomeration rule applied 2550 times.
Drop transitions removed 2550 transitions
Iterating global reduction 1 with 2550 rules applied. Total rules applied 2552 place count 2804 transition count 10151
Applied a total of 2552 rules in 1583 ms. Remains 2804 /2805 variables (removed 1) and now considering 10151/10152 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1583 ms. Remains : 2804/2805 places, 10151/10152 transitions.
Finished random walk after 883 steps, including 3 resets, run visited all 2 properties in 22 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 396 reset in 1220 ms.
Product exploration explored 100000 steps with 394 reset in 1259 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 2805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2805/2805 places, 10152/10152 transitions.
Applied a total of 0 rules in 618 ms. Remains 2805 /2805 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2023-03-12 23:15:15] [INFO ] Invariant cache hit.
[2023-03-12 23:15:19] [INFO ] Dead Transitions using invariants and state equation in 4818 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5438 ms. Remains : 2805/2805 places, 10152/10152 transitions.
Support contains 3 out of 2805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2805/2805 places, 10152/10152 transitions.
Applied a total of 0 rules in 358 ms. Remains 2805 /2805 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2023-03-12 23:15:20] [INFO ] Invariant cache hit.
[2023-03-12 23:15:22] [INFO ] Implicit Places using invariants in 2102 ms returned []
Implicit Place search using SMT only with invariants took 2103 ms to find 0 implicit places.
[2023-03-12 23:15:22] [INFO ] Invariant cache hit.
[2023-03-12 23:15:27] [INFO ] Dead Transitions using invariants and state equation in 4847 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7310 ms. Remains : 2805/2805 places, 10152/10152 transitions.
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-03 finished in 52305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p1&&X((p1 U (p2||G(p1)))))||p0)))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-050-LTLCardinality-11
Stuttering acceptance computed with spot in 173 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2398 Post agglomeration using F-continuation condition.Transition count delta: 2398
Deduced a syphon composed of 2398 places in 4 ms
Reduce places removed 2398 places and 0 transitions.
Iterating global reduction 2 with 4796 rules applied. Total rules applied 5496 place count 2855 transition count 12552
Drop transitions removed 2301 transitions
Redundant transition composition rules discarded 2301 transitions
Iterating global reduction 2 with 2301 rules applied. Total rules applied 7797 place count 2855 transition count 10251
Partial Post-agglomeration rule applied 98 times.
Drop transitions removed 98 transitions
Iterating global reduction 2 with 98 rules applied. Total rules applied 7895 place count 2855 transition count 10251
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 7943 place count 2807 transition count 10203
Iterating global reduction 2 with 48 rules applied. Total rules applied 7991 place count 2807 transition count 10203
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 2 with 48 rules applied. Total rules applied 8039 place count 2807 transition count 10155
Applied a total of 8039 rules in 3984 ms. Remains 2807 /5603 variables (removed 2796) and now considering 10155/15300 (removed 5145) transitions.
// Phase 1: matrix 10155 rows 2807 cols
[2023-03-12 23:15:32] [INFO ] Computed 52 place invariants in 378 ms
[2023-03-12 23:15:34] [INFO ] Implicit Places using invariants in 2641 ms returned []
Implicit Place search using SMT only with invariants took 2643 ms to find 0 implicit places.
[2023-03-12 23:15:34] [INFO ] Invariant cache hit.
[2023-03-12 23:15:39] [INFO ] Dead Transitions using invariants and state equation in 4745 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2807/5603 places, 10155/15300 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11374 ms. Remains : 2807/5603 places, 10155/15300 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (GT s145 s2326) (GT 2 s521)), p1:(GT 3 s1533), p2:(GT 2 s521)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 393 reset in 1573 ms.
Product exploration explored 100000 steps with 393 reset in 1520 ms.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 69657 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69657 steps, saw 29442 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 23:15:46] [INFO ] Invariant cache hit.
[2023-03-12 23:15:46] [INFO ] [Real]Absence check using 50 positive place invariants in 21 ms returned sat
[2023-03-12 23:15:46] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2023-03-12 23:15:49] [INFO ] After 3421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:15:50] [INFO ] [Nat]Absence check using 50 positive place invariants in 27 ms returned sat
[2023-03-12 23:15:50] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 35 ms returned sat
[2023-03-12 23:15:54] [INFO ] After 4149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:15:54] [INFO ] State equation strengthened by 7445 read => feed constraints.
[2023-03-12 23:15:59] [INFO ] After 4813ms SMT Verify possible using 7445 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 23:16:02] [INFO ] After 7973ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1883 ms.
[2023-03-12 23:16:04] [INFO ] After 14942ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2807 transition count 10154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2806 transition count 10154
Partial Free-agglomeration rule applied 2551 times.
Drop transitions removed 2551 transitions
Iterating global reduction 1 with 2551 rules applied. Total rules applied 2553 place count 2806 transition count 10154
Applied a total of 2553 rules in 1354 ms. Remains 2806 /2807 variables (removed 1) and now considering 10154/10155 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1354 ms. Remains : 2806/2807 places, 10154/10155 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 69013 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 69013 steps, saw 27170 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10154 rows 2806 cols
[2023-03-12 23:16:09] [INFO ] Computed 52 place invariants in 346 ms
[2023-03-12 23:16:10] [INFO ] [Real]Absence check using 50 positive place invariants in 26 ms returned sat
[2023-03-12 23:16:10] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 35 ms returned sat
[2023-03-12 23:16:13] [INFO ] After 4042ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:16:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 34 ms returned sat
[2023-03-12 23:16:14] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 35 ms returned sat
[2023-03-12 23:16:19] [INFO ] After 4746ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:16:19] [INFO ] State equation strengthened by 9995 read => feed constraints.
[2023-03-12 23:16:23] [INFO ] After 3753ms SMT Verify possible using 9995 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 23:16:26] [INFO ] After 7137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2431 ms.
[2023-03-12 23:16:29] [INFO ] After 15311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 4 out of 2806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Applied a total of 0 rules in 653 ms. Remains 2806 /2806 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 653 ms. Remains : 2806/2806 places, 10154/10154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Applied a total of 0 rules in 506 ms. Remains 2806 /2806 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
[2023-03-12 23:16:30] [INFO ] Invariant cache hit.
[2023-03-12 23:16:34] [INFO ] Implicit Places using invariants in 4070 ms returned []
Implicit Place search using SMT only with invariants took 4071 ms to find 0 implicit places.
[2023-03-12 23:16:34] [INFO ] Invariant cache hit.
[2023-03-12 23:16:38] [INFO ] Dead Transitions using invariants and state equation in 4481 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9060 ms. Remains : 2806/2806 places, 10154/10154 transitions.
Graph (trivial) has 9842 edges and 2806 vertex of which 2599 / 2806 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2597 places
Drop transitions removed 7396 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9938 transitions.
Graph (complete) has 518 edges and 209 vertex of which 60 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.0 ms
Discarding 149 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 60 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 59 transition count 67
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 151 place count 12 transition count 20
Iterating global reduction 2 with 47 rules applied. Total rules applied 198 place count 12 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 200 place count 12 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 201 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 202 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 205 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 8 transition count 13
Applied a total of 207 rules in 17 ms. Remains 8 /2806 variables (removed 2798) and now considering 13/10154 (removed 10141) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 13 rows 8 cols
[2023-03-12 23:16:38] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 23:16:38] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:16:38] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:16:38] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-12 23:16:38] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Applied a total of 0 rules in 394 ms. Remains 2807 /2807 variables (removed 0) and now considering 10155/10155 (removed 0) transitions.
// Phase 1: matrix 10155 rows 2807 cols
[2023-03-12 23:16:39] [INFO ] Computed 52 place invariants in 263 ms
[2023-03-12 23:16:42] [INFO ] Implicit Places using invariants in 2431 ms returned []
Implicit Place search using SMT only with invariants took 2432 ms to find 0 implicit places.
[2023-03-12 23:16:42] [INFO ] Invariant cache hit.
[2023-03-12 23:16:47] [INFO ] Dead Transitions using invariants and state equation in 4846 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7674 ms. Remains : 2807/2807 places, 10155/10155 transitions.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 72392 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72392 steps, saw 29780 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 23:16:50] [INFO ] Invariant cache hit.
[2023-03-12 23:16:51] [INFO ] [Real]Absence check using 50 positive place invariants in 22 ms returned sat
[2023-03-12 23:16:51] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2023-03-12 23:16:54] [INFO ] After 3407ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:16:54] [INFO ] [Nat]Absence check using 50 positive place invariants in 22 ms returned sat
[2023-03-12 23:16:54] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 57 ms returned sat
[2023-03-12 23:16:58] [INFO ] After 4038ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:16:58] [INFO ] State equation strengthened by 7445 read => feed constraints.
[2023-03-12 23:17:03] [INFO ] After 4700ms SMT Verify possible using 7445 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 23:17:06] [INFO ] After 7777ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1869 ms.
[2023-03-12 23:17:08] [INFO ] After 14570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2807 transition count 10154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2806 transition count 10154
Partial Free-agglomeration rule applied 2551 times.
Drop transitions removed 2551 transitions
Iterating global reduction 1 with 2551 rules applied. Total rules applied 2553 place count 2806 transition count 10154
Applied a total of 2553 rules in 1571 ms. Remains 2806 /2807 variables (removed 1) and now considering 10154/10155 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1571 ms. Remains : 2806/2807 places, 10154/10155 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 68848 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68848 steps, saw 27129 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10154 rows 2806 cols
[2023-03-12 23:17:13] [INFO ] Computed 52 place invariants in 293 ms
[2023-03-12 23:17:14] [INFO ] [Real]Absence check using 50 positive place invariants in 26 ms returned sat
[2023-03-12 23:17:14] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 35 ms returned sat
[2023-03-12 23:17:17] [INFO ] After 4068ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:17:18] [INFO ] [Nat]Absence check using 50 positive place invariants in 28 ms returned sat
[2023-03-12 23:17:18] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 36 ms returned sat
[2023-03-12 23:17:23] [INFO ] After 4638ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:17:23] [INFO ] State equation strengthened by 9995 read => feed constraints.
[2023-03-12 23:17:27] [INFO ] After 3885ms SMT Verify possible using 9995 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 23:17:30] [INFO ] After 7328ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2441 ms.
[2023-03-12 23:17:33] [INFO ] After 15381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 4 out of 2806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Applied a total of 0 rules in 640 ms. Remains 2806 /2806 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 640 ms. Remains : 2806/2806 places, 10154/10154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Applied a total of 0 rules in 504 ms. Remains 2806 /2806 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
[2023-03-12 23:17:34] [INFO ] Invariant cache hit.
[2023-03-12 23:17:37] [INFO ] Implicit Places using invariants in 3460 ms returned []
Implicit Place search using SMT only with invariants took 3462 ms to find 0 implicit places.
[2023-03-12 23:17:37] [INFO ] Invariant cache hit.
[2023-03-12 23:17:42] [INFO ] Dead Transitions using invariants and state equation in 4561 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8529 ms. Remains : 2806/2806 places, 10154/10154 transitions.
Graph (trivial) has 9842 edges and 2806 vertex of which 2599 / 2806 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2597 places
Drop transitions removed 7396 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9938 transitions.
Graph (complete) has 518 edges and 209 vertex of which 60 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.0 ms
Discarding 149 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 60 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 59 transition count 67
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 151 place count 12 transition count 20
Iterating global reduction 2 with 47 rules applied. Total rules applied 198 place count 12 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 200 place count 12 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 201 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 202 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 205 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 8 transition count 13
Applied a total of 207 rules in 20 ms. Remains 8 /2806 variables (removed 2798) and now considering 13/10154 (removed 10141) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 13 rows 8 cols
[2023-03-12 23:17:42] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-12 23:17:42] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:17:42] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:17:42] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-12 23:17:42] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 157 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 391 reset in 1416 ms.
Product exploration explored 100000 steps with 392 reset in 1268 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 190 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Applied a total of 0 rules in 591 ms. Remains 2807 /2807 variables (removed 0) and now considering 10155/10155 (removed 0) transitions.
// Phase 1: matrix 10155 rows 2807 cols
[2023-03-12 23:17:47] [INFO ] Computed 52 place invariants in 431 ms
[2023-03-12 23:17:52] [INFO ] Dead Transitions using invariants and state equation in 5299 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5892 ms. Remains : 2807/2807 places, 10155/10155 transitions.
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Applied a total of 0 rules in 352 ms. Remains 2807 /2807 variables (removed 0) and now considering 10155/10155 (removed 0) transitions.
[2023-03-12 23:17:52] [INFO ] Invariant cache hit.
[2023-03-12 23:17:54] [INFO ] Implicit Places using invariants in 2114 ms returned []
Implicit Place search using SMT only with invariants took 2115 ms to find 0 implicit places.
[2023-03-12 23:17:54] [INFO ] Invariant cache hit.
[2023-03-12 23:17:59] [INFO ] Dead Transitions using invariants and state equation in 4737 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7206 ms. Remains : 2807/2807 places, 10155/10155 transitions.
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-11 finished in 152216 ms.
[2023-03-12 23:18:00] [INFO ] Flatten gal took : 276 ms
[2023-03-12 23:18:00] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 23:18:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5603 places, 15300 transitions and 40900 arcs took 48 ms.
Total runtime 765709 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1724/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1724/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CANInsertWithFailure-PT-050-LTLCardinality-03
Could not compute solution for formula : CANInsertWithFailure-PT-050-LTLCardinality-11

BK_STOP 1678663104443

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name CANInsertWithFailure-PT-050-LTLCardinality-03
ltl formula formula --ltl=/tmp/1724/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5603 places, 15300 transitions and 40900 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.840 real 0.480 user 0.630 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1724/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1724/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1724/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1724/ltl_0_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name CANInsertWithFailure-PT-050-LTLCardinality-11
ltl formula formula --ltl=/tmp/1724/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5603 places, 15300 transitions and 40900 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.260 real 0.500 user 0.620 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1724/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1724/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1724/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1724/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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-050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-050, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695100739"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-050.tgz
mv CANInsertWithFailure-PT-050 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;