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.r037-tajo-167813690700723.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 itstools
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 r037-tajo-167813690700723
=====================================================================

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

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-030
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 15:23:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 15:23:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 15:23:14] [INFO ] Load time of PNML (sax parser for PT used): 420 ms
[2023-03-09 15:23:14] [INFO ] Transformed 2164 places.
[2023-03-09 15:23:14] [INFO ] Transformed 5580 transitions.
[2023-03-09 15:23:14] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 594 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 310 ms. Remains 2163 /2164 variables (removed 1) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-09 15:23:15] [INFO ] Computed 32 place invariants in 385 ms
[2023-03-09 15:23:16] [INFO ] Implicit Places using invariants in 1269 ms returned []
[2023-03-09 15:23:16] [INFO ] Invariant cache hit.
[2023-03-09 15:23:17] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:23:18] [INFO ] Implicit Places using invariants and state equation in 1956 ms returned []
Implicit Place search using SMT with State Equation took 3258 ms to find 0 implicit places.
[2023-03-09 15:23:18] [INFO ] Invariant cache hit.
[2023-03-09 15:23:21] [INFO ] Dead Transitions using invariants and state equation in 2662 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 6236 ms. Remains : 2163/2164 places, 5580/5580 transitions.
Support contains 59 out of 2163 places after structural reductions.
[2023-03-09 15:23:21] [INFO ] Flatten gal took : 265 ms
[2023-03-09 15:23:21] [INFO ] Flatten gal took : 154 ms
[2023-03-09 15:23:22] [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 14 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 32) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) 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 20) 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 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) 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 19) 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 19) 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 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-09 15:23:22] [INFO ] Invariant cache hit.
[2023-03-09 15:23:23] [INFO ] [Real]Absence check using 30 positive place invariants in 25 ms returned sat
[2023-03-09 15:23:23] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 37 ms returned sat
[2023-03-09 15:23:23] [INFO ] After 928ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-09 15:23:24] [INFO ] [Nat]Absence check using 30 positive place invariants in 25 ms returned sat
[2023-03-09 15:23:24] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-09 15:23:30] [INFO ] After 4721ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :16
[2023-03-09 15:23:30] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:23:41] [INFO ] After 11289ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :2 sat :16
[2023-03-09 15:23:48] [INFO ] After 18622ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :15
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-09 15:23:48] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :15
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 7 properties in 580 ms.
Support contains 17 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 3 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 861 Post agglomeration using F-continuation condition.Transition count delta: 861
Deduced a syphon composed of 861 places in 4 ms
Reduce places removed 861 places and 0 transitions.
Iterating global reduction 3 with 1722 rules applied. Total rules applied 2140 place count 1093 transition count 4510
Drop transitions removed 804 transitions
Redundant transition composition rules discarded 804 transitions
Iterating global reduction 3 with 804 rules applied. Total rules applied 2944 place count 1093 transition count 3706
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2945 place count 1093 transition count 3705
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2946 place count 1092 transition count 3705
Partial Free-agglomeration rule applied 925 times.
Drop transitions removed 925 transitions
Iterating global reduction 4 with 925 rules applied. Total rules applied 3871 place count 1092 transition count 3705
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 3901 place count 1092 transition count 3705
Applied a total of 3901 rules in 1070 ms. Remains 1092 /2163 variables (removed 1071) and now considering 3705/5580 (removed 1875) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1071 ms. Remains : 1092/2163 places, 3705/5580 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) 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 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) 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 7) 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 7) 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 7) 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 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 3705 rows 1092 cols
[2023-03-09 15:23:50] [INFO ] Computed 32 place invariants in 45 ms
[2023-03-09 15:23:51] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2023-03-09 15:23:51] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-09 15:23:51] [INFO ] After 353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 15:23:51] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2023-03-09 15:23:51] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-09 15:23:52] [INFO ] After 1572ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 15:23:53] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2023-03-09 15:23:54] [INFO ] After 1824ms SMT Verify possible using 3583 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-09 15:23:57] [INFO ] After 4001ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1074 ms.
[2023-03-09 15:23:58] [INFO ] After 6957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 98 ms.
Support contains 11 out of 1092 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1092/1092 places, 3705/3705 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 1092 transition count 3704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1091 transition count 3704
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1089 transition count 3702
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 1089 transition count 3702
Applied a total of 9 rules in 264 ms. Remains 1089 /1092 variables (removed 3) and now considering 3702/3705 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 1089/1092 places, 3702/3705 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 14 ms. (steps per millisecond=714 ) properties (out of 7) 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 7) 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 7) 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 7) 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 7) seen :0
Interrupted probabilistic random walk after 212278 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212278 steps, saw 37089 distinct states, run finished after 3002 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 3702 rows 1089 cols
[2023-03-09 15:24:02] [INFO ] Computed 32 place invariants in 52 ms
[2023-03-09 15:24:02] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2023-03-09 15:24:02] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-09 15:24:02] [INFO ] After 570ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 15:24:02] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2023-03-09 15:24:02] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-09 15:24:04] [INFO ] After 1394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 15:24:04] [INFO ] State equation strengthened by 3588 read => feed constraints.
[2023-03-09 15:24:06] [INFO ] After 1702ms SMT Verify possible using 3588 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-09 15:24:07] [INFO ] After 3423ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1342 ms.
[2023-03-09 15:24:09] [INFO ] After 6527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 99 ms.
Support contains 11 out of 1089 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1089/1089 places, 3702/3702 transitions.
Applied a total of 0 rules in 92 ms. Remains 1089 /1089 variables (removed 0) and now considering 3702/3702 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 1089/1089 places, 3702/3702 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1089/1089 places, 3702/3702 transitions.
Applied a total of 0 rules in 98 ms. Remains 1089 /1089 variables (removed 0) and now considering 3702/3702 (removed 0) transitions.
[2023-03-09 15:24:09] [INFO ] Invariant cache hit.
[2023-03-09 15:24:10] [INFO ] Implicit Places using invariants in 1015 ms returned []
[2023-03-09 15:24:10] [INFO ] Invariant cache hit.
[2023-03-09 15:24:11] [INFO ] State equation strengthened by 3588 read => feed constraints.
[2023-03-09 15:24:29] [INFO ] Implicit Places using invariants and state equation in 19549 ms returned []
Implicit Place search using SMT with State Equation took 20573 ms to find 0 implicit places.
[2023-03-09 15:24:30] [INFO ] Redundant transitions in 245 ms returned []
[2023-03-09 15:24:30] [INFO ] Invariant cache hit.
[2023-03-09 15:24:31] [INFO ] Dead Transitions using invariants and state equation in 1255 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22188 ms. Remains : 1089/1089 places, 3702/3702 transitions.
Graph (trivial) has 3481 edges and 1089 vertex of which 954 / 1089 are part of one of the 2 SCC in 5 ms
Free SCC test removed 952 places
Drop transitions removed 2621 transitions
Ensure Unique test removed 920 transitions
Reduce isomorphic transitions removed 3541 transitions.
Graph (complete) has 346 edges and 137 vertex of which 46 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 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 46 transition count 70
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 93 place count 17 transition count 41
Iterating global reduction 1 with 29 rules applied. Total rules applied 122 place count 17 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 16 transition count 40
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 16 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 15 transition count 38
Applied a total of 126 rules in 17 ms. Remains 15 /1089 variables (removed 1074) and now considering 38/3702 (removed 3664) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 38 rows 15 cols
[2023-03-09 15:24:31] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 15:24:31] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 15:24:31] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 15:24:31] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 15:24:31] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
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 70 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-09 15:24:32] [INFO ] Computed 32 place invariants in 113 ms
[2023-03-09 15:24:32] [INFO ] Implicit Places using invariants in 974 ms returned []
[2023-03-09 15:24:32] [INFO ] Invariant cache hit.
[2023-03-09 15:24:34] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:24:41] [INFO ] Implicit Places using invariants and state equation in 8602 ms returned []
Implicit Place search using SMT with State Equation took 9577 ms to find 0 implicit places.
[2023-03-09 15:24:41] [INFO ] Invariant cache hit.
[2023-03-09 15:24:44] [INFO ] Dead Transitions using invariants and state equation in 2614 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12267 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 179 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 12512 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 88 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-09 15:24:44] [INFO ] Invariant cache hit.
[2023-03-09 15:24:45] [INFO ] Implicit Places using invariants in 714 ms returned []
[2023-03-09 15:24:45] [INFO ] Invariant cache hit.
[2023-03-09 15:24:46] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:24:47] [INFO ] Implicit Places using invariants and state equation in 2022 ms returned []
Implicit Place search using SMT with State Equation took 2753 ms to find 0 implicit places.
[2023-03-09 15:24:47] [INFO ] Invariant cache hit.
[2023-03-09 15:24:49] [INFO ] Dead Transitions using invariants and state equation in 2206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5051 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 132 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 616 steps with 0 reset in 8 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-01 finished in 5221 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 64 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-09 15:24:49] [INFO ] Invariant cache hit.
[2023-03-09 15:24:50] [INFO ] Implicit Places using invariants in 784 ms returned []
[2023-03-09 15:24:50] [INFO ] Invariant cache hit.
[2023-03-09 15:24:51] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:24:52] [INFO ] Implicit Places using invariants and state equation in 2259 ms returned []
Implicit Place search using SMT with State Equation took 3049 ms to find 0 implicit places.
[2023-03-09 15:24:52] [INFO ] Invariant cache hit.
[2023-03-09 15:24:54] [INFO ] Dead Transitions using invariants and state equation in 2210 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5326 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 138 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 1313 ms.
Product exploration explored 100000 steps with 33333 reset in 1408 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 154 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 8406 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 533 ms. Remains 1087 /2163 variables (removed 1076) and now considering 3694/5580 (removed 1886) transitions.
// Phase 1: matrix 3694 rows 1087 cols
[2023-03-09 15:24:58] [INFO ] Computed 32 place invariants in 36 ms
[2023-03-09 15:24:59] [INFO ] Implicit Places using invariants in 578 ms returned []
[2023-03-09 15:24:59] [INFO ] Invariant cache hit.
[2023-03-09 15:24:59] [INFO ] State equation strengthened by 2665 read => feed constraints.
[2023-03-09 15:25:05] [INFO ] Implicit Places using invariants and state equation in 6456 ms returned []
Implicit Place search using SMT with State Equation took 7044 ms to find 0 implicit places.
[2023-03-09 15:25:05] [INFO ] Redundant transitions in 200 ms returned []
[2023-03-09 15:25:05] [INFO ] Invariant cache hit.
[2023-03-09 15:25:07] [INFO ] Dead Transitions using invariants and state equation in 1391 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 9182 ms. Remains : 1087/2163 places, 3694/5580 transitions.
Stuttering acceptance computed with spot in 201 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 135 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-04 finished in 9412 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 72 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-09 15:25:07] [INFO ] Computed 32 place invariants in 230 ms
[2023-03-09 15:25:08] [INFO ] Implicit Places using invariants in 937 ms returned []
[2023-03-09 15:25:08] [INFO ] Invariant cache hit.
[2023-03-09 15:25:09] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:25:10] [INFO ] Implicit Places using invariants and state equation in 2283 ms returned []
Implicit Place search using SMT with State Equation took 3235 ms to find 0 implicit places.
[2023-03-09 15:25:10] [INFO ] Invariant cache hit.
[2023-03-09 15:25:13] [INFO ] Dead Transitions using invariants and state equation in 2442 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5750 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 115 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 931 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 5902 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 75 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-09 15:25:13] [INFO ] Invariant cache hit.
[2023-03-09 15:25:14] [INFO ] Implicit Places using invariants in 698 ms returned []
[2023-03-09 15:25:14] [INFO ] Invariant cache hit.
[2023-03-09 15:25:14] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:25:16] [INFO ] Implicit Places using invariants and state equation in 2020 ms returned []
Implicit Place search using SMT with State Equation took 2727 ms to find 0 implicit places.
[2023-03-09 15:25:16] [INFO ] Invariant cache hit.
[2023-03-09 15:25:18] [INFO ] Dead Transitions using invariants and state equation in 2348 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5160 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 219 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 1654 ms.
Product exploration explored 100000 steps with 50000 reset in 1635 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 216 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 8927 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 60 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-09 15:25:22] [INFO ] Invariant cache hit.
[2023-03-09 15:25:22] [INFO ] Implicit Places using invariants in 615 ms returned []
[2023-03-09 15:25:22] [INFO ] Invariant cache hit.
[2023-03-09 15:25:23] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:25:25] [INFO ] Implicit Places using invariants and state equation in 2459 ms returned []
Implicit Place search using SMT with State Equation took 3090 ms to find 0 implicit places.
[2023-03-09 15:25:25] [INFO ] Invariant cache hit.
[2023-03-09 15:25:28] [INFO ] Dead Transitions using invariants and state equation in 2670 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5842 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 113 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 909 steps with 0 reset in 9 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-08 finished in 6007 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 1 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 523 ms. Remains 1087 /2163 variables (removed 1076) and now considering 3694/5580 (removed 1886) transitions.
// Phase 1: matrix 3694 rows 1087 cols
[2023-03-09 15:25:28] [INFO ] Computed 32 place invariants in 49 ms
[2023-03-09 15:25:29] [INFO ] Implicit Places using invariants in 553 ms returned []
[2023-03-09 15:25:29] [INFO ] Invariant cache hit.
[2023-03-09 15:25:30] [INFO ] State equation strengthened by 2665 read => feed constraints.
[2023-03-09 15:25:35] [INFO ] Implicit Places using invariants and state equation in 6145 ms returned []
Implicit Place search using SMT with State Equation took 6716 ms to find 0 implicit places.
[2023-03-09 15:25:35] [INFO ] Redundant transitions in 156 ms returned []
[2023-03-09 15:25:35] [INFO ] Invariant cache hit.
[2023-03-09 15:25:36] [INFO ] Dead Transitions using invariants and state equation in 1272 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 8678 ms. Remains : 1087/2163 places, 3694/5580 transitions.
Stuttering acceptance computed with spot in 87 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 154 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 8788 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 371 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
// Phase 1: matrix 3690 rows 1084 cols
[2023-03-09 15:25:37] [INFO ] Computed 32 place invariants in 38 ms
[2023-03-09 15:25:37] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-03-09 15:25:37] [INFO ] Invariant cache hit.
[2023-03-09 15:25:38] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-09 15:25:44] [INFO ] Implicit Places using invariants and state equation in 6196 ms returned []
Implicit Place search using SMT with State Equation took 6749 ms to find 0 implicit places.
[2023-03-09 15:25:44] [INFO ] Redundant transitions in 183 ms returned []
[2023-03-09 15:25:44] [INFO ] Invariant cache hit.
[2023-03-09 15:25:45] [INFO ] Dead Transitions using invariants and state equation in 1426 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 8753 ms. Remains : 1084/2163 places, 3690/5580 transitions.
Stuttering acceptance computed with spot in 103 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 363 steps with 2 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-11 finished in 8878 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 67 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-09 15:25:46] [INFO ] Computed 32 place invariants in 174 ms
[2023-03-09 15:25:46] [INFO ] Implicit Places using invariants in 970 ms returned []
[2023-03-09 15:25:46] [INFO ] Invariant cache hit.
[2023-03-09 15:25:47] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:25:49] [INFO ] Implicit Places using invariants and state equation in 2177 ms returned []
Implicit Place search using SMT with State Equation took 3152 ms to find 0 implicit places.
[2023-03-09 15:25:49] [INFO ] Invariant cache hit.
[2023-03-09 15:25:51] [INFO ] Dead Transitions using invariants and state equation in 2644 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5868 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 170 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 1837 ms.
Product exploration explored 100000 steps with 50000 reset in 1824 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 464 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 10202 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 114 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-09 15:25:56] [INFO ] Invariant cache hit.
[2023-03-09 15:25:57] [INFO ] Implicit Places using invariants in 890 ms returned []
[2023-03-09 15:25:57] [INFO ] Invariant cache hit.
[2023-03-09 15:25:57] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:25:59] [INFO ] Implicit Places using invariants and state equation in 1977 ms returned []
Implicit Place search using SMT with State Equation took 2874 ms to find 0 implicit places.
[2023-03-09 15:25:59] [INFO ] Invariant cache hit.
[2023-03-09 15:26:01] [INFO ] Dead Transitions using invariants and state equation in 2189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5178 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 166 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 18012 steps with 25 reset in 94 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-13 finished in 5465 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 99 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-09 15:26:01] [INFO ] Invariant cache hit.
[2023-03-09 15:26:02] [INFO ] Implicit Places using invariants in 694 ms returned []
[2023-03-09 15:26:02] [INFO ] Invariant cache hit.
[2023-03-09 15:26:03] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:26:04] [INFO ] Implicit Places using invariants and state equation in 2032 ms returned []
Implicit Place search using SMT with State Equation took 2729 ms to find 0 implicit places.
[2023-03-09 15:26:04] [INFO ] Invariant cache hit.
[2023-03-09 15:26:06] [INFO ] Dead Transitions using invariants and state equation in 2244 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5074 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 340 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 1207 steps with 1 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-14 finished in 5484 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 57 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-09 15:26:07] [INFO ] Invariant cache hit.
[2023-03-09 15:26:07] [INFO ] Implicit Places using invariants in 698 ms returned []
[2023-03-09 15:26:07] [INFO ] Invariant cache hit.
[2023-03-09 15:26:08] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:26:09] [INFO ] Implicit Places using invariants and state equation in 2009 ms returned []
Implicit Place search using SMT with State Equation took 2725 ms to find 0 implicit places.
[2023-03-09 15:26:09] [INFO ] Invariant cache hit.
[2023-03-09 15:26:12] [INFO ] Dead Transitions using invariants and state equation in 2224 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5008 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 101 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 1855 ms.
Product exploration explored 100000 steps with 50000 reset in 1966 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 152 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 9118 ms.
All properties solved by simple procedures.
Total runtime 182421 ms.

BK_STOP 1678375576436

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-030"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
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 r037-tajo-167813690700723"
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 ;