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.r039-tajo-167813692900731.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 lolaxred
Input is CANInsertWithFailure-PT-040, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692900731
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 9.3K Feb 26 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 00:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 01:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 01:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:11 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 9.8M 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-040-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678506566562

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-040
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:49:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 03:49:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:49:29] [INFO ] Load time of PNML (sax parser for PT used): 346 ms
[2023-03-11 03:49:29] [INFO ] Transformed 3684 places.
[2023-03-11 03:49:29] [INFO ] Transformed 9840 transitions.
[2023-03-11 03:49:29] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 479 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 3684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3683 transition count 9840
Applied a total of 1 rules in 615 ms. Remains 3683 /3684 variables (removed 1) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-11 03:49:31] [INFO ] Computed 42 place invariants in 655 ms
[2023-03-11 03:49:32] [INFO ] Implicit Places using invariants in 1840 ms returned []
[2023-03-11 03:49:32] [INFO ] Invariant cache hit.
[2023-03-11 03:49:33] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 2780 ms to find 0 implicit places.
[2023-03-11 03:49:33] [INFO ] Invariant cache hit.
[2023-03-11 03:49:37] [INFO ] Dead Transitions using invariants and state equation in 4672 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3683/3684 places, 9840/9840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8077 ms. Remains : 3683/3684 places, 9840/9840 transitions.
Support contains 48 out of 3683 places after structural reductions.
[2023-03-11 03:49:38] [INFO ] Flatten gal took : 347 ms
[2023-03-11 03:49:38] [INFO ] Flatten gal took : 278 ms
[2023-03-11 03:49:39] [INFO ] Input system was already deterministic with 9840 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 625 ms. (steps per millisecond=16 ) properties (out of 30) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 25) 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 25) 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 25) 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 25) 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 25) 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 25) seen :0
Running SMT prover for 25 properties.
[2023-03-11 03:49:40] [INFO ] Invariant cache hit.
[2023-03-11 03:49:42] [INFO ] [Real]Absence check using 40 positive place invariants in 46 ms returned sat
[2023-03-11 03:49:42] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 55 ms returned sat
[2023-03-11 03:49:42] [INFO ] After 2136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-11 03:49:44] [INFO ] [Nat]Absence check using 40 positive place invariants in 41 ms returned sat
[2023-03-11 03:49:44] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 53 ms returned sat
[2023-03-11 03:49:58] [INFO ] After 13392ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :23
[2023-03-11 03:49:59] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:50:07] [INFO ] After 8328ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :2 sat :22
[2023-03-11 03:50:07] [INFO ] After 8329ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :22
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 03:50:07] [INFO ] After 25106ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :22
Fused 25 Parikh solutions to 23 different solutions.
Parikh walk visited 2 properties in 1849 ms.
Support contains 35 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 274 transitions
Trivial Post-agglo rules discarded 274 transitions
Performed 274 trivial Post agglomeration. Transition count delta: 274
Iterating post reduction 0 with 274 rules applied. Total rules applied 274 place count 3683 transition count 9566
Reduce places removed 274 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 277 rules applied. Total rules applied 551 place count 3409 transition count 9563
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 554 place count 3406 transition count 9563
Performed 1468 Post agglomeration using F-continuation condition.Transition count delta: 1468
Deduced a syphon composed of 1468 places in 6 ms
Reduce places removed 1468 places and 0 transitions.
Iterating global reduction 3 with 2936 rules applied. Total rules applied 3490 place count 1938 transition count 8095
Drop transitions removed 1393 transitions
Redundant transition composition rules discarded 1393 transitions
Iterating global reduction 3 with 1393 rules applied. Total rules applied 4883 place count 1938 transition count 6702
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 4886 place count 1938 transition count 6699
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4889 place count 1935 transition count 6699
Partial Free-agglomeration rule applied 1700 times.
Drop transitions removed 1700 transitions
Iterating global reduction 4 with 1700 rules applied. Total rules applied 6589 place count 1935 transition count 6699
Applied a total of 6589 rules in 1874 ms. Remains 1935 /3683 variables (removed 1748) and now considering 6699/9840 (removed 3141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1876 ms. Remains : 1935/3683 places, 6699/9840 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 21) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) 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 3 ms. (steps per millisecond=333 ) properties (out of 15) 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 15) 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 15) 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 15) 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 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 3 ms. (steps per millisecond=333 ) properties (out of 15) 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 15) 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 15) 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 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 3 ms. (steps per millisecond=333 ) 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
Running SMT prover for 15 properties.
// Phase 1: matrix 6699 rows 1935 cols
[2023-03-11 03:50:11] [INFO ] Computed 42 place invariants in 240 ms
[2023-03-11 03:50:12] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-11 03:50:12] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 24 ms returned sat
[2023-03-11 03:50:12] [INFO ] After 846ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-11 03:50:13] [INFO ] [Nat]Absence check using 40 positive place invariants in 21 ms returned sat
[2023-03-11 03:50:13] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 25 ms returned sat
[2023-03-11 03:50:19] [INFO ] After 5430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-11 03:50:19] [INFO ] State equation strengthened by 6324 read => feed constraints.
[2023-03-11 03:50:26] [INFO ] After 7416ms SMT Verify possible using 6324 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-11 03:50:33] [INFO ] After 14592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 3915 ms.
[2023-03-11 03:50:37] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 1 properties in 439 ms.
Support contains 22 out of 1935 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1935/1935 places, 6699/6699 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1929 transition count 6693
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 1929 transition count 6693
Applied a total of 18 rules in 561 ms. Remains 1929 /1935 variables (removed 6) and now considering 6693/6699 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 561 ms. Remains : 1929/1935 places, 6693/6699 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 74657 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74657 steps, saw 27899 distinct states, run finished after 3003 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 6693 rows 1929 cols
[2023-03-11 03:50:42] [INFO ] Computed 42 place invariants in 148 ms
[2023-03-11 03:50:43] [INFO ] [Real]Absence check using 40 positive place invariants in 24 ms returned sat
[2023-03-11 03:50:43] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 27 ms returned sat
[2023-03-11 03:50:43] [INFO ] After 890ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-11 03:50:44] [INFO ] [Nat]Absence check using 40 positive place invariants in 53 ms returned sat
[2023-03-11 03:50:44] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 31 ms returned sat
[2023-03-11 03:50:50] [INFO ] After 5763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-11 03:50:50] [INFO ] State equation strengthened by 6342 read => feed constraints.
[2023-03-11 03:50:57] [INFO ] After 6793ms SMT Verify possible using 6342 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-11 03:51:03] [INFO ] After 12971ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 4498 ms.
[2023-03-11 03:51:07] [INFO ] After 24331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 187 ms.
Support contains 22 out of 1929 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1929/1929 places, 6693/6693 transitions.
Applied a total of 0 rules in 217 ms. Remains 1929 /1929 variables (removed 0) and now considering 6693/6693 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 1929/1929 places, 6693/6693 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1929/1929 places, 6693/6693 transitions.
Applied a total of 0 rules in 243 ms. Remains 1929 /1929 variables (removed 0) and now considering 6693/6693 (removed 0) transitions.
[2023-03-11 03:51:08] [INFO ] Invariant cache hit.
[2023-03-11 03:51:11] [INFO ] Implicit Places using invariants in 3452 ms returned []
[2023-03-11 03:51:11] [INFO ] Invariant cache hit.
[2023-03-11 03:51:13] [INFO ] State equation strengthened by 6342 read => feed constraints.
[2023-03-11 03:51:14] [INFO ] Implicit Places using invariants and state equation in 2071 ms returned []
Implicit Place search using SMT with State Equation took 5536 ms to find 0 implicit places.
[2023-03-11 03:51:14] [INFO ] Redundant transitions in 877 ms returned []
[2023-03-11 03:51:14] [INFO ] Invariant cache hit.
[2023-03-11 03:51:18] [INFO ] Dead Transitions using invariants and state equation in 3959 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10631 ms. Remains : 1929/1929 places, 6693/6693 transitions.
Graph (trivial) has 6185 edges and 1929 vertex of which 1663 / 1929 are part of one of the 2 SCC in 17 ms
Free SCC test removed 1661 places
Drop transitions removed 4604 transitions
Ensure Unique test removed 1584 transitions
Reduce isomorphic transitions removed 6188 transitions.
Graph (complete) has 787 edges and 268 vertex of which 149 are kept as prefixes of interest. Removing 119 places using SCC suffix rule.2 ms
Discarding 119 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Drop transitions removed 154 transitions
Reduce isomorphic transitions removed 154 transitions.
Iterating post reduction 0 with 154 rules applied. Total rules applied 156 place count 149 transition count 313
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 230 place count 75 transition count 201
Iterating global reduction 1 with 74 rules applied. Total rules applied 304 place count 75 transition count 201
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 341 place count 38 transition count 127
Iterating global reduction 1 with 37 rules applied. Total rules applied 378 place count 38 transition count 127
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 415 place count 38 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 419 place count 36 transition count 89
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 427 place count 36 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 428 place count 35 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 429 place count 35 transition count 80
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 2 with 2 rules applied. Total rules applied 431 place count 34 transition count 79
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 2 with 2 rules applied. Total rules applied 433 place count 33 transition count 78
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 436 place count 33 transition count 75
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 441 place count 30 transition count 73
Applied a total of 441 rules in 71 ms. Remains 30 /1929 variables (removed 1899) and now considering 73/6693 (removed 6620) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 73 rows 30 cols
[2023-03-11 03:51:18] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 03:51:19] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-11 03:51:19] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-11 03:51:19] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-11 03:51:19] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Computed a total of 162 stabilizing places and 280 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((G(p0)||(X(p1)&&(!p0||F(!p1)))))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 429 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-11 03:51:20] [INFO ] Computed 42 place invariants in 448 ms
[2023-03-11 03:51:22] [INFO ] Implicit Places using invariants in 2714 ms returned []
[2023-03-11 03:51:22] [INFO ] Invariant cache hit.
[2023-03-11 03:51:25] [INFO ] Implicit Places using invariants and state equation in 3146 ms returned []
Implicit Place search using SMT with State Equation took 5875 ms to find 0 implicit places.
[2023-03-11 03:51:25] [INFO ] Invariant cache hit.
[2023-03-11 03:51:31] [INFO ] Dead Transitions using invariants and state equation in 5303 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11616 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 573 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND p1 (NOT p0)), true, (AND (NOT p0) p1), p1]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}], [{ cond=p1, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 3 s3630), p1:(LEQ 1 s999)], 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, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-00 finished in 12311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(p1||(p2&&X(X(p3)))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 323 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-11 03:51:32] [INFO ] Invariant cache hit.
[2023-03-11 03:51:34] [INFO ] Implicit Places using invariants in 2168 ms returned []
[2023-03-11 03:51:34] [INFO ] Invariant cache hit.
[2023-03-11 03:51:35] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 3008 ms to find 0 implicit places.
[2023-03-11 03:51:35] [INFO ] Invariant cache hit.
[2023-03-11 03:51:39] [INFO ] Dead Transitions using invariants and state equation in 4284 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7634 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p3), (NOT p3)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}]], initial=0, aps=[p1:(AND (LEQ s2891 s2502) (LEQ s3381 s3509)), p2:(LEQ s3381 s3509), p0:(LEQ s2891 s2502), p3:(GT 3 s1655)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33266 reset in 2345 ms.
Product exploration explored 100000 steps with 33165 reset in 1984 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 p2 p0 p3), (X (OR p1 p2)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (OR p1 p2))), true, (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 784 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p3), (NOT p3)]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) 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 3) seen :2
Running SMT prover for 1 properties.
[2023-03-11 03:51:45] [INFO ] Invariant cache hit.
[2023-03-11 03:51:46] [INFO ] [Real]Absence check using 40 positive place invariants in 32 ms returned sat
[2023-03-11 03:51:46] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 38 ms returned sat
[2023-03-11 03:51:50] [INFO ] After 3985ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:51:50] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:51:51] [INFO ] After 1106ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:51:51] [INFO ] After 5723ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:51:52] [INFO ] [Nat]Absence check using 40 positive place invariants in 54 ms returned sat
[2023-03-11 03:51:52] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 45 ms returned sat
[2023-03-11 03:51:56] [INFO ] After 4292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:52:01] [INFO ] After 4622ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:52:01] [INFO ] After 5056ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 315 ms.
[2023-03-11 03:52:01] [INFO ] After 10359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1560 Post agglomeration using F-continuation condition.Transition count delta: 1560
Deduced a syphon composed of 1560 places in 3 ms
Reduce places removed 1560 places and 0 transitions.
Iterating global reduction 2 with 3120 rules applied. Total rules applied 3680 place count 1843 transition count 8000
Drop transitions removed 1482 transitions
Redundant transition composition rules discarded 1482 transitions
Iterating global reduction 2 with 1482 rules applied. Total rules applied 5162 place count 1843 transition count 6518
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5163 place count 1843 transition count 6517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5164 place count 1842 transition count 6517
Partial Free-agglomeration rule applied 1640 times.
Drop transitions removed 1640 transitions
Iterating global reduction 3 with 1640 rules applied. Total rules applied 6804 place count 1842 transition count 6517
Applied a total of 6804 rules in 1374 ms. Remains 1842 /3683 variables (removed 1841) and now considering 6517/9840 (removed 3323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1374 ms. Remains : 1842/3683 places, 6517/9840 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 118864 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118864 steps, saw 33058 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6517 rows 1842 cols
[2023-03-11 03:52:06] [INFO ] Computed 42 place invariants in 273 ms
[2023-03-11 03:52:06] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2023-03-11 03:52:07] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-11 03:52:08] [INFO ] After 1847ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:52:08] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2023-03-11 03:52:10] [INFO ] After 1984ms SMT Verify possible using 6397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:52:10] [INFO ] After 4293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:52:11] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-11 03:52:11] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2023-03-11 03:52:13] [INFO ] After 2383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:52:15] [INFO ] After 1608ms SMT Verify possible using 6397 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:52:15] [INFO ] After 2016ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 266 ms.
[2023-03-11 03:52:16] [INFO ] After 5033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 296 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 243 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
[2023-03-11 03:52:16] [INFO ] Invariant cache hit.
[2023-03-11 03:52:19] [INFO ] Implicit Places using invariants in 3237 ms returned []
[2023-03-11 03:52:19] [INFO ] Invariant cache hit.
[2023-03-11 03:52:20] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2023-03-11 03:52:31] [INFO ] Implicit Places using invariants and state equation in 11501 ms returned []
Implicit Place search using SMT with State Equation took 14747 ms to find 0 implicit places.
[2023-03-11 03:52:31] [INFO ] Redundant transitions in 601 ms returned []
[2023-03-11 03:52:31] [INFO ] Invariant cache hit.
[2023-03-11 03:52:40] [INFO ] Dead Transitions using invariants and state equation in 8280 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23906 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Graph (trivial) has 6274 edges and 1842 vertex of which 1678 / 1842 are part of one of the 2 SCC in 3 ms
Free SCC test removed 1676 places
Drop transitions removed 4716 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6348 transitions.
Graph (complete) has 411 edges and 166 vertex of which 45 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.1 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 45 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 44 transition count 48
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 6 transition count 10
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 place count 6 transition count 10
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 6 transition count 7
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 166 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 4 transition count 5
Applied a total of 167 rules in 25 ms. Remains 4 /1842 variables (removed 1838) and now considering 5/6517 (removed 6512) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2023-03-11 03:52:40] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 03:52:40] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:52:40] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:52:40] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-11 03:52:40] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p2 p0 p3), (X (OR p1 p2)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (OR p1 p2))), true, (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p3))]
False Knowledge obtained : [(F (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (F (NOT (OR p1 p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p2)))
Knowledge based reduction with 11 factoid took 235 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-01 finished in 68848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(G(p0))||F(p1))))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 299 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-11 03:52:41] [INFO ] Computed 42 place invariants in 530 ms
[2023-03-11 03:52:43] [INFO ] Implicit Places using invariants in 2408 ms returned []
[2023-03-11 03:52:43] [INFO ] Invariant cache hit.
[2023-03-11 03:52:45] [INFO ] Implicit Places using invariants and state equation in 2106 ms returned []
Implicit Place search using SMT with State Equation took 4522 ms to find 0 implicit places.
[2023-03-11 03:52:45] [INFO ] Invariant cache hit.
[2023-03-11 03:52:50] [INFO ] Dead Transitions using invariants and state equation in 4879 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9704 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 325 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(GT 2 s3156), p0:(LEQ 2 s791)], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1757 ms.
Product exploration explored 100000 steps with 25000 reset in 1841 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 337 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 74348 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74348 steps, saw 48244 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:52:58] [INFO ] Invariant cache hit.
[2023-03-11 03:52:58] [INFO ] [Real]Absence check using 40 positive place invariants in 29 ms returned sat
[2023-03-11 03:52:58] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 39 ms returned sat
[2023-03-11 03:53:03] [INFO ] After 5030ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-11 03:53:03] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:53:05] [INFO ] After 1507ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:53:05] [INFO ] After 7225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:53:06] [INFO ] [Nat]Absence check using 40 positive place invariants in 48 ms returned sat
[2023-03-11 03:53:06] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 53 ms returned sat
[2023-03-11 03:53:11] [INFO ] After 5562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:53:26] [INFO ] After 14251ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:53:27] [INFO ] After 15917ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1042 ms.
[2023-03-11 03:53:28] [INFO ] After 23510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5160 place count 1844 transition count 6519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5161 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1640 times.
Drop transitions removed 1640 transitions
Iterating global reduction 3 with 1640 rules applied. Total rules applied 6801 place count 1843 transition count 6519
Applied a total of 6801 rules in 1639 ms. Remains 1843 /3683 variables (removed 1840) and now considering 6519/9840 (removed 3321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1640 ms. Remains : 1843/3683 places, 6519/9840 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 115529 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115529 steps, saw 32526 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2023-03-11 03:53:34] [INFO ] Computed 42 place invariants in 279 ms
[2023-03-11 03:53:34] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2023-03-11 03:53:34] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-11 03:53:36] [INFO ] After 2215ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 03:53:36] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2023-03-11 03:53:37] [INFO ] After 1115ms SMT Verify possible using 6396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:53:37] [INFO ] After 3878ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:53:38] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-11 03:53:38] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2023-03-11 03:53:40] [INFO ] After 2439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:53:43] [INFO ] After 2368ms SMT Verify possible using 6396 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:53:44] [INFO ] After 3422ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 963 ms.
[2023-03-11 03:53:45] [INFO ] After 7276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 234 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 242 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2023-03-11 03:53:45] [INFO ] Invariant cache hit.
[2023-03-11 03:53:47] [INFO ] Implicit Places using invariants in 1997 ms returned []
[2023-03-11 03:53:47] [INFO ] Invariant cache hit.
[2023-03-11 03:53:48] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2023-03-11 03:53:59] [INFO ] Implicit Places using invariants and state equation in 11705 ms returned []
Implicit Place search using SMT with State Equation took 13706 ms to find 0 implicit places.
[2023-03-11 03:54:00] [INFO ] Redundant transitions in 536 ms returned []
[2023-03-11 03:54:00] [INFO ] Invariant cache hit.
[2023-03-11 03:54:02] [INFO ] Dead Transitions using invariants and state equation in 2759 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17261 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6272 edges and 1843 vertex of which 1678 / 1843 are part of one of the 2 SCC in 2 ms
Free SCC test removed 1676 places
Drop transitions removed 4715 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6347 transitions.
Graph (complete) has 414 edges and 167 vertex of which 46 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.1 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 46 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 45 transition count 51
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 7 transition count 13
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 7 transition count 10
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 166 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 5 transition count 8
Applied a total of 167 rules in 14 ms. Remains 5 /1843 variables (removed 1838) and now considering 8/6519 (removed 6511) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-11 03:54:02] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 03:54:02] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:54:02] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:54:02] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 03:54:02] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 353 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 325 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-11 03:54:04] [INFO ] Computed 42 place invariants in 564 ms
[2023-03-11 03:54:08] [INFO ] Implicit Places using invariants in 4238 ms returned []
[2023-03-11 03:54:08] [INFO ] Invariant cache hit.
[2023-03-11 03:54:09] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 5095 ms to find 0 implicit places.
[2023-03-11 03:54:09] [INFO ] Invariant cache hit.
[2023-03-11 03:54:09] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 03:54:13] [INFO ] Dead Transitions using invariants and state equation in 4327 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9751 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 373 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 73954 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73954 steps, saw 48173 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:54:17] [INFO ] Invariant cache hit.
[2023-03-11 03:54:18] [INFO ] [Real]Absence check using 40 positive place invariants in 36 ms returned sat
[2023-03-11 03:54:18] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 48 ms returned sat
[2023-03-11 03:54:23] [INFO ] After 4963ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-11 03:54:23] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:54:24] [INFO ] After 1562ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:54:24] [INFO ] After 7317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:54:25] [INFO ] [Nat]Absence check using 40 positive place invariants in 56 ms returned sat
[2023-03-11 03:54:25] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 57 ms returned sat
[2023-03-11 03:54:31] [INFO ] After 5953ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:54:45] [INFO ] After 13638ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:54:46] [INFO ] After 15295ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1009 ms.
[2023-03-11 03:54:47] [INFO ] After 23210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5160 place count 1844 transition count 6519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5161 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1640 times.
Drop transitions removed 1640 transitions
Iterating global reduction 3 with 1640 rules applied. Total rules applied 6801 place count 1843 transition count 6519
Applied a total of 6801 rules in 2114 ms. Remains 1843 /3683 variables (removed 1840) and now considering 6519/9840 (removed 3321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2114 ms. Remains : 1843/3683 places, 6519/9840 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 107484 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107484 steps, saw 28412 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2023-03-11 03:54:53] [INFO ] Computed 42 place invariants in 203 ms
[2023-03-11 03:54:53] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2023-03-11 03:54:53] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2023-03-11 03:54:56] [INFO ] After 2443ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 03:54:56] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2023-03-11 03:54:57] [INFO ] After 1172ms SMT Verify possible using 6396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:54:57] [INFO ] After 4143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:54:58] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-11 03:54:58] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2023-03-11 03:55:00] [INFO ] After 2427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:55:03] [INFO ] After 2720ms SMT Verify possible using 6396 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:55:04] [INFO ] After 3889ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 979 ms.
[2023-03-11 03:55:05] [INFO ] After 7764ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 217 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 247 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2023-03-11 03:55:05] [INFO ] Invariant cache hit.
[2023-03-11 03:55:07] [INFO ] Implicit Places using invariants in 2009 ms returned []
[2023-03-11 03:55:08] [INFO ] Invariant cache hit.
[2023-03-11 03:55:08] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2023-03-11 03:55:19] [INFO ] Implicit Places using invariants and state equation in 11067 ms returned []
Implicit Place search using SMT with State Equation took 13090 ms to find 0 implicit places.
[2023-03-11 03:55:19] [INFO ] Redundant transitions in 419 ms returned []
[2023-03-11 03:55:19] [INFO ] Invariant cache hit.
[2023-03-11 03:55:23] [INFO ] Dead Transitions using invariants and state equation in 4239 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18017 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6272 edges and 1843 vertex of which 1678 / 1843 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1676 places
Drop transitions removed 4715 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6347 transitions.
Graph (complete) has 414 edges and 167 vertex of which 46 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 46 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 45 transition count 51
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 7 transition count 13
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 7 transition count 10
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 166 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 5 transition count 8
Applied a total of 167 rules in 11 ms. Remains 5 /1843 variables (removed 1838) and now considering 8/6519 (removed 6511) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-11 03:55:23] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 03:55:23] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:55:23] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:55:23] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-11 03:55:23] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 382 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 329 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 1794 ms.
Product exploration explored 100000 steps with 25000 reset in 1550 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 356 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 3683 transition count 9840
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 200 place count 3683 transition count 9840
Deduced a syphon composed of 240 places in 3 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 240 place count 3683 transition count 9840
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 320 place count 3603 transition count 9760
Deduced a syphon composed of 160 places in 8 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 400 place count 3603 transition count 9760
Performed 1599 Post agglomeration using F-continuation condition.Transition count delta: -3038
Deduced a syphon composed of 1759 places in 4 ms
Iterating global reduction 1 with 1599 rules applied. Total rules applied 1999 place count 3603 transition count 12798
Discarding 160 places :
Symmetric choice reduction at 1 with 160 rule applications. Total rules 2159 place count 3443 transition count 12638
Deduced a syphon composed of 1599 places in 3 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 2319 place count 3443 transition count 12638
Deduced a syphon composed of 1599 places in 2 ms
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 1 with 1481 rules applied. Total rules applied 3800 place count 3443 transition count 11157
Deduced a syphon composed of 1599 places in 2 ms
Applied a total of 3800 rules in 2988 ms. Remains 3443 /3683 variables (removed 240) and now considering 11157/9840 (removed -1317) transitions.
// Phase 1: matrix 11157 rows 3443 cols
[2023-03-11 03:55:32] [INFO ] Computed 42 place invariants in 534 ms
[2023-03-11 03:55:37] [INFO ] Dead Transitions using invariants and state equation in 5354 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3443/3683 places, 11157/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8348 ms. Remains : 3443/3683 places, 11157/9840 transitions.
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 321 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-11 03:55:38] [INFO ] Computed 42 place invariants in 542 ms
[2023-03-11 03:55:39] [INFO ] Implicit Places using invariants in 1462 ms returned []
[2023-03-11 03:55:39] [INFO ] Invariant cache hit.
[2023-03-11 03:55:42] [INFO ] Implicit Places using invariants and state equation in 3104 ms returned []
Implicit Place search using SMT with State Equation took 4572 ms to find 0 implicit places.
[2023-03-11 03:55:42] [INFO ] Invariant cache hit.
[2023-03-11 03:55:47] [INFO ] Dead Transitions using invariants and state equation in 5049 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9945 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-02 finished in 187205 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&&X(X(G(p1))))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 306 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-11 03:55:48] [INFO ] Invariant cache hit.
[2023-03-11 03:55:49] [INFO ] Implicit Places using invariants in 903 ms returned []
[2023-03-11 03:55:49] [INFO ] Invariant cache hit.
[2023-03-11 03:55:52] [INFO ] Implicit Places using invariants and state equation in 3055 ms returned []
Implicit Place search using SMT with State Equation took 3964 ms to find 0 implicit places.
[2023-03-11 03:55:52] [INFO ] Invariant cache hit.
[2023-03-11 03:55:56] [INFO ] Dead Transitions using invariants and state equation in 4462 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8736 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(GT 3 s1299), p1:(LEQ 2 s702)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-03 finished in 8964 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&&F(p1))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 247 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-11 03:55:57] [INFO ] Invariant cache hit.
[2023-03-11 03:55:57] [INFO ] Implicit Places using invariants in 910 ms returned []
[2023-03-11 03:55:57] [INFO ] Invariant cache hit.
[2023-03-11 03:55:59] [INFO ] Implicit Places using invariants and state equation in 1369 ms returned []
Implicit Place search using SMT with State Equation took 2283 ms to find 0 implicit places.
[2023-03-11 03:55:59] [INFO ] Invariant cache hit.
[2023-03-11 03:56:04] [INFO ] Dead Transitions using invariants and state equation in 4729 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7271 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s2157 s3372), p0:(LEQ s692 s2695)], 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 2748 ms.
Product exploration explored 100000 steps with 50000 reset in 2481 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 144 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-05 finished in 12845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 250 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-11 03:56:09] [INFO ] Invariant cache hit.
[2023-03-11 03:56:10] [INFO ] Implicit Places using invariants in 964 ms returned []
[2023-03-11 03:56:10] [INFO ] Invariant cache hit.
[2023-03-11 03:56:13] [INFO ] Implicit Places using invariants and state equation in 2269 ms returned []
Implicit Place search using SMT with State Equation took 3250 ms to find 0 implicit places.
[2023-03-11 03:56:13] [INFO ] Invariant cache hit.
[2023-03-11 03:56:17] [INFO ] Dead Transitions using invariants and state equation in 4817 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8333 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT 2 s1932)], 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 25000 reset in 1887 ms.
Product exploration explored 100000 steps with 25000 reset in 1727 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 75670 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75670 steps, saw 48552 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:56:25] [INFO ] Invariant cache hit.
[2023-03-11 03:56:26] [INFO ] [Real]Absence check using 40 positive place invariants in 58 ms returned sat
[2023-03-11 03:56:26] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 67 ms returned sat
[2023-03-11 03:56:31] [INFO ] After 5533ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:56:31] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:56:32] [INFO ] After 1020ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:56:32] [INFO ] After 7530ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:56:33] [INFO ] [Nat]Absence check using 40 positive place invariants in 42 ms returned sat
[2023-03-11 03:56:33] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 49 ms returned sat
[2023-03-11 03:56:38] [INFO ] After 4322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:56:47] [INFO ] After 9243ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-11 03:56:47] [INFO ] After 14563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5160 place count 1844 transition count 6519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5161 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1641 times.
Drop transitions removed 1641 transitions
Iterating global reduction 3 with 1641 rules applied. Total rules applied 6802 place count 1843 transition count 6519
Applied a total of 6802 rules in 1848 ms. Remains 1843 /3683 variables (removed 1840) and now considering 6519/9840 (removed 3321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1848 ms. Remains : 1843/3683 places, 6519/9840 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 126201 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126201 steps, saw 34100 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2023-03-11 03:56:52] [INFO ] Computed 42 place invariants in 297 ms
[2023-03-11 03:56:53] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2023-03-11 03:56:53] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2023-03-11 03:56:54] [INFO ] After 1627ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:56:54] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2023-03-11 03:56:55] [INFO ] After 748ms SMT Verify possible using 6397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:56:55] [INFO ] After 2803ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:56:55] [INFO ] [Nat]Absence check using 40 positive place invariants in 22 ms returned sat
[2023-03-11 03:56:55] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2023-03-11 03:56:57] [INFO ] After 1591ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:56:58] [INFO ] After 1212ms SMT Verify possible using 6397 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:56:59] [INFO ] After 1564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 228 ms.
[2023-03-11 03:56:59] [INFO ] After 3773ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 220 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 298 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2023-03-11 03:56:59] [INFO ] Invariant cache hit.
[2023-03-11 03:57:01] [INFO ] Implicit Places using invariants in 2052 ms returned []
[2023-03-11 03:57:01] [INFO ] Invariant cache hit.
[2023-03-11 03:57:02] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2023-03-11 03:57:14] [INFO ] Implicit Places using invariants and state equation in 12214 ms returned []
Implicit Place search using SMT with State Equation took 14277 ms to find 0 implicit places.
[2023-03-11 03:57:14] [INFO ] Redundant transitions in 427 ms returned []
[2023-03-11 03:57:14] [INFO ] Invariant cache hit.
[2023-03-11 03:57:17] [INFO ] Dead Transitions using invariants and state equation in 2653 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17724 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6276 edges and 1843 vertex of which 1679 / 1843 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1677 places
Drop transitions removed 4718 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6350 transitions.
Graph (complete) has 411 edges and 166 vertex of which 45 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 45 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 44 transition count 48
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 6 transition count 10
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 place count 6 transition count 10
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 6 transition count 7
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 166 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 4 transition count 5
Applied a total of 167 rules in 14 ms. Remains 4 /1843 variables (removed 1839) and now considering 5/6519 (removed 6514) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2023-03-11 03:57:17] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 03:57:17] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:57:17] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:57:17] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 03:57:17] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 312 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-11 03:57:18] [INFO ] Computed 42 place invariants in 495 ms
[2023-03-11 03:57:19] [INFO ] Implicit Places using invariants in 1336 ms returned []
[2023-03-11 03:57:19] [INFO ] Invariant cache hit.
[2023-03-11 03:57:22] [INFO ] Implicit Places using invariants and state equation in 3199 ms returned []
Implicit Place search using SMT with State Equation took 4554 ms to find 0 implicit places.
[2023-03-11 03:57:22] [INFO ] Invariant cache hit.
[2023-03-11 03:57:27] [INFO ] Dead Transitions using invariants and state equation in 4748 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9630 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 80475 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80475 steps, saw 49535 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:57:31] [INFO ] Invariant cache hit.
[2023-03-11 03:57:31] [INFO ] [Real]Absence check using 40 positive place invariants in 51 ms returned sat
[2023-03-11 03:57:31] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 44 ms returned sat
[2023-03-11 03:57:35] [INFO ] After 3970ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:57:35] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:57:36] [INFO ] After 854ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:57:36] [INFO ] After 5349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:57:37] [INFO ] [Nat]Absence check using 40 positive place invariants in 55 ms returned sat
[2023-03-11 03:57:37] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 66 ms returned sat
[2023-03-11 03:57:44] [INFO ] After 6788ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:57:53] [INFO ] After 9271ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-11 03:57:53] [INFO ] After 17158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 4 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5160 place count 1844 transition count 6519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5161 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1641 times.
Drop transitions removed 1641 transitions
Iterating global reduction 3 with 1641 rules applied. Total rules applied 6802 place count 1843 transition count 6519
Applied a total of 6802 rules in 1598 ms. Remains 1843 /3683 variables (removed 1840) and now considering 6519/9840 (removed 3321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1598 ms. Remains : 1843/3683 places, 6519/9840 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 130642 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 130642 steps, saw 34769 distinct states, run finished after 3014 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2023-03-11 03:57:58] [INFO ] Computed 42 place invariants in 244 ms
[2023-03-11 03:57:59] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2023-03-11 03:57:59] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-11 03:58:00] [INFO ] After 1524ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:58:00] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2023-03-11 03:58:01] [INFO ] After 665ms SMT Verify possible using 6397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:58:01] [INFO ] After 2659ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:58:01] [INFO ] [Nat]Absence check using 40 positive place invariants in 16 ms returned sat
[2023-03-11 03:58:01] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 16 ms returned sat
[2023-03-11 03:58:03] [INFO ] After 1382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:58:04] [INFO ] After 1646ms SMT Verify possible using 6397 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:58:05] [INFO ] After 2034ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 244 ms.
[2023-03-11 03:58:05] [INFO ] After 3971ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 287 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 296 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2023-03-11 03:58:06] [INFO ] Invariant cache hit.
[2023-03-11 03:58:09] [INFO ] Implicit Places using invariants in 3288 ms returned []
[2023-03-11 03:58:09] [INFO ] Invariant cache hit.
[2023-03-11 03:58:10] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2023-03-11 03:58:22] [INFO ] Implicit Places using invariants and state equation in 13559 ms returned []
Implicit Place search using SMT with State Equation took 16869 ms to find 0 implicit places.
[2023-03-11 03:58:23] [INFO ] Redundant transitions in 544 ms returned []
[2023-03-11 03:58:23] [INFO ] Invariant cache hit.
[2023-03-11 03:58:26] [INFO ] Dead Transitions using invariants and state equation in 3397 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21136 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6276 edges and 1843 vertex of which 1679 / 1843 are part of one of the 2 SCC in 2 ms
Free SCC test removed 1677 places
Drop transitions removed 4718 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6350 transitions.
Graph (complete) has 411 edges and 166 vertex of which 45 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 45 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 44 transition count 48
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 6 transition count 10
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 place count 6 transition count 10
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 6 transition count 7
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 166 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 4 transition count 5
Applied a total of 167 rules in 13 ms. Remains 4 /1843 variables (removed 1839) and now considering 5/6519 (removed 6514) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2023-03-11 03:58:26] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 03:58:26] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:58:26] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:58:26] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 03:58:26] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1765 ms.
Product exploration explored 100000 steps with 25000 reset in 1766 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 3683 transition count 9840
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 200 place count 3683 transition count 9840
Deduced a syphon composed of 240 places in 4 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 240 place count 3683 transition count 9840
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 320 place count 3603 transition count 9760
Deduced a syphon composed of 160 places in 2 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 400 place count 3603 transition count 9760
Performed 1599 Post agglomeration using F-continuation condition.Transition count delta: -3038
Deduced a syphon composed of 1759 places in 3 ms
Iterating global reduction 1 with 1599 rules applied. Total rules applied 1999 place count 3603 transition count 12798
Discarding 160 places :
Symmetric choice reduction at 1 with 160 rule applications. Total rules 2159 place count 3443 transition count 12638
Deduced a syphon composed of 1599 places in 2 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 2319 place count 3443 transition count 12638
Deduced a syphon composed of 1599 places in 1 ms
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 1 with 1481 rules applied. Total rules applied 3800 place count 3443 transition count 11157
Deduced a syphon composed of 1599 places in 2 ms
Applied a total of 3800 rules in 2315 ms. Remains 3443 /3683 variables (removed 240) and now considering 11157/9840 (removed -1317) transitions.
// Phase 1: matrix 11157 rows 3443 cols
[2023-03-11 03:58:34] [INFO ] Computed 42 place invariants in 518 ms
[2023-03-11 03:58:39] [INFO ] Dead Transitions using invariants and state equation in 5229 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3443/3683 places, 11157/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7555 ms. Remains : 3443/3683 places, 11157/9840 transitions.
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 280 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-11 03:58:40] [INFO ] Computed 42 place invariants in 439 ms
[2023-03-11 03:58:42] [INFO ] Implicit Places using invariants in 2357 ms returned []
[2023-03-11 03:58:42] [INFO ] Invariant cache hit.
[2023-03-11 03:58:46] [INFO ] Implicit Places using invariants and state equation in 4708 ms returned []
Implicit Place search using SMT with State Equation took 7096 ms to find 0 implicit places.
[2023-03-11 03:58:46] [INFO ] Invariant cache hit.
[2023-03-11 03:58:51] [INFO ] Dead Transitions using invariants and state equation in 4822 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12203 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-06 finished in 162310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1))))'
Support contains 6 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 233 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-11 03:58:52] [INFO ] Invariant cache hit.
[2023-03-11 03:58:54] [INFO ] Implicit Places using invariants in 2657 ms returned []
[2023-03-11 03:58:54] [INFO ] Invariant cache hit.
[2023-03-11 03:58:58] [INFO ] Implicit Places using invariants and state equation in 3324 ms returned []
Implicit Place search using SMT with State Equation took 5998 ms to find 0 implicit places.
[2023-03-11 03:58:58] [INFO ] Invariant cache hit.
[2023-03-11 03:59:03] [INFO ] Dead Transitions using invariants and state equation in 5294 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11528 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LEQ s1204 s158) (LEQ s243 s993)), p1:(OR (GT s3182 s3279) (GT s243 s993))], 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 33333 reset in 2309 ms.
Product exploration explored 100000 steps with 33333 reset in 1999 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 5 factoid took 167 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-040-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-07 finished in 16379 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(G((p0||X((p1 U p2))))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 385 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-11 03:59:08] [INFO ] Invariant cache hit.
[2023-03-11 03:59:10] [INFO ] Implicit Places using invariants in 2081 ms returned []
[2023-03-11 03:59:10] [INFO ] Invariant cache hit.
[2023-03-11 03:59:13] [INFO ] Implicit Places using invariants and state equation in 2275 ms returned []
Implicit Place search using SMT with State Equation took 4359 ms to find 0 implicit places.
[2023-03-11 03:59:13] [INFO ] Invariant cache hit.
[2023-03-11 03:59:21] [INFO ] Dead Transitions using invariants and state equation in 8404 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13157 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s2413), p2:(AND (LEQ 3 s2413) (LEQ 2 s2851) (LEQ s1353 s2706)), p1:(AND (LEQ 2 s2851) (LEQ s1353 s2706))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 871 steps with 0 reset in 15 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-08 finished in 13350 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 (G(!p0)||(X(F(p2))&&p1))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 328 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-11 03:59:21] [INFO ] Invariant cache hit.
[2023-03-11 03:59:22] [INFO ] Implicit Places using invariants in 886 ms returned []
[2023-03-11 03:59:22] [INFO ] Invariant cache hit.
[2023-03-11 03:59:27] [INFO ] Implicit Places using invariants and state equation in 4522 ms returned []
Implicit Place search using SMT with State Equation took 5429 ms to find 0 implicit places.
[2023-03-11 03:59:27] [INFO ] Invariant cache hit.
[2023-03-11 03:59:32] [INFO ] Dead Transitions using invariants and state equation in 5344 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11105 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p2) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(LEQ s1276 s1610), p1:(AND (GT s1627 s2526) (NOT (AND (LEQ s1627 s2526) (LEQ 1 s1087)))), p0:(AND (LEQ s1627 s2526) (LEQ 1 s1087))], 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]]
Entered a terminal (fully accepting) state of product in 5809 steps with 7 reset in 82 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-09 finished in 11385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 559 place count 3404 transition count 9560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1481 Post agglomeration using F-continuation condition.Transition count delta: 1481
Deduced a syphon composed of 1481 places in 4 ms
Reduce places removed 1481 places and 0 transitions.
Iterating global reduction 3 with 2962 rules applied. Total rules applied 3522 place count 1922 transition count 8079
Drop transitions removed 1405 transitions
Redundant transition composition rules discarded 1405 transitions
Iterating global reduction 3 with 1405 rules applied. Total rules applied 4927 place count 1922 transition count 6674
Partial Post-agglomeration rule applied 154 times.
Drop transitions removed 154 transitions
Iterating global reduction 3 with 154 rules applied. Total rules applied 5081 place count 1922 transition count 6674
Discarding 76 places :
Symmetric choice reduction at 3 with 76 rule applications. Total rules 5157 place count 1846 transition count 6598
Iterating global reduction 3 with 76 rules applied. Total rules applied 5233 place count 1846 transition count 6598
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 5271 place count 1846 transition count 6560
Applied a total of 5271 rules in 1874 ms. Remains 1846 /3683 variables (removed 1837) and now considering 6560/9840 (removed 3280) transitions.
// Phase 1: matrix 6560 rows 1846 cols
[2023-03-11 03:59:35] [INFO ] Computed 42 place invariants in 194 ms
[2023-03-11 03:59:36] [INFO ] Implicit Places using invariants in 1604 ms returned []
[2023-03-11 03:59:36] [INFO ] Invariant cache hit.
[2023-03-11 03:59:37] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2023-03-11 03:59:42] [INFO ] Implicit Places using invariants and state equation in 6034 ms returned []
Implicit Place search using SMT with State Equation took 7646 ms to find 0 implicit places.
[2023-03-11 03:59:42] [INFO ] Redundant transitions in 440 ms returned []
[2023-03-11 03:59:43] [INFO ] Invariant cache hit.
[2023-03-11 03:59:47] [INFO ] Dead Transitions using invariants and state equation in 4423 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1846/3683 places, 6560/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14422 ms. Remains : 1846/3683 places, 6560/9840 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT s927 s230) (GT 2 s1806))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 486 reset in 1280 ms.
Product exploration explored 100000 steps with 488 reset in 1217 ms.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 110972 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110972 steps, saw 30646 distinct states, run finished after 3007 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:59:53] [INFO ] Invariant cache hit.
[2023-03-11 03:59:53] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-11 03:59:53] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 24 ms returned sat
[2023-03-11 03:59:55] [INFO ] After 2125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:59:55] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-11 03:59:55] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 25 ms returned sat
[2023-03-11 03:59:57] [INFO ] After 1718ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:59:57] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2023-03-11 04:00:00] [INFO ] After 2561ms SMT Verify possible using 4793 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 04:00:00] [INFO ] After 3048ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 347 ms.
[2023-03-11 04:00:01] [INFO ] After 5485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1846 transition count 6559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1845 transition count 6559
Partial Free-agglomeration rule applied 1601 times.
Drop transitions removed 1601 transitions
Iterating global reduction 1 with 1601 rules applied. Total rules applied 1603 place count 1845 transition count 6559
Applied a total of 1603 rules in 698 ms. Remains 1845 /1846 variables (removed 1) and now considering 6559/6560 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 700 ms. Remains : 1845/1846 places, 6559/6560 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 126248 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126248 steps, saw 33979 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6559 rows 1845 cols
[2023-03-11 04:00:05] [INFO ] Computed 42 place invariants in 242 ms
[2023-03-11 04:00:05] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-11 04:00:05] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-11 04:00:07] [INFO ] After 2147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:00:07] [INFO ] [Nat]Absence check using 40 positive place invariants in 16 ms returned sat
[2023-03-11 04:00:07] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 16 ms returned sat
[2023-03-11 04:00:09] [INFO ] After 2019ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:00:09] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2023-03-11 04:00:12] [INFO ] After 3010ms SMT Verify possible using 6393 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 04:00:13] [INFO ] After 3530ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 380 ms.
[2023-03-11 04:00:13] [INFO ] After 6315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 233 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 228 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
[2023-03-11 04:00:14] [INFO ] Invariant cache hit.
[2023-03-11 04:00:16] [INFO ] Implicit Places using invariants in 2063 ms returned []
[2023-03-11 04:00:16] [INFO ] Invariant cache hit.
[2023-03-11 04:00:17] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2023-03-11 04:00:26] [INFO ] Implicit Places using invariants and state equation in 10498 ms returned []
Implicit Place search using SMT with State Equation took 12570 ms to find 0 implicit places.
[2023-03-11 04:00:27] [INFO ] Redundant transitions in 427 ms returned []
[2023-03-11 04:00:27] [INFO ] Invariant cache hit.
[2023-03-11 04:00:30] [INFO ] Dead Transitions using invariants and state equation in 2884 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16128 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Graph (trivial) has 6272 edges and 1845 vertex of which 1637 / 1845 are part of one of the 2 SCC in 2 ms
Free SCC test removed 1635 places
Drop transitions removed 4561 transitions
Ensure Unique test removed 1625 transitions
Reduce isomorphic transitions removed 6186 transitions.
Graph (complete) has 616 edges and 210 vertex of which 89 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.1 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 89 transition count 215
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 196 place count 14 transition count 66
Iterating global reduction 1 with 75 rules applied. Total rules applied 271 place count 14 transition count 66
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 308 place count 14 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 312 place count 12 transition count 28
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 317 place count 12 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 318 place count 11 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 319 place count 11 transition count 22
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 2 with 2 rules applied. Total rules applied 321 place count 10 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 322 place count 10 transition count 20
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 323 place count 10 transition count 19
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 325 place count 9 transition count 18
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 326 place count 9 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 327 place count 8 transition count 17
Applied a total of 327 rules in 13 ms. Remains 8 /1845 variables (removed 1837) and now considering 17/6559 (removed 6542) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 17 rows 8 cols
[2023-03-11 04:00:30] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 04:00:30] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:00:30] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:00:30] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-11 04:00:30] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Applied a total of 0 rules in 181 ms. Remains 1846 /1846 variables (removed 0) and now considering 6560/6560 (removed 0) transitions.
// Phase 1: matrix 6560 rows 1846 cols
[2023-03-11 04:00:30] [INFO ] Computed 42 place invariants in 120 ms
[2023-03-11 04:00:32] [INFO ] Implicit Places using invariants in 1833 ms returned []
[2023-03-11 04:00:32] [INFO ] Invariant cache hit.
[2023-03-11 04:00:33] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2023-03-11 04:00:37] [INFO ] Implicit Places using invariants and state equation in 4747 ms returned []
Implicit Place search using SMT with State Equation took 6599 ms to find 0 implicit places.
[2023-03-11 04:00:37] [INFO ] Redundant transitions in 434 ms returned []
[2023-03-11 04:00:37] [INFO ] Invariant cache hit.
[2023-03-11 04:00:41] [INFO ] Dead Transitions using invariants and state equation in 3862 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11089 ms. Remains : 1846/1846 places, 6560/6560 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 110507 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110507 steps, saw 30557 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 04:00:45] [INFO ] Invariant cache hit.
[2023-03-11 04:00:45] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2023-03-11 04:00:45] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-11 04:00:48] [INFO ] After 3101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:00:48] [INFO ] [Nat]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-11 04:00:48] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 33 ms returned sat
[2023-03-11 04:00:51] [INFO ] After 2350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:00:51] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2023-03-11 04:00:54] [INFO ] After 2959ms SMT Verify possible using 4793 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 04:00:54] [INFO ] After 3376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 340 ms.
[2023-03-11 04:00:54] [INFO ] After 6688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1846 transition count 6559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1845 transition count 6559
Partial Free-agglomeration rule applied 1601 times.
Drop transitions removed 1601 transitions
Iterating global reduction 1 with 1601 rules applied. Total rules applied 1603 place count 1845 transition count 6559
Applied a total of 1603 rules in 726 ms. Remains 1845 /1846 variables (removed 1) and now considering 6559/6560 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 726 ms. Remains : 1845/1846 places, 6559/6560 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 126188 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126188 steps, saw 33974 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6559 rows 1845 cols
[2023-03-11 04:00:58] [INFO ] Computed 42 place invariants in 204 ms
[2023-03-11 04:00:59] [INFO ] [Real]Absence check using 40 positive place invariants in 31 ms returned sat
[2023-03-11 04:00:59] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 60 ms returned sat
[2023-03-11 04:01:02] [INFO ] After 3309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:01:02] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-11 04:01:02] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2023-03-11 04:01:04] [INFO ] After 1959ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:01:04] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2023-03-11 04:01:08] [INFO ] After 3642ms SMT Verify possible using 6393 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 04:01:08] [INFO ] After 4173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 404 ms.
[2023-03-11 04:01:09] [INFO ] After 6951ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 432 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 432 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 402 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
[2023-03-11 04:01:10] [INFO ] Invariant cache hit.
[2023-03-11 04:01:12] [INFO ] Implicit Places using invariants in 2601 ms returned []
[2023-03-11 04:01:12] [INFO ] Invariant cache hit.
[2023-03-11 04:01:14] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2023-03-11 04:01:24] [INFO ] Implicit Places using invariants and state equation in 12206 ms returned []
Implicit Place search using SMT with State Equation took 14813 ms to find 0 implicit places.
[2023-03-11 04:01:25] [INFO ] Redundant transitions in 461 ms returned []
[2023-03-11 04:01:25] [INFO ] Invariant cache hit.
[2023-03-11 04:01:29] [INFO ] Dead Transitions using invariants and state equation in 3853 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19560 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Graph (trivial) has 6272 edges and 1845 vertex of which 1637 / 1845 are part of one of the 2 SCC in 2 ms
Free SCC test removed 1635 places
Drop transitions removed 4561 transitions
Ensure Unique test removed 1625 transitions
Reduce isomorphic transitions removed 6186 transitions.
Graph (complete) has 616 edges and 210 vertex of which 89 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 89 transition count 215
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 196 place count 14 transition count 66
Iterating global reduction 1 with 75 rules applied. Total rules applied 271 place count 14 transition count 66
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 308 place count 14 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 312 place count 12 transition count 28
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 317 place count 12 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 318 place count 11 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 319 place count 11 transition count 22
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 2 with 2 rules applied. Total rules applied 321 place count 10 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 322 place count 10 transition count 20
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 323 place count 10 transition count 19
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 325 place count 9 transition count 18
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 326 place count 9 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 327 place count 8 transition count 17
Applied a total of 327 rules in 13 ms. Remains 8 /1845 variables (removed 1837) and now considering 17/6559 (removed 6542) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 17 rows 8 cols
[2023-03-11 04:01:29] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 04:01:29] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:01:29] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:01:29] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 04:01:29] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 487 reset in 1265 ms.
Product exploration explored 100000 steps with 486 reset in 1037 ms.
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Applied a total of 0 rules in 173 ms. Remains 1846 /1846 variables (removed 0) and now considering 6560/6560 (removed 0) transitions.
// Phase 1: matrix 6560 rows 1846 cols
[2023-03-11 04:01:32] [INFO ] Computed 42 place invariants in 211 ms
[2023-03-11 04:01:33] [INFO ] Implicit Places using invariants in 1466 ms returned []
[2023-03-11 04:01:33] [INFO ] Invariant cache hit.
[2023-03-11 04:01:34] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2023-03-11 04:01:38] [INFO ] Implicit Places using invariants and state equation in 5259 ms returned []
Implicit Place search using SMT with State Equation took 6738 ms to find 0 implicit places.
[2023-03-11 04:01:39] [INFO ] Redundant transitions in 430 ms returned []
[2023-03-11 04:01:39] [INFO ] Invariant cache hit.
[2023-03-11 04:01:44] [INFO ] Dead Transitions using invariants and state equation in 5049 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12428 ms. Remains : 1846/1846 places, 6560/6560 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-10 finished in 131615 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(G(p0)))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 1248 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2023-03-11 04:01:46] [INFO ] Computed 42 place invariants in 126 ms
[2023-03-11 04:01:47] [INFO ] Implicit Places using invariants in 1360 ms returned []
[2023-03-11 04:01:47] [INFO ] Invariant cache hit.
[2023-03-11 04:01:48] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-11 04:01:51] [INFO ] Implicit Places using invariants and state equation in 3825 ms returned []
Implicit Place search using SMT with State Equation took 5240 ms to find 0 implicit places.
[2023-03-11 04:01:51] [INFO ] Redundant transitions in 682 ms returned []
[2023-03-11 04:01:51] [INFO ] Invariant cache hit.
[2023-03-11 04:01:57] [INFO ] Dead Transitions using invariants and state equation in 5116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12345 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s902 s1169)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 493 reset in 1041 ms.
Product exploration explored 100000 steps with 490 reset in 1161 ms.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 200 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 119183 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119183 steps, saw 31986 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 04:02:02] [INFO ] Invariant cache hit.
[2023-03-11 04:02:03] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:02:03] [INFO ] [Nat]Absence check using 40 positive place invariants in 37 ms returned sat
[2023-03-11 04:02:03] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 45 ms returned sat
[2023-03-11 04:02:05] [INFO ] After 2064ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:02:05] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-11 04:02:06] [INFO ] After 1147ms SMT Verify possible using 4757 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 04:02:07] [INFO ] After 1458ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 213 ms.
[2023-03-11 04:02:07] [INFO ] After 4205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 13 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 213 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0)]
Support contains 2 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 230 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2023-03-11 04:02:07] [INFO ] Invariant cache hit.
[2023-03-11 04:02:09] [INFO ] Implicit Places using invariants in 1270 ms returned []
[2023-03-11 04:02:09] [INFO ] Invariant cache hit.
[2023-03-11 04:02:10] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-11 04:02:13] [INFO ] Implicit Places using invariants and state equation in 4469 ms returned []
Implicit Place search using SMT with State Equation took 5769 ms to find 0 implicit places.
[2023-03-11 04:02:14] [INFO ] Redundant transitions in 591 ms returned []
[2023-03-11 04:02:14] [INFO ] Invariant cache hit.
[2023-03-11 04:02:18] [INFO ] Dead Transitions using invariants and state equation in 4149 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10775 ms. Remains : 1844/1844 places, 6520/6520 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 4232 steps, including 20 resets, run visited all 1 properties in 103 ms. (steps per millisecond=41 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 492 reset in 1022 ms.
Stack based approach found an accepted trace after 6409 steps with 30 reset with depth 198 and stack size 198 in 86 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-11 finished in 35546 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((G(F(p0))||(p1&&F(p0))||(p2&&F(p0)))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1558 Post agglomeration using F-continuation condition.Transition count delta: 1558
Deduced a syphon composed of 1558 places in 3 ms
Reduce places removed 1558 places and 0 transitions.
Iterating global reduction 2 with 3116 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions removed 1480 transitions
Redundant transition composition rules discarded 1480 transitions
Iterating global reduction 2 with 1480 rules applied. Total rules applied 5156 place count 1845 transition count 6522
Applied a total of 5156 rules in 1205 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6522/9840 (removed 3318) transitions.
// Phase 1: matrix 6522 rows 1845 cols
[2023-03-11 04:02:21] [INFO ] Computed 42 place invariants in 199 ms
[2023-03-11 04:02:23] [INFO ] Implicit Places using invariants in 1813 ms returned []
[2023-03-11 04:02:23] [INFO ] Invariant cache hit.
[2023-03-11 04:02:24] [INFO ] State equation strengthened by 4756 read => feed constraints.
[2023-03-11 04:02:29] [INFO ] Implicit Places using invariants and state equation in 5913 ms returned []
Implicit Place search using SMT with State Equation took 7751 ms to find 0 implicit places.
[2023-03-11 04:02:29] [INFO ] Redundant transitions in 751 ms returned []
[2023-03-11 04:02:29] [INFO ] Invariant cache hit.
[2023-03-11 04:02:33] [INFO ] Dead Transitions using invariants and state equation in 3080 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6522/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12828 ms. Remains : 1845/3683 places, 6522/9840 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 2 s1085), p2:(LEQ s956 s1321), p0:(LEQ 3 s1511)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 206 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-12 finished in 13000 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(G(p0)))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 1173 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2023-03-11 04:02:34] [INFO ] Computed 42 place invariants in 192 ms
[2023-03-11 04:02:35] [INFO ] Implicit Places using invariants in 1230 ms returned []
[2023-03-11 04:02:35] [INFO ] Invariant cache hit.
[2023-03-11 04:02:36] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-11 04:02:39] [INFO ] Implicit Places using invariants and state equation in 3747 ms returned []
Implicit Place search using SMT with State Equation took 4979 ms to find 0 implicit places.
[2023-03-11 04:02:40] [INFO ] Redundant transitions in 806 ms returned []
[2023-03-11 04:02:40] [INFO ] Invariant cache hit.
[2023-03-11 04:02:44] [INFO ] Dead Transitions using invariants and state equation in 4203 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11179 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1488 s1790)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 489 reset in 1040 ms.
Product exploration explored 100000 steps with 491 reset in 1087 ms.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 5019 steps, including 24 resets, run visited all 1 properties in 145 ms. (steps per millisecond=34 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 230 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 2 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 239 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2023-03-11 04:02:47] [INFO ] Invariant cache hit.
[2023-03-11 04:02:49] [INFO ] Implicit Places using invariants in 1685 ms returned []
[2023-03-11 04:02:49] [INFO ] Invariant cache hit.
[2023-03-11 04:02:50] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-11 04:02:53] [INFO ] Implicit Places using invariants and state equation in 3868 ms returned []
Implicit Place search using SMT with State Equation took 5568 ms to find 0 implicit places.
[2023-03-11 04:02:53] [INFO ] Redundant transitions in 428 ms returned []
[2023-03-11 04:02:53] [INFO ] Invariant cache hit.
[2023-03-11 04:02:56] [INFO ] Dead Transitions using invariants and state equation in 3339 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9610 ms. Remains : 1844/1844 places, 6520/6520 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 1679 steps, including 8 resets, run visited all 1 properties in 43 ms. (steps per millisecond=39 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 489 reset in 1024 ms.
Product exploration explored 100000 steps with 488 reset in 992 ms.
Support contains 2 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 213 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2023-03-11 04:02:59] [INFO ] Invariant cache hit.
[2023-03-11 04:03:00] [INFO ] Implicit Places using invariants in 1200 ms returned []
[2023-03-11 04:03:00] [INFO ] Invariant cache hit.
[2023-03-11 04:03:01] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-11 04:03:04] [INFO ] Implicit Places using invariants and state equation in 3805 ms returned []
Implicit Place search using SMT with State Equation took 5007 ms to find 0 implicit places.
[2023-03-11 04:03:05] [INFO ] Redundant transitions in 566 ms returned []
[2023-03-11 04:03:05] [INFO ] Invariant cache hit.
[2023-03-11 04:03:08] [INFO ] Dead Transitions using invariants and state equation in 2982 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8785 ms. Remains : 1844/1844 places, 6520/6520 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-13 finished in 35232 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)) U G(p1)))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1560 Post agglomeration using F-continuation condition.Transition count delta: 1560
Deduced a syphon composed of 1560 places in 3 ms
Reduce places removed 1560 places and 0 transitions.
Iterating global reduction 3 with 3120 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions removed 1482 transitions
Redundant transition composition rules discarded 1482 transitions
Iterating global reduction 3 with 1482 rules applied. Total rules applied 5158 place count 1845 transition count 6520
Applied a total of 5158 rules in 1498 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2023-03-11 04:03:10] [INFO ] Computed 42 place invariants in 201 ms
[2023-03-11 04:03:11] [INFO ] Implicit Places using invariants in 1453 ms returned []
[2023-03-11 04:03:11] [INFO ] Invariant cache hit.
[2023-03-11 04:03:12] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2023-03-11 04:03:15] [INFO ] Implicit Places using invariants and state equation in 3595 ms returned []
Implicit Place search using SMT with State Equation took 5078 ms to find 0 implicit places.
[2023-03-11 04:03:15] [INFO ] Redundant transitions in 669 ms returned []
[2023-03-11 04:03:15] [INFO ] Invariant cache hit.
[2023-03-11 04:03:19] [INFO ] Dead Transitions using invariants and state equation in 3761 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11043 ms. Remains : 1845/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s53 s803), p0:(OR (GT 1 s396) (GT 2 s833))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 496 reset in 928 ms.
Product exploration explored 100000 steps with 498 reset in 1022 ms.
Computed a total of 125 stabilizing places and 202 stable transitions
Computed a total of 125 stabilizing places and 202 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 231 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 2) 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 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 04:03:22] [INFO ] Invariant cache hit.
[2023-03-11 04:03:22] [INFO ] [Real]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-11 04:03:22] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-11 04:03:24] [INFO ] After 1599ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 04:03:24] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2023-03-11 04:03:25] [INFO ] After 1378ms SMT Verify possible using 4758 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:03:25] [INFO ] After 3349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:03:25] [INFO ] [Nat]Absence check using 40 positive place invariants in 20 ms returned sat
[2023-03-11 04:03:25] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2023-03-11 04:03:27] [INFO ] After 1637ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:03:28] [INFO ] After 893ms SMT Verify possible using 4758 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 04:03:28] [INFO ] After 1183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 254 ms.
[2023-03-11 04:03:29] [INFO ] After 3413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6518
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6518
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1843 transition count 6517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1842 transition count 6517
Partial Free-agglomeration rule applied 1639 times.
Drop transitions removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 1645 place count 1842 transition count 6517
Applied a total of 1645 rules in 757 ms. Remains 1842 /1845 variables (removed 3) and now considering 6517/6520 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 770 ms. Remains : 1842/1845 places, 6517/6520 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 131668 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131668 steps, saw 34911 distinct states, run finished after 3014 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6517 rows 1842 cols
[2023-03-11 04:03:33] [INFO ] Computed 42 place invariants in 245 ms
[2023-03-11 04:03:33] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2023-03-11 04:03:33] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-11 04:03:35] [INFO ] After 1497ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 04:03:35] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2023-03-11 04:03:36] [INFO ] After 1056ms SMT Verify possible using 6396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:03:36] [INFO ] After 3008ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:03:36] [INFO ] [Nat]Absence check using 40 positive place invariants in 35 ms returned sat
[2023-03-11 04:03:36] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 49 ms returned sat
[2023-03-11 04:03:39] [INFO ] After 3023ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:03:41] [INFO ] After 1170ms SMT Verify possible using 6396 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 04:03:41] [INFO ] After 1539ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 278 ms.
[2023-03-11 04:03:41] [INFO ] After 5487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 1842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 266 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 242 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
[2023-03-11 04:03:42] [INFO ] Invariant cache hit.
[2023-03-11 04:03:44] [INFO ] Implicit Places using invariants in 2022 ms returned []
[2023-03-11 04:03:44] [INFO ] Invariant cache hit.
[2023-03-11 04:03:45] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2023-03-11 04:03:55] [INFO ] Implicit Places using invariants and state equation in 11458 ms returned []
Implicit Place search using SMT with State Equation took 13509 ms to find 0 implicit places.
[2023-03-11 04:03:56] [INFO ] Redundant transitions in 413 ms returned []
[2023-03-11 04:03:56] [INFO ] Invariant cache hit.
[2023-03-11 04:03:59] [INFO ] Dead Transitions using invariants and state equation in 2901 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17079 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Graph (trivial) has 6270 edges and 1842 vertex of which 1677 / 1842 are part of one of the 2 SCC in 2 ms
Free SCC test removed 1675 places
Drop transitions removed 4713 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6345 transitions.
Graph (complete) has 414 edges and 167 vertex of which 46 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 46 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 45 transition count 51
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 7 transition count 13
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 7 transition count 10
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 166 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 5 transition count 8
Applied a total of 167 rules in 16 ms. Remains 5 /1842 variables (removed 1837) and now considering 8/6517 (removed 6509) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-11 04:03:59] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 04:03:59] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:03:59] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:03:59] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-11 04:03:59] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 318 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p0)]
Support contains 4 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Applied a total of 0 rules in 273 ms. Remains 1845 /1845 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2023-03-11 04:04:00] [INFO ] Computed 42 place invariants in 193 ms
[2023-03-11 04:04:01] [INFO ] Implicit Places using invariants in 1760 ms returned []
[2023-03-11 04:04:01] [INFO ] Invariant cache hit.
[2023-03-11 04:04:02] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2023-03-11 04:04:06] [INFO ] Implicit Places using invariants and state equation in 4662 ms returned []
Implicit Place search using SMT with State Equation took 6429 ms to find 0 implicit places.
[2023-03-11 04:04:06] [INFO ] Redundant transitions in 556 ms returned []
[2023-03-11 04:04:06] [INFO ] Invariant cache hit.
[2023-03-11 04:04:09] [INFO ] Dead Transitions using invariants and state equation in 2985 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10258 ms. Remains : 1845/1845 places, 6520/6520 transitions.
Computed a total of 125 stabilizing places and 202 stable transitions
Computed a total of 125 stabilizing places and 202 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 04:04:10] [INFO ] Invariant cache hit.
[2023-03-11 04:04:10] [INFO ] [Real]Absence check using 40 positive place invariants in 22 ms returned sat
[2023-03-11 04:04:10] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 24 ms returned sat
[2023-03-11 04:04:12] [INFO ] After 1790ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 04:04:12] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2023-03-11 04:04:13] [INFO ] After 1174ms SMT Verify possible using 4758 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:04:13] [INFO ] After 3395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:04:14] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-11 04:04:14] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 41 ms returned sat
[2023-03-11 04:04:16] [INFO ] After 1869ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:04:17] [INFO ] After 1018ms SMT Verify possible using 4758 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 04:04:17] [INFO ] After 1333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 221 ms.
[2023-03-11 04:04:17] [INFO ] After 3815ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6518
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6518
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1843 transition count 6517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1842 transition count 6517
Partial Free-agglomeration rule applied 1639 times.
Drop transitions removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 1645 place count 1842 transition count 6517
Applied a total of 1645 rules in 801 ms. Remains 1842 /1845 variables (removed 3) and now considering 6517/6520 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 808 ms. Remains : 1842/1845 places, 6517/6520 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 115909 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115909 steps, saw 32589 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6517 rows 1842 cols
[2023-03-11 04:04:21] [INFO ] Computed 42 place invariants in 242 ms
[2023-03-11 04:04:22] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2023-03-11 04:04:22] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 24 ms returned sat
[2023-03-11 04:04:23] [INFO ] After 1588ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 04:04:23] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2023-03-11 04:04:25] [INFO ] After 1184ms SMT Verify possible using 6396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:04:25] [INFO ] After 3242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:04:25] [INFO ] [Nat]Absence check using 40 positive place invariants in 17 ms returned sat
[2023-03-11 04:04:25] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 17 ms returned sat
[2023-03-11 04:04:28] [INFO ] After 2594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:04:29] [INFO ] After 1364ms SMT Verify possible using 6396 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 04:04:29] [INFO ] After 1781ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 280 ms.
[2023-03-11 04:04:30] [INFO ] After 4992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 1842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 258 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 276 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
[2023-03-11 04:04:30] [INFO ] Invariant cache hit.
[2023-03-11 04:04:33] [INFO ] Implicit Places using invariants in 2334 ms returned []
[2023-03-11 04:04:33] [INFO ] Invariant cache hit.
[2023-03-11 04:04:34] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2023-03-11 04:04:45] [INFO ] Implicit Places using invariants and state equation in 12248 ms returned []
Implicit Place search using SMT with State Equation took 14584 ms to find 0 implicit places.
[2023-03-11 04:04:45] [INFO ] Redundant transitions in 443 ms returned []
[2023-03-11 04:04:45] [INFO ] Invariant cache hit.
[2023-03-11 04:04:50] [INFO ] Dead Transitions using invariants and state equation in 4861 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20201 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Graph (trivial) has 6270 edges and 1842 vertex of which 1677 / 1842 are part of one of the 2 SCC in 2 ms
Free SCC test removed 1675 places
Drop transitions removed 4713 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6345 transitions.
Graph (complete) has 414 edges and 167 vertex of which 46 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 46 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 45 transition count 51
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 7 transition count 13
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 7 transition count 10
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 166 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 5 transition count 8
Applied a total of 167 rules in 11 ms. Remains 5 /1842 variables (removed 1837) and now considering 8/6517 (removed 6509) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-11 04:04:50] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 04:04:50] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:04:50] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:04:50] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-11 04:04:50] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 505 reset in 991 ms.
Product exploration explored 100000 steps with 497 reset in 1012 ms.
Support contains 4 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Applied a total of 0 rules in 180 ms. Remains 1845 /1845 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2023-03-11 04:04:53] [INFO ] Computed 42 place invariants in 192 ms
[2023-03-11 04:04:55] [INFO ] Implicit Places using invariants in 1939 ms returned []
[2023-03-11 04:04:55] [INFO ] Invariant cache hit.
[2023-03-11 04:04:56] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2023-03-11 04:04:59] [INFO ] Implicit Places using invariants and state equation in 4584 ms returned []
Implicit Place search using SMT with State Equation took 6543 ms to find 0 implicit places.
[2023-03-11 04:05:00] [INFO ] Redundant transitions in 568 ms returned []
[2023-03-11 04:05:00] [INFO ] Invariant cache hit.
[2023-03-11 04:05:05] [INFO ] Dead Transitions using invariants and state equation in 4521 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11828 ms. Remains : 1845/1845 places, 6520/6520 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-15 finished in 116888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(G(p0))||F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : CANInsertWithFailure-PT-040-LTLCardinality-06
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 1115 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2023-03-11 04:05:07] [INFO ] Computed 42 place invariants in 199 ms
[2023-03-11 04:05:08] [INFO ] Implicit Places using invariants in 1951 ms returned []
[2023-03-11 04:05:08] [INFO ] Invariant cache hit.
[2023-03-11 04:05:09] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-11 04:05:12] [INFO ] Implicit Places using invariants and state equation in 3657 ms returned []
Implicit Place search using SMT with State Equation took 5630 ms to find 0 implicit places.
[2023-03-11 04:05:12] [INFO ] Invariant cache hit.
[2023-03-11 04:05:15] [INFO ] Dead Transitions using invariants and state equation in 2647 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9407 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT 2 s945)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1312 ms.
Product exploration explored 100000 steps with 25000 reset in 1270 ms.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 132645 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132645 steps, saw 33854 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 04:05:21] [INFO ] Invariant cache hit.
[2023-03-11 04:05:21] [INFO ] [Real]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-11 04:05:21] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 49 ms returned sat
[2023-03-11 04:05:23] [INFO ] After 1840ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 04:05:23] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-11 04:05:24] [INFO ] After 677ms SMT Verify possible using 4757 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:05:24] [INFO ] After 3004ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:05:24] [INFO ] [Nat]Absence check using 40 positive place invariants in 21 ms returned sat
[2023-03-11 04:05:24] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2023-03-11 04:05:27] [INFO ] After 2683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:05:28] [INFO ] After 1345ms SMT Verify possible using 4757 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 04:05:29] [INFO ] After 1658ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 197 ms.
[2023-03-11 04:05:29] [INFO ] After 4901ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1844 transition count 6519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1641 times.
Drop transitions removed 1641 transitions
Iterating global reduction 1 with 1641 rules applied. Total rules applied 1643 place count 1843 transition count 6519
Applied a total of 1643 rules in 540 ms. Remains 1843 /1844 variables (removed 1) and now considering 6519/6520 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 540 ms. Remains : 1843/1844 places, 6519/6520 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 132213 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132213 steps, saw 34984 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2023-03-11 04:05:33] [INFO ] Computed 42 place invariants in 256 ms
[2023-03-11 04:05:33] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-11 04:05:33] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2023-03-11 04:05:34] [INFO ] After 1503ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 04:05:35] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2023-03-11 04:05:35] [INFO ] After 740ms SMT Verify possible using 6397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:05:35] [INFO ] After 2649ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:05:36] [INFO ] [Nat]Absence check using 40 positive place invariants in 37 ms returned sat
[2023-03-11 04:05:36] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 48 ms returned sat
[2023-03-11 04:05:38] [INFO ] After 2365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:05:40] [INFO ] After 1314ms SMT Verify possible using 6397 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 04:05:40] [INFO ] After 1610ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 203 ms.
[2023-03-11 04:05:40] [INFO ] After 4841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 188 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 176 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2023-03-11 04:05:41] [INFO ] Invariant cache hit.
[2023-03-11 04:05:44] [INFO ] Implicit Places using invariants in 3033 ms returned []
[2023-03-11 04:05:44] [INFO ] Invariant cache hit.
[2023-03-11 04:05:44] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2023-03-11 04:05:56] [INFO ] Implicit Places using invariants and state equation in 12352 ms returned []
Implicit Place search using SMT with State Equation took 15406 ms to find 0 implicit places.
[2023-03-11 04:05:57] [INFO ] Redundant transitions in 670 ms returned []
[2023-03-11 04:05:57] [INFO ] Invariant cache hit.
[2023-03-11 04:06:00] [INFO ] Dead Transitions using invariants and state equation in 2914 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19182 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6276 edges and 1843 vertex of which 1679 / 1843 are part of one of the 2 SCC in 2 ms
Free SCC test removed 1677 places
Drop transitions removed 4718 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6350 transitions.
Graph (complete) has 411 edges and 166 vertex of which 45 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.1 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 45 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 44 transition count 48
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 6 transition count 10
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 place count 6 transition count 10
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 6 transition count 7
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 166 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 4 transition count 5
Applied a total of 167 rules in 13 ms. Remains 4 /1843 variables (removed 1839) and now considering 5/6519 (removed 6514) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2023-03-11 04:06:00] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 04:06:00] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:06:00] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:06:00] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 04:06:00] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 151 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2023-03-11 04:06:00] [INFO ] Computed 42 place invariants in 196 ms
[2023-03-11 04:06:01] [INFO ] Implicit Places using invariants in 1340 ms returned []
[2023-03-11 04:06:01] [INFO ] Invariant cache hit.
[2023-03-11 04:06:04] [INFO ] Implicit Places using invariants and state equation in 2605 ms returned []
Implicit Place search using SMT with State Equation took 3963 ms to find 0 implicit places.
[2023-03-11 04:06:04] [INFO ] Invariant cache hit.
[2023-03-11 04:06:07] [INFO ] Dead Transitions using invariants and state equation in 2982 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7110 ms. Remains : 1844/1844 places, 6520/6520 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 120499 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 120499 steps, saw 32175 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 04:06:11] [INFO ] Invariant cache hit.
[2023-03-11 04:06:11] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-11 04:06:11] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-11 04:06:13] [INFO ] After 1714ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 04:06:13] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-11 04:06:13] [INFO ] After 640ms SMT Verify possible using 4757 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:06:13] [INFO ] After 2733ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:06:14] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-11 04:06:14] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-11 04:06:15] [INFO ] After 1771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:06:17] [INFO ] After 1431ms SMT Verify possible using 4757 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 04:06:17] [INFO ] After 1800ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 290 ms.
[2023-03-11 04:06:17] [INFO ] After 4190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1844 transition count 6519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1641 times.
Drop transitions removed 1641 transitions
Iterating global reduction 1 with 1641 rules applied. Total rules applied 1643 place count 1843 transition count 6519
Applied a total of 1643 rules in 776 ms. Remains 1843 /1844 variables (removed 1) and now considering 6519/6520 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 776 ms. Remains : 1843/1844 places, 6519/6520 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 119590 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119590 steps, saw 33141 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2023-03-11 04:06:22] [INFO ] Computed 42 place invariants in 266 ms
[2023-03-11 04:06:22] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-11 04:06:22] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 34 ms returned sat
[2023-03-11 04:06:24] [INFO ] After 2211ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 04:06:24] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2023-03-11 04:06:25] [INFO ] After 661ms SMT Verify possible using 6397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:06:25] [INFO ] After 3512ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:06:25] [INFO ] [Nat]Absence check using 40 positive place invariants in 22 ms returned sat
[2023-03-11 04:06:25] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-11 04:06:27] [INFO ] After 1644ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:06:29] [INFO ] After 1374ms SMT Verify possible using 6397 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 04:06:29] [INFO ] After 1724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 268 ms.
[2023-03-11 04:06:29] [INFO ] After 4021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 270 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 241 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2023-03-11 04:06:30] [INFO ] Invariant cache hit.
[2023-03-11 04:06:32] [INFO ] Implicit Places using invariants in 1974 ms returned []
[2023-03-11 04:06:32] [INFO ] Invariant cache hit.
[2023-03-11 04:06:33] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2023-03-11 04:06:45] [INFO ] Implicit Places using invariants and state equation in 13669 ms returned []
Implicit Place search using SMT with State Equation took 15664 ms to find 0 implicit places.
[2023-03-11 04:06:46] [INFO ] Redundant transitions in 423 ms returned []
[2023-03-11 04:06:46] [INFO ] Invariant cache hit.
[2023-03-11 04:06:49] [INFO ] Dead Transitions using invariants and state equation in 2911 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19279 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6276 edges and 1843 vertex of which 1679 / 1843 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1677 places
Drop transitions removed 4718 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6350 transitions.
Graph (complete) has 411 edges and 166 vertex of which 45 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 45 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 44 transition count 48
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 6 transition count 10
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 place count 6 transition count 10
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 6 transition count 7
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 166 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 4 transition count 5
Applied a total of 167 rules in 11 ms. Remains 4 /1843 variables (removed 1839) and now considering 5/6519 (removed 6514) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2023-03-11 04:06:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 04:06:49] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:06:49] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:06:49] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-11 04:06:49] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1438 ms.
Product exploration explored 100000 steps with 25000 reset in 1441 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 191 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2023-03-11 04:06:53] [INFO ] Redundant transitions in 385 ms returned []
// Phase 1: matrix 6520 rows 1844 cols
[2023-03-11 04:06:53] [INFO ] Computed 42 place invariants in 194 ms
[2023-03-11 04:06:57] [INFO ] Dead Transitions using invariants and state equation in 3307 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3897 ms. Remains : 1844/1844 places, 6520/6520 transitions.
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 124 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2023-03-11 04:06:57] [INFO ] Invariant cache hit.
[2023-03-11 04:06:58] [INFO ] Implicit Places using invariants in 975 ms returned []
[2023-03-11 04:06:58] [INFO ] Invariant cache hit.
[2023-03-11 04:06:59] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-11 04:07:01] [INFO ] Implicit Places using invariants and state equation in 3538 ms returned []
Implicit Place search using SMT with State Equation took 4519 ms to find 0 implicit places.
[2023-03-11 04:07:01] [INFO ] Invariant cache hit.
[2023-03-11 04:07:04] [INFO ] Dead Transitions using invariants and state equation in 2837 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7482 ms. Remains : 1844/1844 places, 6520/6520 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-06 finished in 119260 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)))'
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(G(p0)))'
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)) U G(p1)))'
[2023-03-11 04:07:05] [INFO ] Flatten gal took : 336 ms
[2023-03-11 04:07:05] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-11 04:07:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3683 places, 9840 transitions and 26320 arcs took 66 ms.
Total runtime 1056676 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CANInsertWithFailure-PT-040
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
LTLCardinality

FORMULA CANInsertWithFailure-PT-040-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CANInsertWithFailure-PT-040-LTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678508368074

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/378/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/378/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/378/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: NOTDEADLOCKFREE
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 6 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
lola: LAUNCH task # 1 (type EXCL) for 0 CANInsertWithFailure-PT-040-LTLCardinality-02
lola: time limit : 718 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CANInsertWithFailure-PT-040-LTLCardinality-02
lola: result : true
lola: markings : 121
lola: fired transitions : 120
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 CANInsertWithFailure-PT-040-LTLCardinality-13
lola: time limit : 898 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 4/898 1/32 CANInsertWithFailure-PT-040-LTLCardinality-13 18384 m, 3676 m/sec, 48300 t fired, .

Time elapsed: 11 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 9/898 2/32 CANInsertWithFailure-PT-040-LTLCardinality-13 39825 m, 4288 m/sec, 106181 t fired, .

Time elapsed: 16 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 14/898 2/32 CANInsertWithFailure-PT-040-LTLCardinality-13 60949 m, 4224 m/sec, 165696 t fired, .

Time elapsed: 21 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 19/898 3/32 CANInsertWithFailure-PT-040-LTLCardinality-13 82592 m, 4328 m/sec, 226804 t fired, .

Time elapsed: 26 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 24/898 3/32 CANInsertWithFailure-PT-040-LTLCardinality-13 106764 m, 4834 m/sec, 294872 t fired, .

Time elapsed: 31 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 29/898 4/32 CANInsertWithFailure-PT-040-LTLCardinality-13 132668 m, 5180 m/sec, 367833 t fired, .

Time elapsed: 36 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 34/898 5/32 CANInsertWithFailure-PT-040-LTLCardinality-13 159083 m, 5283 m/sec, 442410 t fired, .

Time elapsed: 41 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 39/898 6/32 CANInsertWithFailure-PT-040-LTLCardinality-13 186821 m, 5547 m/sec, 521307 t fired, .

Time elapsed: 46 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 44/898 6/32 CANInsertWithFailure-PT-040-LTLCardinality-13 210089 m, 4653 m/sec, 585104 t fired, .

Time elapsed: 51 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 49/898 6/32 CANInsertWithFailure-PT-040-LTLCardinality-13 230652 m, 4112 m/sec, 643019 t fired, .

Time elapsed: 56 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 54/898 7/32 CANInsertWithFailure-PT-040-LTLCardinality-13 253385 m, 4546 m/sec, 707229 t fired, .

Time elapsed: 61 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 59/898 7/32 CANInsertWithFailure-PT-040-LTLCardinality-13 276291 m, 4581 m/sec, 771445 t fired, .

Time elapsed: 66 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 64/898 8/32 CANInsertWithFailure-PT-040-LTLCardinality-13 297367 m, 4215 m/sec, 830480 t fired, .

Time elapsed: 71 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 69/898 8/32 CANInsertWithFailure-PT-040-LTLCardinality-13 315916 m, 3709 m/sec, 883237 t fired, .

Time elapsed: 76 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 74/898 9/32 CANInsertWithFailure-PT-040-LTLCardinality-13 335930 m, 4002 m/sec, 941141 t fired, .

Time elapsed: 81 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 79/898 9/32 CANInsertWithFailure-PT-040-LTLCardinality-13 356601 m, 4134 m/sec, 1001142 t fired, .

Time elapsed: 86 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 84/898 9/32 CANInsertWithFailure-PT-040-LTLCardinality-13 379177 m, 4515 m/sec, 1066519 t fired, .

Time elapsed: 91 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 89/898 10/32 CANInsertWithFailure-PT-040-LTLCardinality-13 400652 m, 4295 m/sec, 1128278 t fired, .

Time elapsed: 96 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 94/898 10/32 CANInsertWithFailure-PT-040-LTLCardinality-13 422105 m, 4290 m/sec, 1190105 t fired, .

Time elapsed: 101 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 99/898 11/32 CANInsertWithFailure-PT-040-LTLCardinality-13 444578 m, 4494 m/sec, 1255510 t fired, .

Time elapsed: 106 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 104/898 11/32 CANInsertWithFailure-PT-040-LTLCardinality-13 469229 m, 4930 m/sec, 1326964 t fired, .

Time elapsed: 111 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 109/898 12/32 CANInsertWithFailure-PT-040-LTLCardinality-13 493697 m, 4893 m/sec, 1397754 t fired, .

Time elapsed: 116 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 114/898 12/32 CANInsertWithFailure-PT-040-LTLCardinality-13 514438 m, 4148 m/sec, 1457856 t fired, .

Time elapsed: 121 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 119/898 12/32 CANInsertWithFailure-PT-040-LTLCardinality-13 538802 m, 4872 m/sec, 1528088 t fired, .

Time elapsed: 126 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 124/898 13/32 CANInsertWithFailure-PT-040-LTLCardinality-13 561458 m, 4531 m/sec, 1593927 t fired, .

Time elapsed: 131 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 129/898 13/32 CANInsertWithFailure-PT-040-LTLCardinality-13 585233 m, 4755 m/sec, 1662173 t fired, .

Time elapsed: 136 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 134/898 14/32 CANInsertWithFailure-PT-040-LTLCardinality-13 609008 m, 4755 m/sec, 1730916 t fired, .

Time elapsed: 141 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 139/898 14/32 CANInsertWithFailure-PT-040-LTLCardinality-13 631597 m, 4517 m/sec, 1796779 t fired, .

Time elapsed: 146 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 144/898 15/32 CANInsertWithFailure-PT-040-LTLCardinality-13 656203 m, 4921 m/sec, 1868313 t fired, .

Time elapsed: 151 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 149/898 15/32 CANInsertWithFailure-PT-040-LTLCardinality-13 679630 m, 4685 m/sec, 1936087 t fired, .

Time elapsed: 156 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 154/898 16/32 CANInsertWithFailure-PT-040-LTLCardinality-13 702318 m, 4537 m/sec, 2002067 t fired, .

Time elapsed: 161 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 159/898 16/32 CANInsertWithFailure-PT-040-LTLCardinality-13 726606 m, 4857 m/sec, 2071826 t fired, .

Time elapsed: 166 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 164/898 17/32 CANInsertWithFailure-PT-040-LTLCardinality-13 750598 m, 4798 m/sec, 2141708 t fired, .

Time elapsed: 171 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 169/898 17/32 CANInsertWithFailure-PT-040-LTLCardinality-13 777192 m, 5318 m/sec, 2219104 t fired, .

Time elapsed: 176 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 174/898 17/32 CANInsertWithFailure-PT-040-LTLCardinality-13 803550 m, 5271 m/sec, 2294918 t fired, .

Time elapsed: 181 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 179/898 18/32 CANInsertWithFailure-PT-040-LTLCardinality-13 830661 m, 5422 m/sec, 2373035 t fired, .

Time elapsed: 186 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 184/898 18/32 CANInsertWithFailure-PT-040-LTLCardinality-13 858807 m, 5629 m/sec, 2453991 t fired, .

Time elapsed: 191 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 189/898 19/32 CANInsertWithFailure-PT-040-LTLCardinality-13 889169 m, 6072 m/sec, 2541377 t fired, .

Time elapsed: 196 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 194/898 19/32 CANInsertWithFailure-PT-040-LTLCardinality-13 918218 m, 5809 m/sec, 2624857 t fired, .

Time elapsed: 201 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 199/898 20/32 CANInsertWithFailure-PT-040-LTLCardinality-13 946585 m, 5673 m/sec, 2706174 t fired, .

Time elapsed: 206 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 204/898 20/32 CANInsertWithFailure-PT-040-LTLCardinality-13 971512 m, 4985 m/sec, 2778680 t fired, .

Time elapsed: 211 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 209/898 21/32 CANInsertWithFailure-PT-040-LTLCardinality-13 999739 m, 5645 m/sec, 2860056 t fired, .

Time elapsed: 216 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 214/898 22/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1026079 m, 5268 m/sec, 2936987 t fired, .

Time elapsed: 221 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 219/898 22/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1054410 m, 5666 m/sec, 3019287 t fired, .

Time elapsed: 226 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 224/898 23/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1083280 m, 5774 m/sec, 3102470 t fired, .

Time elapsed: 231 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 229/898 23/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1109547 m, 5253 m/sec, 3179319 t fired, .

Time elapsed: 236 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 234/898 24/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1137816 m, 5653 m/sec, 3261029 t fired, .

Time elapsed: 241 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 239/898 24/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1166580 m, 5752 m/sec, 3343973 t fired, .

Time elapsed: 246 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 244/898 25/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1193473 m, 5378 m/sec, 3422592 t fired, .

Time elapsed: 251 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 249/898 25/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1222284 m, 5762 m/sec, 3506141 t fired, .

Time elapsed: 256 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 254/898 26/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1252533 m, 6049 m/sec, 3594582 t fired, .

Time elapsed: 261 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 259/898 26/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1280115 m, 5516 m/sec, 3674240 t fired, .

Time elapsed: 266 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 264/898 27/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1305337 m, 5044 m/sec, 3747073 t fired, .

Time elapsed: 271 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 269/898 27/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1332078 m, 5348 m/sec, 3824368 t fired, .

Time elapsed: 276 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 274/898 28/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1360348 m, 5654 m/sec, 3906857 t fired, .

Time elapsed: 281 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 279/898 28/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1389322 m, 5794 m/sec, 3990546 t fired, .

Time elapsed: 286 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 284/898 29/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1418151 m, 5765 m/sec, 4074575 t fired, .

Time elapsed: 291 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 289/898 29/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1449326 m, 6235 m/sec, 4164968 t fired, .

Time elapsed: 296 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 294/898 30/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1480084 m, 6151 m/sec, 4253567 t fired, .

Time elapsed: 301 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 299/898 31/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1509947 m, 5972 m/sec, 4340464 t fired, .

Time elapsed: 306 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 304/898 31/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1539506 m, 5911 m/sec, 4426885 t fired, .

Time elapsed: 311 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 309/898 32/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1566501 m, 5399 m/sec, 4504343 t fired, .

Time elapsed: 316 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 314/898 32/32 CANInsertWithFailure-PT-040-LTLCardinality-13 1588562 m, 4412 m/sec, 4565264 t fired, .

Time elapsed: 321 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 10 (type EXCL) for CANInsertWithFailure-PT-040-LTLCardinality-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 326 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 13 (type EXCL) for 12 CANInsertWithFailure-PT-040-LTLCardinality-15
lola: time limit : 1091 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 5/1091 5/32 CANInsertWithFailure-PT-040-LTLCardinality-15 144349 m, 28869 m/sec, 237563 t fired, .

Time elapsed: 331 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 10/1091 7/32 CANInsertWithFailure-PT-040-LTLCardinality-15 292137 m, 29557 m/sec, 496704 t fired, .

Time elapsed: 336 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 15/1091 8/32 CANInsertWithFailure-PT-040-LTLCardinality-15 352377 m, 12048 m/sec, 779672 t fired, .

Time elapsed: 341 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 20/1091 9/32 CANInsertWithFailure-PT-040-LTLCardinality-15 420113 m, 13547 m/sec, 1054367 t fired, .

Time elapsed: 346 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 25/1091 11/32 CANInsertWithFailure-PT-040-LTLCardinality-15 475533 m, 11084 m/sec, 1328179 t fired, .

Time elapsed: 351 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 30/1091 12/32 CANInsertWithFailure-PT-040-LTLCardinality-15 534084 m, 11710 m/sec, 1602919 t fired, .

Time elapsed: 356 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 35/1091 13/32 CANInsertWithFailure-PT-040-LTLCardinality-15 594713 m, 12125 m/sec, 1876659 t fired, .

Time elapsed: 361 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 40/1091 14/32 CANInsertWithFailure-PT-040-LTLCardinality-15 653477 m, 11752 m/sec, 2152263 t fired, .

Time elapsed: 366 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 45/1091 15/32 CANInsertWithFailure-PT-040-LTLCardinality-15 712505 m, 11805 m/sec, 2424421 t fired, .

Time elapsed: 371 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 50/1091 16/32 CANInsertWithFailure-PT-040-LTLCardinality-15 769913 m, 11481 m/sec, 2695932 t fired, .

Time elapsed: 376 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 55/1091 17/32 CANInsertWithFailure-PT-040-LTLCardinality-15 827295 m, 11476 m/sec, 2969778 t fired, .

Time elapsed: 381 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 60/1091 18/32 CANInsertWithFailure-PT-040-LTLCardinality-15 880839 m, 10708 m/sec, 3221085 t fired, .

Time elapsed: 386 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 65/1091 19/32 CANInsertWithFailure-PT-040-LTLCardinality-15 931721 m, 10176 m/sec, 3468438 t fired, .

Time elapsed: 391 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 70/1091 20/32 CANInsertWithFailure-PT-040-LTLCardinality-15 983959 m, 10447 m/sec, 3730306 t fired, .

Time elapsed: 396 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 75/1091 21/32 CANInsertWithFailure-PT-040-LTLCardinality-15 1034027 m, 10013 m/sec, 3973604 t fired, .

Time elapsed: 401 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 80/1091 22/32 CANInsertWithFailure-PT-040-LTLCardinality-15 1082829 m, 9760 m/sec, 4217740 t fired, .

Time elapsed: 406 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 85/1091 23/32 CANInsertWithFailure-PT-040-LTLCardinality-15 1132891 m, 10012 m/sec, 4462230 t fired, .

Time elapsed: 411 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 90/1091 24/32 CANInsertWithFailure-PT-040-LTLCardinality-15 1183233 m, 10068 m/sec, 4714381 t fired, .

Time elapsed: 416 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 95/1091 25/32 CANInsertWithFailure-PT-040-LTLCardinality-15 1236713 m, 10696 m/sec, 4972009 t fired, .

Time elapsed: 421 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 100/1091 26/32 CANInsertWithFailure-PT-040-LTLCardinality-15 1288567 m, 10370 m/sec, 5241997 t fired, .

Time elapsed: 426 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 105/1091 27/32 CANInsertWithFailure-PT-040-LTLCardinality-15 1341689 m, 10624 m/sec, 5502627 t fired, .

Time elapsed: 431 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 110/1091 28/32 CANInsertWithFailure-PT-040-LTLCardinality-15 1389833 m, 9628 m/sec, 5773496 t fired, .

Time elapsed: 436 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 115/1091 29/32 CANInsertWithFailure-PT-040-LTLCardinality-15 1445645 m, 11162 m/sec, 6046966 t fired, .

Time elapsed: 441 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 120/1091 30/32 CANInsertWithFailure-PT-040-LTLCardinality-15 1494507 m, 9772 m/sec, 6317334 t fired, .

Time elapsed: 446 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 125/1091 31/32 CANInsertWithFailure-PT-040-LTLCardinality-15 1543562 m, 9811 m/sec, 6563396 t fired, .

Time elapsed: 451 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 130/1091 32/32 CANInsertWithFailure-PT-040-LTLCardinality-15 1587518 m, 8791 m/sec, 6810489 t fired, .

Time elapsed: 456 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 13 (type EXCL) for CANInsertWithFailure-PT-040-LTLCardinality-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 461 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 4 (type EXCL) for 3 CANInsertWithFailure-PT-040-LTLCardinality-06
lola: time limit : 1569 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for CANInsertWithFailure-PT-040-LTLCardinality-06
lola: result : true
lola: markings : 121
lola: fired transitions : 120
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 CANInsertWithFailure-PT-040-LTLCardinality-10
lola: time limit : 3139 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/3139 1/32 CANInsertWithFailure-PT-040-LTLCardinality-10 18795 m, 3759 m/sec, 53228 t fired, .

Time elapsed: 466 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/3139 2/32 CANInsertWithFailure-PT-040-LTLCardinality-10 37307 m, 3702 m/sec, 108273 t fired, .

Time elapsed: 471 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/3139 2/32 CANInsertWithFailure-PT-040-LTLCardinality-10 58702 m, 4279 m/sec, 173916 t fired, .

Time elapsed: 476 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/3139 3/32 CANInsertWithFailure-PT-040-LTLCardinality-10 79193 m, 4098 m/sec, 236553 t fired, .

Time elapsed: 481 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/3139 4/32 CANInsertWithFailure-PT-040-LTLCardinality-10 98771 m, 3915 m/sec, 299366 t fired, .

Time elapsed: 486 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/3139 4/32 CANInsertWithFailure-PT-040-LTLCardinality-10 119111 m, 4068 m/sec, 360768 t fired, .

Time elapsed: 491 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/3139 5/32 CANInsertWithFailure-PT-040-LTLCardinality-10 138673 m, 3912 m/sec, 420190 t fired, .

Time elapsed: 496 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 40/3139 5/32 CANInsertWithFailure-PT-040-LTLCardinality-10 156144 m, 3494 m/sec, 472309 t fired, .

Time elapsed: 501 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 45/3139 6/32 CANInsertWithFailure-PT-040-LTLCardinality-10 174359 m, 3643 m/sec, 527928 t fired, .

Time elapsed: 506 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 50/3139 6/32 CANInsertWithFailure-PT-040-LTLCardinality-10 193247 m, 3777 m/sec, 586192 t fired, .

Time elapsed: 511 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 55/3139 7/32 CANInsertWithFailure-PT-040-LTLCardinality-10 212034 m, 3757 m/sec, 643730 t fired, .

Time elapsed: 516 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 60/3139 7/32 CANInsertWithFailure-PT-040-LTLCardinality-10 231205 m, 3834 m/sec, 704526 t fired, .

Time elapsed: 521 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 65/3139 8/32 CANInsertWithFailure-PT-040-LTLCardinality-10 250420 m, 3843 m/sec, 764443 t fired, .

Time elapsed: 526 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 70/3139 9/32 CANInsertWithFailure-PT-040-LTLCardinality-10 269095 m, 3735 m/sec, 821905 t fired, .

Time elapsed: 531 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 75/3139 9/32 CANInsertWithFailure-PT-040-LTLCardinality-10 287971 m, 3775 m/sec, 879199 t fired, .

Time elapsed: 536 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 80/3139 10/32 CANInsertWithFailure-PT-040-LTLCardinality-10 306829 m, 3771 m/sec, 939469 t fired, .

Time elapsed: 541 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 85/3139 10/32 CANInsertWithFailure-PT-040-LTLCardinality-10 327529 m, 4140 m/sec, 1002463 t fired, .

Time elapsed: 546 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 90/3139 11/32 CANInsertWithFailure-PT-040-LTLCardinality-10 345482 m, 3590 m/sec, 1060105 t fired, .

Time elapsed: 551 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 95/3139 11/32 CANInsertWithFailure-PT-040-LTLCardinality-10 365858 m, 4075 m/sec, 1124114 t fired, .

Time elapsed: 556 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 100/3139 12/32 CANInsertWithFailure-PT-040-LTLCardinality-10 386729 m, 4174 m/sec, 1190225 t fired, .

Time elapsed: 561 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 105/3139 12/32 CANInsertWithFailure-PT-040-LTLCardinality-10 406606 m, 3975 m/sec, 1255015 t fired, .

Time elapsed: 566 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 110/3139 13/32 CANInsertWithFailure-PT-040-LTLCardinality-10 427146 m, 4108 m/sec, 1320365 t fired, .

Time elapsed: 571 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 115/3139 13/32 CANInsertWithFailure-PT-040-LTLCardinality-10 446898 m, 3950 m/sec, 1383297 t fired, .

Time elapsed: 576 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 120/3139 14/32 CANInsertWithFailure-PT-040-LTLCardinality-10 467119 m, 4044 m/sec, 1448089 t fired, .

Time elapsed: 581 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 125/3139 15/32 CANInsertWithFailure-PT-040-LTLCardinality-10 487047 m, 3985 m/sec, 1508960 t fired, .

Time elapsed: 586 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 130/3139 15/32 CANInsertWithFailure-PT-040-LTLCardinality-10 506793 m, 3949 m/sec, 1570324 t fired, .

Time elapsed: 591 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 135/3139 16/32 CANInsertWithFailure-PT-040-LTLCardinality-10 527619 m, 4165 m/sec, 1634934 t fired, .

Time elapsed: 596 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 140/3139 16/32 CANInsertWithFailure-PT-040-LTLCardinality-10 548198 m, 4115 m/sec, 1699748 t fired, .

Time elapsed: 601 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 145/3139 17/32 CANInsertWithFailure-PT-040-LTLCardinality-10 569490 m, 4258 m/sec, 1765667 t fired, .

Time elapsed: 606 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 150/3139 17/32 CANInsertWithFailure-PT-040-LTLCardinality-10 590053 m, 4112 m/sec, 1830959 t fired, .

Time elapsed: 611 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 155/3139 18/32 CANInsertWithFailure-PT-040-LTLCardinality-10 610473 m, 4084 m/sec, 1895925 t fired, .

Time elapsed: 616 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 160/3139 18/32 CANInsertWithFailure-PT-040-LTLCardinality-10 631297 m, 4164 m/sec, 1962466 t fired, .

Time elapsed: 621 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 165/3139 19/32 CANInsertWithFailure-PT-040-LTLCardinality-10 650292 m, 3799 m/sec, 2026423 t fired, .

Time elapsed: 626 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 170/3139 20/32 CANInsertWithFailure-PT-040-LTLCardinality-10 671727 m, 4287 m/sec, 2095538 t fired, .

Time elapsed: 631 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 175/3139 20/32 CANInsertWithFailure-PT-040-LTLCardinality-10 694120 m, 4478 m/sec, 2164002 t fired, .

Time elapsed: 636 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 180/3139 21/32 CANInsertWithFailure-PT-040-LTLCardinality-10 714450 m, 4066 m/sec, 2228456 t fired, .

Time elapsed: 641 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 185/3139 21/32 CANInsertWithFailure-PT-040-LTLCardinality-10 737097 m, 4529 m/sec, 2298792 t fired, .

Time elapsed: 646 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 190/3139 22/32 CANInsertWithFailure-PT-040-LTLCardinality-10 756905 m, 3961 m/sec, 2363245 t fired, .

Time elapsed: 651 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 195/3139 22/32 CANInsertWithFailure-PT-040-LTLCardinality-10 774864 m, 3591 m/sec, 2424603 t fired, .

Time elapsed: 656 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 200/3139 23/32 CANInsertWithFailure-PT-040-LTLCardinality-10 797612 m, 4549 m/sec, 2495602 t fired, .

Time elapsed: 661 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 205/3139 24/32 CANInsertWithFailure-PT-040-LTLCardinality-10 819260 m, 4329 m/sec, 2563671 t fired, .

Time elapsed: 666 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 210/3139 24/32 CANInsertWithFailure-PT-040-LTLCardinality-10 837302 m, 3608 m/sec, 2624154 t fired, .

Time elapsed: 671 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 215/3139 25/32 CANInsertWithFailure-PT-040-LTLCardinality-10 857415 m, 4022 m/sec, 2690392 t fired, .

Time elapsed: 676 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 220/3139 25/32 CANInsertWithFailure-PT-040-LTLCardinality-10 876409 m, 3798 m/sec, 2753356 t fired, .

Time elapsed: 681 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 225/3139 26/32 CANInsertWithFailure-PT-040-LTLCardinality-10 895709 m, 3860 m/sec, 2818955 t fired, .

Time elapsed: 686 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 230/3139 26/32 CANInsertWithFailure-PT-040-LTLCardinality-10 914113 m, 3680 m/sec, 2881670 t fired, .

Time elapsed: 691 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 235/3139 26/32 CANInsertWithFailure-PT-040-LTLCardinality-10 934570 m, 4091 m/sec, 2948246 t fired, .

Time elapsed: 696 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 240/3139 27/32 CANInsertWithFailure-PT-040-LTLCardinality-10 958821 m, 4850 m/sec, 3013456 t fired, .

Time elapsed: 701 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 245/3139 28/32 CANInsertWithFailure-PT-040-LTLCardinality-10 980851 m, 4406 m/sec, 3073822 t fired, .

Time elapsed: 706 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 250/3139 28/32 CANInsertWithFailure-PT-040-LTLCardinality-10 1004054 m, 4640 m/sec, 3139398 t fired, .

Time elapsed: 711 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 255/3139 29/32 CANInsertWithFailure-PT-040-LTLCardinality-10 1028191 m, 4827 m/sec, 3207689 t fired, .

Time elapsed: 716 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 260/3139 30/32 CANInsertWithFailure-PT-040-LTLCardinality-10 1054744 m, 5310 m/sec, 3282060 t fired, .

Time elapsed: 721 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 265/3139 30/32 CANInsertWithFailure-PT-040-LTLCardinality-10 1080791 m, 5209 m/sec, 3355749 t fired, .

Time elapsed: 726 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 270/3139 31/32 CANInsertWithFailure-PT-040-LTLCardinality-10 1109148 m, 5671 m/sec, 3436299 t fired, .

Time elapsed: 731 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 275/3139 32/32 CANInsertWithFailure-PT-040-LTLCardinality-10 1137593 m, 5689 m/sec, 3520354 t fired, .

Time elapsed: 736 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 7 (type EXCL) for CANInsertWithFailure-PT-040-LTLCardinality-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 741 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: Portfolio finished: no open tasks 5

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLCardinality-02: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-06: LTL true LTL model checker
CANInsertWithFailure-PT-040-LTLCardinality-10: LTL unknown AGGR
CANInsertWithFailure-PT-040-LTLCardinality-13: LTL unknown AGGR
CANInsertWithFailure-PT-040-LTLCardinality-15: LTL unknown AGGR


Time elapsed: 741 secs. Pages in use: 32

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-040"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CANInsertWithFailure-PT-040, 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 r039-tajo-167813692900731"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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