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-167813695100723.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-030, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100723
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 8.3K Feb 26 00:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 00:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 00:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 17K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 26 00:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 00:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 00:25 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 5.6M 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-030-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678660118471

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-030
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 22:28:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 22:28:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 22:28:40] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2023-03-12 22:28:40] [INFO ] Transformed 2164 places.
[2023-03-12 22:28:40] [INFO ] Transformed 5580 transitions.
[2023-03-12 22:28:40] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 365 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 2164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2163 transition count 5580
Applied a total of 1 rules in 253 ms. Remains 2163 /2164 variables (removed 1) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-12 22:28:41] [INFO ] Computed 32 place invariants in 270 ms
[2023-03-12 22:28:42] [INFO ] Implicit Places using invariants in 1177 ms returned []
[2023-03-12 22:28:42] [INFO ] Invariant cache hit.
[2023-03-12 22:28:42] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:28:44] [INFO ] Implicit Places using invariants and state equation in 1914 ms returned []
Implicit Place search using SMT with State Equation took 3122 ms to find 0 implicit places.
[2023-03-12 22:28:44] [INFO ] Invariant cache hit.
[2023-03-12 22:28:46] [INFO ] Dead Transitions using invariants and state equation in 2545 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2163/2164 places, 5580/5580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5924 ms. Remains : 2163/2164 places, 5580/5580 transitions.
Support contains 59 out of 2163 places after structural reductions.
[2023-03-12 22:28:47] [INFO ] Flatten gal took : 304 ms
[2023-03-12 22:28:47] [INFO ] Flatten gal took : 179 ms
[2023-03-12 22:28:47] [INFO ] Input system was already deterministic with 5580 transitions.
Support contains 55 out of 2163 places (down from 59) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 710 ms. (steps per millisecond=14 ) properties (out of 32) seen :17
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 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 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) 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 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-12 22:28:48] [INFO ] Invariant cache hit.
[2023-03-12 22:28:49] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2023-03-12 22:28:49] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-12 22:28:49] [INFO ] After 838ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-12 22:28:50] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2023-03-12 22:28:50] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 27 ms returned sat
[2023-03-12 22:28:54] [INFO ] After 4378ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :12
[2023-03-12 22:28:54] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:29:03] [INFO ] After 8347ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :2 sat :12
[2023-03-12 22:29:08] [INFO ] After 13375ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :12
Attempting to minimize the solution found.
Minimization took 4028 ms.
[2023-03-12 22:29:12] [INFO ] After 22822ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :12
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 2 properties in 418 ms.
Support contains 16 out of 2163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 207 place count 2163 transition count 5373
Reduce places removed 207 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 208 rules applied. Total rules applied 415 place count 1956 transition count 5372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 416 place count 1955 transition count 5372
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 416 place count 1955 transition count 5371
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 863 Post agglomeration using F-continuation condition.Transition count delta: 863
Deduced a syphon composed of 863 places in 5 ms
Reduce places removed 863 places and 0 transitions.
Iterating global reduction 3 with 1726 rules applied. Total rules applied 2144 place count 1091 transition count 4508
Drop transitions removed 806 transitions
Redundant transition composition rules discarded 806 transitions
Iterating global reduction 3 with 806 rules applied. Total rules applied 2950 place count 1091 transition count 3702
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2951 place count 1091 transition count 3701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2952 place count 1090 transition count 3701
Partial Free-agglomeration rule applied 924 times.
Drop transitions removed 924 transitions
Iterating global reduction 4 with 924 rules applied. Total rules applied 3876 place count 1090 transition count 3701
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 3906 place count 1090 transition count 3701
Applied a total of 3906 rules in 1280 ms. Remains 1090 /2163 variables (removed 1073) and now considering 3701/5580 (removed 1879) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1280 ms. Remains : 1090/2163 places, 3701/5580 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 10) seen :4
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 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 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 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 3701 rows 1090 cols
[2023-03-12 22:29:14] [INFO ] Computed 32 place invariants in 54 ms
[2023-03-12 22:29:14] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-12 22:29:14] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-12 22:29:16] [INFO ] After 1537ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-12 22:29:16] [INFO ] State equation strengthened by 3584 read => feed constraints.
[2023-03-12 22:29:18] [INFO ] After 2105ms SMT Verify possible using 3584 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 22:29:18] [INFO ] After 4089ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 22:29:18] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2023-03-12 22:29:18] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-12 22:29:20] [INFO ] After 1526ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 22:29:21] [INFO ] After 1372ms SMT Verify possible using 3584 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 22:29:23] [INFO ] After 2558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 869 ms.
[2023-03-12 22:29:23] [INFO ] After 5329ms 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 49 ms.
Support contains 7 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3701/3701 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 1090 transition count 3700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1089 transition count 3700
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 1086 transition count 3697
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 1086 transition count 3697
Applied a total of 13 rules in 222 ms. Remains 1086 /1090 variables (removed 4) and now considering 3697/3701 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 1086/1090 places, 3697/3701 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 6) 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 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 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 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 171943 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 171943 steps, saw 32153 distinct states, run finished after 3004 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 3697 rows 1086 cols
[2023-03-12 22:29:27] [INFO ] Computed 32 place invariants in 40 ms
[2023-03-12 22:29:28] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-12 22:29:28] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-12 22:29:29] [INFO ] After 1223ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-12 22:29:29] [INFO ] State equation strengthened by 3593 read => feed constraints.
[2023-03-12 22:29:30] [INFO ] After 1507ms SMT Verify possible using 3593 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 22:29:30] [INFO ] After 3076ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 22:29:31] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-12 22:29:31] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-12 22:29:32] [INFO ] After 1451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 22:29:34] [INFO ] After 1985ms SMT Verify possible using 3593 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 22:29:36] [INFO ] After 3962ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1240 ms.
[2023-03-12 22:29:37] [INFO ] After 7039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 90 ms.
Support contains 7 out of 1086 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1086/1086 places, 3697/3697 transitions.
Applied a total of 0 rules in 94 ms. Remains 1086 /1086 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 1086/1086 places, 3697/3697 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1086/1086 places, 3697/3697 transitions.
Applied a total of 0 rules in 179 ms. Remains 1086 /1086 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
[2023-03-12 22:29:38] [INFO ] Invariant cache hit.
[2023-03-12 22:29:39] [INFO ] Implicit Places using invariants in 1094 ms returned []
[2023-03-12 22:29:39] [INFO ] Invariant cache hit.
[2023-03-12 22:29:40] [INFO ] State equation strengthened by 3593 read => feed constraints.
[2023-03-12 22:30:04] [INFO ] Implicit Places using invariants and state equation in 24737 ms returned []
Implicit Place search using SMT with State Equation took 25839 ms to find 0 implicit places.
[2023-03-12 22:30:04] [INFO ] Redundant transitions in 391 ms returned []
[2023-03-12 22:30:04] [INFO ] Invariant cache hit.
[2023-03-12 22:30:05] [INFO ] Dead Transitions using invariants and state equation in 1392 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27819 ms. Remains : 1086/1086 places, 3697/3697 transitions.
Graph (trivial) has 3490 edges and 1086 vertex of which 956 / 1086 are part of one of the 2 SCC in 5 ms
Free SCC test removed 954 places
Drop transitions removed 2628 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3550 transitions.
Graph (complete) has 329 edges and 132 vertex of which 41 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.1 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions removed 29 transitions
Drop transitions removed 61 transitions
Reduce isomorphic transitions removed 61 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 62 rules applied. Total rules applied 64 place count 41 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 40 transition count 56
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 12 transition count 28
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 12 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 12 transition count 26
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 12 transition count 25
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 126 place count 11 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 10 transition count 23
Applied a total of 127 rules in 33 ms. Remains 10 /1086 variables (removed 1076) and now considering 23/3697 (removed 3674) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 23 rows 10 cols
[2023-03-12 22:30:05] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 22:30:06] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 22:30:06] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 22:30:06] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-12 22:30:06] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 122 stabilizing places and 210 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' '!(X(G(p0)))'
Support contains 1 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 95 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-12 22:30:06] [INFO ] Computed 32 place invariants in 143 ms
[2023-03-12 22:30:07] [INFO ] Implicit Places using invariants in 1104 ms returned []
[2023-03-12 22:30:07] [INFO ] Invariant cache hit.
[2023-03-12 22:30:08] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:30:10] [INFO ] Implicit Places using invariants and state equation in 2699 ms returned []
Implicit Place search using SMT with State Equation took 3806 ms to find 0 implicit places.
[2023-03-12 22:30:10] [INFO ] Invariant cache hit.
[2023-03-12 22:30:13] [INFO ] Dead Transitions using invariants and state equation in 2552 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6459 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s1245)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-00 finished in 6729 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((G(F(p0))||G(p1))))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 77 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-12 22:30:13] [INFO ] Invariant cache hit.
[2023-03-12 22:30:14] [INFO ] Implicit Places using invariants in 859 ms returned []
[2023-03-12 22:30:14] [INFO ] Invariant cache hit.
[2023-03-12 22:30:15] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:30:16] [INFO ] Implicit Places using invariants and state equation in 2409 ms returned []
Implicit Place search using SMT with State Equation took 3273 ms to find 0 implicit places.
[2023-03-12 22:30:16] [INFO ] Invariant cache hit.
[2023-03-12 22:30:19] [INFO ] Dead Transitions using invariants and state equation in 2671 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6026 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LEQ 2 s808) (LEQ 2 s2071)), p0:(GT s1989 s2122)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1406 steps with 1 reset in 54 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-01 finished in 6286 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((X(X(p0))||G(p1))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 87 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-12 22:30:19] [INFO ] Invariant cache hit.
[2023-03-12 22:30:20] [INFO ] Implicit Places using invariants in 973 ms returned []
[2023-03-12 22:30:20] [INFO ] Invariant cache hit.
[2023-03-12 22:30:21] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:30:22] [INFO ] Implicit Places using invariants and state equation in 2309 ms returned []
Implicit Place search using SMT with State Equation took 3284 ms to find 0 implicit places.
[2023-03-12 22:30:22] [INFO ] Invariant cache hit.
[2023-03-12 22:30:25] [INFO ] Dead Transitions using invariants and state equation in 2465 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5839 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s1937), p0:(LEQ s1341 s1979)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1290 ms.
Product exploration explored 100000 steps with 33333 reset in 1259 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-03 finished in 8709 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)&&F((p1&&X(G(p2)))))))'
Support contains 5 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 207 place count 2163 transition count 5373
Reduce places removed 207 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 208 rules applied. Total rules applied 415 place count 1956 transition count 5372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 416 place count 1955 transition count 5372
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 416 place count 1955 transition count 5371
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 867 Post agglomeration using F-continuation condition.Transition count delta: 867
Deduced a syphon composed of 867 places in 2 ms
Reduce places removed 867 places and 0 transitions.
Iterating global reduction 3 with 1734 rules applied. Total rules applied 2152 place count 1087 transition count 4504
Drop transitions removed 810 transitions
Redundant transition composition rules discarded 810 transitions
Iterating global reduction 3 with 810 rules applied. Total rules applied 2962 place count 1087 transition count 3694
Applied a total of 2962 rules in 726 ms. Remains 1087 /2163 variables (removed 1076) and now considering 3694/5580 (removed 1886) transitions.
// Phase 1: matrix 3694 rows 1087 cols
[2023-03-12 22:30:29] [INFO ] Computed 32 place invariants in 47 ms
[2023-03-12 22:30:29] [INFO ] Implicit Places using invariants in 556 ms returned []
[2023-03-12 22:30:29] [INFO ] Invariant cache hit.
[2023-03-12 22:30:30] [INFO ] State equation strengthened by 2665 read => feed constraints.
[2023-03-12 22:30:35] [INFO ] Implicit Places using invariants and state equation in 6361 ms returned []
Implicit Place search using SMT with State Equation took 6921 ms to find 0 implicit places.
[2023-03-12 22:30:36] [INFO ] Redundant transitions in 166 ms returned []
[2023-03-12 22:30:36] [INFO ] Invariant cache hit.
[2023-03-12 22:30:37] [INFO ] Dead Transitions using invariants and state equation in 1472 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1087/2163 places, 3694/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9299 ms. Remains : 1087/2163 places, 3694/5580 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s156 s930), p1:(LEQ 1 s121), p2:(LEQ s275 s483)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 507 steps with 2 reset in 15 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-04 finished in 9547 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((p0&&F(p1)))||X(F(p2))))'
Support contains 5 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 102 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-12 22:30:38] [INFO ] Computed 32 place invariants in 220 ms
[2023-03-12 22:30:38] [INFO ] Implicit Places using invariants in 1062 ms returned []
[2023-03-12 22:30:38] [INFO ] Invariant cache hit.
[2023-03-12 22:30:39] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:30:41] [INFO ] Implicit Places using invariants and state equation in 2309 ms returned []
Implicit Place search using SMT with State Equation took 3383 ms to find 0 implicit places.
[2023-03-12 22:30:41] [INFO ] Invariant cache hit.
[2023-03-12 22:30:43] [INFO ] Dead Transitions using invariants and state equation in 2591 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6094 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s1386 s1524), p1:(GT s1569 s1774), p2:(LEQ 1 s1201)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 728 steps with 0 reset in 8 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-05 finished in 6264 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(p0) U X(p1)))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 93 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-12 22:30:44] [INFO ] Invariant cache hit.
[2023-03-12 22:30:44] [INFO ] Implicit Places using invariants in 766 ms returned []
[2023-03-12 22:30:44] [INFO ] Invariant cache hit.
[2023-03-12 22:30:45] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:30:47] [INFO ] Implicit Places using invariants and state equation in 2154 ms returned []
Implicit Place search using SMT with State Equation took 2935 ms to find 0 implicit places.
[2023-03-12 22:30:47] [INFO ] Invariant cache hit.
[2023-03-12 22:30:49] [INFO ] Dead Transitions using invariants and state equation in 2378 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5425 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GT 1 s1877) (GT 3 s1508)), p1:(LEQ s399 s1611)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1685 ms.
Product exploration explored 100000 steps with 50000 reset in 1744 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 183 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-06 finished in 9311 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(F(p0)))'
Support contains 2 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 94 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-12 22:30:53] [INFO ] Invariant cache hit.
[2023-03-12 22:30:54] [INFO ] Implicit Places using invariants in 893 ms returned []
[2023-03-12 22:30:54] [INFO ] Invariant cache hit.
[2023-03-12 22:30:55] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:30:56] [INFO ] Implicit Places using invariants and state equation in 2167 ms returned []
Implicit Place search using SMT with State Equation took 3091 ms to find 0 implicit places.
[2023-03-12 22:30:56] [INFO ] Invariant cache hit.
[2023-03-12 22:30:58] [INFO ] Dead Transitions using invariants and state equation in 2474 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5662 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s2016 s256)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 775 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-08 finished in 5772 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((G(!p0)||(!p0&&F(p1))))))'
Support contains 5 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 207 place count 2163 transition count 5373
Reduce places removed 207 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 208 rules applied. Total rules applied 415 place count 1956 transition count 5372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 416 place count 1955 transition count 5372
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 416 place count 1955 transition count 5371
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 867 Post agglomeration using F-continuation condition.Transition count delta: 867
Deduced a syphon composed of 867 places in 2 ms
Reduce places removed 867 places and 0 transitions.
Iterating global reduction 3 with 1734 rules applied. Total rules applied 2152 place count 1087 transition count 4504
Drop transitions removed 810 transitions
Redundant transition composition rules discarded 810 transitions
Iterating global reduction 3 with 810 rules applied. Total rules applied 2962 place count 1087 transition count 3694
Applied a total of 2962 rules in 580 ms. Remains 1087 /2163 variables (removed 1076) and now considering 3694/5580 (removed 1886) transitions.
// Phase 1: matrix 3694 rows 1087 cols
[2023-03-12 22:30:59] [INFO ] Computed 32 place invariants in 46 ms
[2023-03-12 22:31:00] [INFO ] Implicit Places using invariants in 531 ms returned []
[2023-03-12 22:31:00] [INFO ] Invariant cache hit.
[2023-03-12 22:31:01] [INFO ] State equation strengthened by 2665 read => feed constraints.
[2023-03-12 22:31:07] [INFO ] Implicit Places using invariants and state equation in 7382 ms returned []
Implicit Place search using SMT with State Equation took 7928 ms to find 0 implicit places.
[2023-03-12 22:31:07] [INFO ] Redundant transitions in 205 ms returned []
[2023-03-12 22:31:07] [INFO ] Invariant cache hit.
[2023-03-12 22:31:09] [INFO ] Dead Transitions using invariants and state equation in 1398 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1087/2163 places, 3694/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10123 ms. Remains : 1087/2163 places, 3694/5580 transitions.
Stuttering acceptance computed with spot in 91 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT 2 s964), p0:(OR (LEQ s354 s64) (LEQ s91 s877))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 149 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-09 finished in 10242 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((p0||G(p1))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 1 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2158 place count 1084 transition count 4501
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2969 place count 1084 transition count 3690
Applied a total of 2969 rules in 459 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
// Phase 1: matrix 3690 rows 1084 cols
[2023-03-12 22:31:09] [INFO ] Computed 32 place invariants in 42 ms
[2023-03-12 22:31:10] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-12 22:31:10] [INFO ] Invariant cache hit.
[2023-03-12 22:31:11] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-12 22:31:16] [INFO ] Implicit Places using invariants and state equation in 6254 ms returned []
Implicit Place search using SMT with State Equation took 6868 ms to find 0 implicit places.
[2023-03-12 22:31:16] [INFO ] Redundant transitions in 136 ms returned []
[2023-03-12 22:31:16] [INFO ] Invariant cache hit.
[2023-03-12 22:31:18] [INFO ] Dead Transitions using invariants and state equation in 1400 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1084/2163 places, 3690/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8921 ms. Remains : 1084/2163 places, 3690/5580 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(GT 1 s655), p0:(GT s214 s572)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 2057 steps with 13 reset in 15 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-11 finished in 9041 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((p0 U p1))||G(p2)))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 90 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-12 22:31:18] [INFO ] Computed 32 place invariants in 109 ms
[2023-03-12 22:31:19] [INFO ] Implicit Places using invariants in 860 ms returned []
[2023-03-12 22:31:19] [INFO ] Invariant cache hit.
[2023-03-12 22:31:20] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:31:21] [INFO ] Implicit Places using invariants and state equation in 2242 ms returned []
Implicit Place search using SMT with State Equation took 3122 ms to find 0 implicit places.
[2023-03-12 22:31:21] [INFO ] Invariant cache hit.
[2023-03-12 22:31:24] [INFO ] Dead Transitions using invariants and state equation in 2448 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5661 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ s289 s1199), p0:(LEQ 2 s1848), p2:(LEQ 1 s1735)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1540 ms.
Product exploration explored 100000 steps with 50000 reset in 1518 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), true, (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p0) (NOT p2))
Knowledge based reduction with 15 factoid took 341 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-12 finished in 9259 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(G(p0))&&(G(p1)||X(X(F(!p1))))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 87 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-12 22:31:27] [INFO ] Invariant cache hit.
[2023-03-12 22:31:28] [INFO ] Implicit Places using invariants in 752 ms returned []
[2023-03-12 22:31:28] [INFO ] Invariant cache hit.
[2023-03-12 22:31:29] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:31:30] [INFO ] Implicit Places using invariants and state equation in 2095 ms returned []
Implicit Place search using SMT with State Equation took 2864 ms to find 0 implicit places.
[2023-03-12 22:31:30] [INFO ] Invariant cache hit.
[2023-03-12 22:31:32] [INFO ] Dead Transitions using invariants and state equation in 2369 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5345 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (OR (NOT p0) p1), true, (NOT p0), (OR (NOT p0) p1)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(LEQ s326 s264), p1:(GT 3 s1293)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11333 steps with 16 reset in 66 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-13 finished in 5596 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((G(p0) U (p1&&X((p1 U ((p2 U (p3||G(p2)))||G(p1))))))))'
Support contains 7 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 147 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-12 22:31:33] [INFO ] Invariant cache hit.
[2023-03-12 22:31:34] [INFO ] Implicit Places using invariants in 829 ms returned []
[2023-03-12 22:31:34] [INFO ] Invariant cache hit.
[2023-03-12 22:31:35] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:31:36] [INFO ] Implicit Places using invariants and state equation in 2139 ms returned []
Implicit Place search using SMT with State Equation took 2984 ms to find 0 implicit places.
[2023-03-12 22:31:36] [INFO ] Invariant cache hit.
[2023-03-12 22:31:38] [INFO ] Dead Transitions using invariants and state equation in 2496 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5632 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 284 ms :[(NOT p1), (NOT p1), true, (NOT p0), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 5}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0 (NOT p3) p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0 (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={1} source=5 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND p1 p0 (NOT p3) p2), acceptance={1} source=7 dest: 5}, { cond=(AND p1 p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={1} source=7 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(LEQ 2 s1549), p0:(LEQ s1823 s232), p3:(AND (GT s1336 s1718) (GT s2161 s1662)), p2:(GT s2161 s1662)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11884 steps with 16 reset in 69 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-14 finished in 6042 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' '!((p0 U X(p1)))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 86 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-12 22:31:39] [INFO ] Invariant cache hit.
[2023-03-12 22:31:40] [INFO ] Implicit Places using invariants in 740 ms returned []
[2023-03-12 22:31:40] [INFO ] Invariant cache hit.
[2023-03-12 22:31:40] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:31:42] [INFO ] Implicit Places using invariants and state equation in 2182 ms returned []
Implicit Place search using SMT with State Equation took 2937 ms to find 0 implicit places.
[2023-03-12 22:31:42] [INFO ] Invariant cache hit.
[2023-03-12 22:31:44] [INFO ] Dead Transitions using invariants and state equation in 2523 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5547 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(LEQ s706 s761), p1:(GT 3 s1998)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1617 ms.
Product exploration explored 100000 steps with 50000 reset in 1618 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 113 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-15 finished in 9059 ms.
All properties solved by simple procedures.
Total runtime 188230 ms.
ITS solved all properties within timeout

BK_STOP 1678660308502

--------------------
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

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-030"
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-030, 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-167813695100723"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-030.tgz
mv CANInsertWithFailure-PT-030 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 ;