Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 9.6K Feb 26 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 00:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 01:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 26 01:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 00:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 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 2.6M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678659070361

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 22:11:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 22:11:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 22:11:12] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2023-03-12 22:11:12] [INFO ] Transformed 1044 places.
[2023-03-12 22:11:12] [INFO ] Transformed 2520 transitions.
[2023-03-12 22:11:12] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 242 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 1044 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1043 transition count 2520
Applied a total of 1 rules in 100 ms. Remains 1043 /1044 variables (removed 1) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-12 22:11:12] [INFO ] Computed 22 place invariants in 95 ms
[2023-03-12 22:11:13] [INFO ] Implicit Places using invariants in 575 ms returned []
[2023-03-12 22:11:13] [INFO ] Invariant cache hit.
[2023-03-12 22:11:14] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:11:16] [INFO ] Implicit Places using invariants and state equation in 3486 ms returned []
Implicit Place search using SMT with State Equation took 4089 ms to find 0 implicit places.
[2023-03-12 22:11:16] [INFO ] Invariant cache hit.
[2023-03-12 22:11:17] [INFO ] Dead Transitions using invariants and state equation in 981 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1043/1044 places, 2520/2520 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5197 ms. Remains : 1043/1044 places, 2520/2520 transitions.
Support contains 49 out of 1043 places after structural reductions.
[2023-03-12 22:11:18] [INFO ] Flatten gal took : 198 ms
[2023-03-12 22:11:18] [INFO ] Flatten gal took : 223 ms
[2023-03-12 22:11:18] [INFO ] Input system was already deterministic with 2520 transitions.
Support contains 48 out of 1043 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 651 ms. (steps per millisecond=15 ) properties (out of 32) seen :18
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 :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) 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 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-12 22:11:19] [INFO ] Invariant cache hit.
[2023-03-12 22:11:20] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned sat
[2023-03-12 22:11:20] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-12 22:11:21] [INFO ] After 933ms SMT Verify possible using state equation in real domain returned unsat :4 sat :5 real:4
[2023-03-12 22:11:21] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:11:21] [INFO ] After 618ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :4 sat :0 real:9
[2023-03-12 22:11:21] [INFO ] After 2179ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:9
[2023-03-12 22:11:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2023-03-12 22:11:22] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-12 22:11:23] [INFO ] After 1251ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :8
[2023-03-12 22:11:25] [INFO ] After 2001ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :5 sat :8
[2023-03-12 22:11:27] [INFO ] After 3705ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :8
Attempting to minimize the solution found.
Minimization took 1420 ms.
[2023-03-12 22:11:28] [INFO ] After 6771ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :8
Fused 13 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 70 ms.
Support contains 9 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 1043 transition count 2384
Reduce places removed 136 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 137 rules applied. Total rules applied 273 place count 907 transition count 2383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 274 place count 906 transition count 2383
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 1 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 3 with 714 rules applied. Total rules applied 988 place count 549 transition count 2026
Drop transitions removed 322 transitions
Redundant transition composition rules discarded 322 transitions
Iterating global reduction 3 with 322 rules applied. Total rules applied 1310 place count 549 transition count 1704
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1312 place count 549 transition count 1702
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1314 place count 547 transition count 1702
Partial Free-agglomeration rule applied 473 times.
Drop transitions removed 473 transitions
Iterating global reduction 4 with 473 rules applied. Total rules applied 1787 place count 547 transition count 1702
Applied a total of 1787 rules in 565 ms. Remains 547 /1043 variables (removed 496) and now considering 1702/2520 (removed 818) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 566 ms. Remains : 547/1043 places, 1702/2520 transitions.
Incomplete random walk after 10000 steps, including 96 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 313195 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 313195 steps, saw 45712 distinct states, run finished after 3002 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1702 rows 547 cols
[2023-03-12 22:11:32] [INFO ] Computed 22 place invariants in 31 ms
[2023-03-12 22:11:32] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-12 22:11:32] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-12 22:11:33] [INFO ] After 887ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 22:11:33] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-12 22:11:33] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-12 22:11:34] [INFO ] After 616ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 22:11:34] [INFO ] State equation strengthened by 1586 read => feed constraints.
[2023-03-12 22:11:35] [INFO ] After 913ms SMT Verify possible using 1586 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-12 22:11:36] [INFO ] After 1749ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 523 ms.
[2023-03-12 22:11:36] [INFO ] After 3090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 93 ms.
Support contains 9 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 1702/1702 transitions.
Applied a total of 0 rules in 32 ms. Remains 547 /547 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 547/547 places, 1702/1702 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 1702/1702 transitions.
Applied a total of 0 rules in 30 ms. Remains 547 /547 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
[2023-03-12 22:11:37] [INFO ] Invariant cache hit.
[2023-03-12 22:11:37] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-12 22:11:37] [INFO ] Invariant cache hit.
[2023-03-12 22:11:37] [INFO ] State equation strengthened by 1586 read => feed constraints.
[2023-03-12 22:11:42] [INFO ] Implicit Places using invariants and state equation in 4743 ms returned []
Implicit Place search using SMT with State Equation took 5196 ms to find 0 implicit places.
[2023-03-12 22:11:42] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-12 22:11:42] [INFO ] Invariant cache hit.
[2023-03-12 22:11:42] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5962 ms. Remains : 547/547 places, 1702/1702 transitions.
Graph (trivial) has 1519 edges and 547 vertex of which 433 / 547 are part of one of the 2 SCC in 4 ms
Free SCC test removed 431 places
Drop transitions removed 1109 transitions
Ensure Unique test removed 401 transitions
Reduce isomorphic transitions removed 1510 transitions.
Graph (complete) has 316 edges and 116 vertex of which 58 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.0 ms
Discarding 58 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Drop transitions removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 58 transition count 116
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 93 place count 25 transition count 66
Iterating global reduction 1 with 33 rules applied. Total rules applied 126 place count 25 transition count 66
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 143 place count 25 transition count 49
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 145 place count 24 transition count 48
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 147 place count 23 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 23 transition count 46
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 23 transition count 43
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 23 transition count 42
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 154 place count 22 transition count 41
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 22 transition count 40
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 157 place count 21 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 159 place count 19 transition count 37
Applied a total of 159 rules in 21 ms. Remains 19 /547 variables (removed 528) and now considering 37/1702 (removed 1665) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 37 rows 19 cols
[2023-03-12 22:11:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 22:11:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 22:11:42] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 22:11:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 22:11:43] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 22:11:43] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 22:11:43] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 82 stabilizing places and 140 stable transitions
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 84 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-12 22:11:43] [INFO ] Computed 22 place invariants in 38 ms
[2023-03-12 22:11:43] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-12 22:11:43] [INFO ] Invariant cache hit.
[2023-03-12 22:11:44] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:11:47] [INFO ] Implicit Places using invariants and state equation in 3598 ms returned []
Implicit Place search using SMT with State Equation took 3984 ms to find 0 implicit places.
[2023-03-12 22:11:47] [INFO ] Invariant cache hit.
[2023-03-12 22:11:48] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4967 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, p0, p0]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 3 s252) (LEQ 3 s8))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 217 reset in 562 ms.
Product exploration explored 100000 steps with 219 reset in 461 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 228 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 21 resets, run finished after 73 ms. (steps per millisecond=136 ) 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 259824 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 259824 steps, saw 63085 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 22:11:53] [INFO ] Invariant cache hit.
[2023-03-12 22:11:53] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2023-03-12 22:11:53] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-12 22:11:54] [INFO ] After 971ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:11:54] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-12 22:11:54] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-12 22:11:54] [INFO ] After 599ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:11:54] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:11:55] [INFO ] After 600ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 22:11:55] [INFO ] After 724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-12 22:11:55] [INFO ] After 1611ms 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 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 2 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 998 place count 544 transition count 2021
Drop transitions removed 324 transitions
Redundant transition composition rules discarded 324 transitions
Iterating global reduction 3 with 324 rules applied. Total rules applied 1322 place count 544 transition count 1697
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1324 place count 544 transition count 1695
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1326 place count 542 transition count 1695
Partial Free-agglomeration rule applied 459 times.
Drop transitions removed 459 transitions
Iterating global reduction 4 with 459 rules applied. Total rules applied 1785 place count 542 transition count 1695
Applied a total of 1785 rules in 188 ms. Remains 542 /1043 variables (removed 501) and now considering 1695/2520 (removed 825) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 542/1043 places, 1695/2520 transitions.
Incomplete random walk after 10000 steps, including 98 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 484163 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 484163 steps, saw 66500 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1695 rows 542 cols
[2023-03-12 22:11:58] [INFO ] Computed 22 place invariants in 21 ms
[2023-03-12 22:11:59] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-12 22:11:59] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-12 22:11:59] [INFO ] After 531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:11:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-12 22:11:59] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-12 22:11:59] [INFO ] After 345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:11:59] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-12 22:12:00] [INFO ] After 190ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 22:12:00] [INFO ] After 320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-12 22:12:00] [INFO ] After 870ms 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 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1695/1695 transitions.
Applied a total of 0 rules in 31 ms. Remains 542 /542 variables (removed 0) and now considering 1695/1695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 542/542 places, 1695/1695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1695/1695 transitions.
Applied a total of 0 rules in 31 ms. Remains 542 /542 variables (removed 0) and now considering 1695/1695 (removed 0) transitions.
[2023-03-12 22:12:00] [INFO ] Invariant cache hit.
[2023-03-12 22:12:01] [INFO ] Implicit Places using invariants in 648 ms returned []
[2023-03-12 22:12:01] [INFO ] Invariant cache hit.
[2023-03-12 22:12:01] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-12 22:12:05] [INFO ] Implicit Places using invariants and state equation in 4479 ms returned []
Implicit Place search using SMT with State Equation took 5141 ms to find 0 implicit places.
[2023-03-12 22:12:05] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-12 22:12:05] [INFO ] Invariant cache hit.
[2023-03-12 22:12:06] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5915 ms. Remains : 542/542 places, 1695/1695 transitions.
Graph (trivial) has 1536 edges and 542 vertex of which 437 / 542 are part of one of the 2 SCC in 1 ms
Free SCC test removed 435 places
Drop transitions removed 1121 transitions
Ensure Unique test removed 406 transitions
Reduce isomorphic transitions removed 1527 transitions.
Graph (complete) has 291 edges and 107 vertex of which 49 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.1 ms
Discarding 58 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 49 transition count 92
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 95 place count 15 transition count 41
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 15 transition count 41
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 146 place count 15 transition count 24
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 148 place count 14 transition count 23
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 150 place count 13 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 13 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 13 transition count 19
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 156 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 10 transition count 15
Applied a total of 158 rules in 10 ms. Remains 10 /542 variables (removed 532) and now considering 15/1695 (removed 1680) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2023-03-12 22:12:06] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 22:12:06] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 22:12:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 22:12:06] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:12:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 22:12:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 22:12:06] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:12:06] [INFO ] After 7ms 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-12 22:12:06] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 72 ms :[true, p0, p0]
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 20 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-12 22:12:06] [INFO ] Computed 22 place invariants in 33 ms
[2023-03-12 22:12:07] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-12 22:12:07] [INFO ] Invariant cache hit.
[2023-03-12 22:12:07] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:12:10] [INFO ] Implicit Places using invariants and state equation in 3057 ms returned []
Implicit Place search using SMT with State Equation took 3490 ms to find 0 implicit places.
[2023-03-12 22:12:10] [INFO ] Invariant cache hit.
[2023-03-12 22:12:11] [INFO ] Dead Transitions using invariants and state equation in 910 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4426 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 58 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 179365 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179365 steps, saw 46333 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 22:12:14] [INFO ] Invariant cache hit.
[2023-03-12 22:12:14] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-12 22:12:14] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-12 22:12:15] [INFO ] After 893ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:12:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-12 22:12:15] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-12 22:12:15] [INFO ] After 590ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:12:15] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:12:16] [INFO ] After 589ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 22:12:16] [INFO ] After 726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-12 22:12:16] [INFO ] After 1614ms 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 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 0 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 998 place count 544 transition count 2021
Drop transitions removed 324 transitions
Redundant transition composition rules discarded 324 transitions
Iterating global reduction 3 with 324 rules applied. Total rules applied 1322 place count 544 transition count 1697
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1324 place count 544 transition count 1695
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1326 place count 542 transition count 1695
Partial Free-agglomeration rule applied 459 times.
Drop transitions removed 459 transitions
Iterating global reduction 4 with 459 rules applied. Total rules applied 1785 place count 542 transition count 1695
Applied a total of 1785 rules in 158 ms. Remains 542 /1043 variables (removed 501) and now considering 1695/2520 (removed 825) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 542/1043 places, 1695/2520 transitions.
Incomplete random walk after 10000 steps, including 98 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 383532 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 383532 steps, saw 54444 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1695 rows 542 cols
[2023-03-12 22:12:20] [INFO ] Computed 22 place invariants in 22 ms
[2023-03-12 22:12:20] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-12 22:12:20] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-12 22:12:20] [INFO ] After 530ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:12:20] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:12:20] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-12 22:12:21] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:12:21] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-12 22:12:21] [INFO ] After 266ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 22:12:21] [INFO ] After 378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-12 22:12:21] [INFO ] After 867ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1695/1695 transitions.
Applied a total of 0 rules in 22 ms. Remains 542 /542 variables (removed 0) and now considering 1695/1695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 542/542 places, 1695/1695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1695/1695 transitions.
Applied a total of 0 rules in 23 ms. Remains 542 /542 variables (removed 0) and now considering 1695/1695 (removed 0) transitions.
[2023-03-12 22:12:21] [INFO ] Invariant cache hit.
[2023-03-12 22:12:22] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-12 22:12:22] [INFO ] Invariant cache hit.
[2023-03-12 22:12:22] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-12 22:12:26] [INFO ] Implicit Places using invariants and state equation in 4212 ms returned []
Implicit Place search using SMT with State Equation took 4717 ms to find 0 implicit places.
[2023-03-12 22:12:26] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-12 22:12:26] [INFO ] Invariant cache hit.
[2023-03-12 22:12:26] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5358 ms. Remains : 542/542 places, 1695/1695 transitions.
Graph (trivial) has 1536 edges and 542 vertex of which 437 / 542 are part of one of the 2 SCC in 12 ms
Free SCC test removed 435 places
Drop transitions removed 1121 transitions
Ensure Unique test removed 406 transitions
Reduce isomorphic transitions removed 1527 transitions.
Graph (complete) has 291 edges and 107 vertex of which 49 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.1 ms
Discarding 58 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 49 transition count 92
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 95 place count 15 transition count 41
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 15 transition count 41
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 146 place count 15 transition count 24
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 148 place count 14 transition count 23
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 150 place count 13 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 13 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 13 transition count 19
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 156 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 10 transition count 15
Applied a total of 158 rules in 18 ms. Remains 10 /542 variables (removed 532) and now considering 15/1695 (removed 1680) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2023-03-12 22:12:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 22:12:26] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 22:12:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-12 22:12:26] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:12:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 22:12:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 22:12:27] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:12:27] [INFO ] After 10ms 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-12 22:12:27] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 76 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 87 ms :[true, p0, p0]
Product exploration explored 100000 steps with 217 reset in 362 ms.
Product exploration explored 100000 steps with 223 reset in 389 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 95 ms :[true, p0, p0]
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1043 transition count 2520
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 19 Pre rules applied. Total rules applied 99 place count 1043 transition count 2520
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 118 place count 1043 transition count 2520
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 156 place count 1005 transition count 2482
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 194 place count 1005 transition count 2482
Performed 381 Post agglomeration using F-continuation condition.Transition count delta: -682
Deduced a syphon composed of 461 places in 0 ms
Iterating global reduction 1 with 381 rules applied. Total rules applied 575 place count 1005 transition count 3164
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 655 place count 925 transition count 3084
Deduced a syphon composed of 381 places in 1 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 735 place count 925 transition count 3084
Deduced a syphon composed of 381 places in 0 ms
Drop transitions removed 324 transitions
Redundant transition composition rules discarded 324 transitions
Iterating global reduction 1 with 324 rules applied. Total rules applied 1059 place count 925 transition count 2760
Deduced a syphon composed of 381 places in 1 ms
Applied a total of 1059 rules in 513 ms. Remains 925 /1043 variables (removed 118) and now considering 2760/2520 (removed -240) transitions.
[2023-03-12 22:12:29] [INFO ] Redundant transitions in 69 ms returned []
// Phase 1: matrix 2760 rows 925 cols
[2023-03-12 22:12:29] [INFO ] Computed 22 place invariants in 48 ms
[2023-03-12 22:12:30] [INFO ] Dead Transitions using invariants and state equation in 1189 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 925/1043 places, 2760/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1780 ms. Remains : 925/1043 places, 2760/2520 transitions.
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 25 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-12 22:12:30] [INFO ] Computed 22 place invariants in 28 ms
[2023-03-12 22:12:30] [INFO ] Implicit Places using invariants in 610 ms returned []
[2023-03-12 22:12:30] [INFO ] Invariant cache hit.
[2023-03-12 22:12:31] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:12:34] [INFO ] Implicit Places using invariants and state equation in 3182 ms returned []
Implicit Place search using SMT with State Equation took 3801 ms to find 0 implicit places.
[2023-03-12 22:12:34] [INFO ] Invariant cache hit.
[2023-03-12 22:12:34] [INFO ] Dead Transitions using invariants and state equation in 912 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4753 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-02 finished in 51844 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)||G(F(p1)))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 378
Deduced a syphon composed of 378 places in 1 ms
Reduce places removed 378 places and 0 transitions.
Iterating global reduction 2 with 756 rules applied. Total rules applied 1036 place count 525 transition count 2002
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1377 place count 525 transition count 1661
Applied a total of 1377 rules in 164 ms. Remains 525 /1043 variables (removed 518) and now considering 1661/2520 (removed 859) transitions.
// Phase 1: matrix 1661 rows 525 cols
[2023-03-12 22:12:35] [INFO ] Computed 22 place invariants in 17 ms
[2023-03-12 22:12:35] [INFO ] Implicit Places using invariants in 483 ms returned []
[2023-03-12 22:12:35] [INFO ] Invariant cache hit.
[2023-03-12 22:12:36] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2023-03-12 22:12:37] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 2304 ms to find 0 implicit places.
[2023-03-12 22:12:37] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-12 22:12:37] [INFO ] Invariant cache hit.
[2023-03-12 22:12:38] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 525/1043 places, 1661/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3128 ms. Remains : 525/1043 places, 1661/2520 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s144 s175), p1:(GT 2 s517)], 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 969 reset in 456 ms.
Product exploration explored 100000 steps with 963 reset in 583 ms.
Computed a total of 63 stabilizing places and 100 stable transitions
Computed a total of 63 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 97 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 386831 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 386831 steps, saw 50858 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 22:12:42] [INFO ] Invariant cache hit.
[2023-03-12 22:12:43] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:12:43] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 22:12:43] [INFO ] After 398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:12:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:12:43] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 22:12:43] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 22:12:43] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2023-03-12 22:12:44] [INFO ] After 260ms SMT Verify possible using 1175 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 22:12:44] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-12 22:12:44] [INFO ] After 924ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 525 transition count 1660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 524 transition count 1660
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 1 with 420 rules applied. Total rules applied 422 place count 524 transition count 1660
Applied a total of 422 rules in 71 ms. Remains 524 /525 variables (removed 1) and now considering 1660/1661 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 524/525 places, 1660/1661 transitions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 327297 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 327297 steps, saw 44918 distinct states, run finished after 3002 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1660 rows 524 cols
[2023-03-12 22:12:47] [INFO ] Computed 22 place invariants in 35 ms
[2023-03-12 22:12:47] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-12 22:12:47] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-12 22:12:48] [INFO ] After 578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:12:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-12 22:12:48] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-12 22:12:48] [INFO ] After 374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 22:12:48] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-12 22:12:48] [INFO ] After 260ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 22:12:49] [INFO ] After 416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-12 22:12:49] [INFO ] After 1093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 32 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 524/524 places, 1660/1660 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 27 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2023-03-12 22:12:49] [INFO ] Invariant cache hit.
[2023-03-12 22:12:49] [INFO ] Implicit Places using invariants in 434 ms returned []
[2023-03-12 22:12:49] [INFO ] Invariant cache hit.
[2023-03-12 22:12:50] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-12 22:12:54] [INFO ] Implicit Places using invariants and state equation in 4835 ms returned []
Implicit Place search using SMT with State Equation took 5272 ms to find 0 implicit places.
[2023-03-12 22:12:54] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-12 22:12:54] [INFO ] Invariant cache hit.
[2023-03-12 22:12:55] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5885 ms. Remains : 524/524 places, 1660/1660 transitions.
Graph (trivial) has 1529 edges and 524 vertex of which 437 / 524 are part of one of the 2 SCC in 1 ms
Free SCC test removed 435 places
Drop transitions removed 1153 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 1562 transitions.
Graph (complete) has 220 edges and 89 vertex of which 28 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.1 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 28 transition count 38
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 9 transition count 19
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 9 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 8 transition count 18
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 8 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 8 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 89 place count 7 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 6 transition count 12
Applied a total of 90 rules in 9 ms. Remains 6 /524 variables (removed 518) and now considering 12/1660 (removed 1648) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 12 rows 6 cols
[2023-03-12 22:12:55] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-12 22:12:55] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:12:55] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 22:12:55] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-12 22:12:55] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 188 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 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 35 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
// Phase 1: matrix 1661 rows 525 cols
[2023-03-12 22:12:55] [INFO ] Computed 22 place invariants in 17 ms
[2023-03-12 22:12:55] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-12 22:12:55] [INFO ] Invariant cache hit.
[2023-03-12 22:12:56] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2023-03-12 22:12:57] [INFO ] Implicit Places using invariants and state equation in 1748 ms returned []
Implicit Place search using SMT with State Equation took 1968 ms to find 0 implicit places.
[2023-03-12 22:12:57] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 22:12:57] [INFO ] Invariant cache hit.
[2023-03-12 22:12:58] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2677 ms. Remains : 525/525 places, 1661/1661 transitions.
Computed a total of 63 stabilizing places and 100 stable transitions
Computed a total of 63 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 295 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 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 98 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 391870 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 391870 steps, saw 51501 distinct states, run finished after 3002 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 22:13:01] [INFO ] Invariant cache hit.
[2023-03-12 22:13:01] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:13:01] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-12 22:13:02] [INFO ] After 395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:13:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:13:02] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 22:13:02] [INFO ] After 365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 22:13:02] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2023-03-12 22:13:03] [INFO ] After 333ms SMT Verify possible using 1175 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 22:13:03] [INFO ] After 533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-12 22:13:03] [INFO ] After 1145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 525 transition count 1660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 524 transition count 1660
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 1 with 420 rules applied. Total rules applied 422 place count 524 transition count 1660
Applied a total of 422 rules in 124 ms. Remains 524 /525 variables (removed 1) and now considering 1660/1661 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 524/525 places, 1660/1661 transitions.
Incomplete random walk after 10000 steps, including 103 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 357962 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 357962 steps, saw 48105 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1660 rows 524 cols
[2023-03-12 22:13:06] [INFO ] Computed 22 place invariants in 13 ms
[2023-03-12 22:13:06] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-12 22:13:06] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-12 22:13:07] [INFO ] After 543ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:13:07] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-12 22:13:07] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-12 22:13:07] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 22:13:07] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-12 22:13:08] [INFO ] After 266ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 22:13:08] [INFO ] After 437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-12 22:13:08] [INFO ] After 1049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 45 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 524/524 places, 1660/1660 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 37 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2023-03-12 22:13:08] [INFO ] Invariant cache hit.
[2023-03-12 22:13:08] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-12 22:13:08] [INFO ] Invariant cache hit.
[2023-03-12 22:13:09] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-12 22:13:13] [INFO ] Implicit Places using invariants and state equation in 4790 ms returned []
Implicit Place search using SMT with State Equation took 5245 ms to find 0 implicit places.
[2023-03-12 22:13:13] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-12 22:13:13] [INFO ] Invariant cache hit.
[2023-03-12 22:13:15] [INFO ] Dead Transitions using invariants and state equation in 1747 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7098 ms. Remains : 524/524 places, 1660/1660 transitions.
Graph (trivial) has 1529 edges and 524 vertex of which 437 / 524 are part of one of the 2 SCC in 1 ms
Free SCC test removed 435 places
Drop transitions removed 1153 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 1562 transitions.
Graph (complete) has 220 edges and 89 vertex of which 28 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 28 transition count 38
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 9 transition count 19
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 9 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 8 transition count 18
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 8 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 8 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 89 place count 7 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 6 transition count 12
Applied a total of 90 rules in 5 ms. Remains 6 /524 variables (removed 518) and now considering 12/1660 (removed 1648) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 12 rows 6 cols
[2023-03-12 22:13:15] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 22:13:15] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:13:15] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 22:13:15] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 22:13:15] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 261 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 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 964 reset in 533 ms.
Product exploration explored 100000 steps with 961 reset in 486 ms.
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 20 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
// Phase 1: matrix 1661 rows 525 cols
[2023-03-12 22:13:17] [INFO ] Computed 22 place invariants in 42 ms
[2023-03-12 22:13:17] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-12 22:13:17] [INFO ] Invariant cache hit.
[2023-03-12 22:13:17] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2023-03-12 22:13:19] [INFO ] Implicit Places using invariants and state equation in 1974 ms returned []
Implicit Place search using SMT with State Equation took 2233 ms to find 0 implicit places.
[2023-03-12 22:13:19] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-12 22:13:19] [INFO ] Invariant cache hit.
[2023-03-12 22:13:19] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2799 ms. Remains : 525/525 places, 1661/1661 transitions.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-04 finished in 44855 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 p1)||G((p2 U p1))))'
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 378
Deduced a syphon composed of 378 places in 1 ms
Reduce places removed 378 places and 0 transitions.
Iterating global reduction 3 with 756 rules applied. Total rules applied 1034 place count 526 transition count 2003
Drop transitions removed 340 transitions
Redundant transition composition rules discarded 340 transitions
Iterating global reduction 3 with 340 rules applied. Total rules applied 1374 place count 526 transition count 1663
Applied a total of 1374 rules in 94 ms. Remains 526 /1043 variables (removed 517) and now considering 1663/2520 (removed 857) transitions.
// Phase 1: matrix 1663 rows 526 cols
[2023-03-12 22:13:20] [INFO ] Computed 22 place invariants in 14 ms
[2023-03-12 22:13:20] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-12 22:13:20] [INFO ] Invariant cache hit.
[2023-03-12 22:13:20] [INFO ] State equation strengthened by 1176 read => feed constraints.
[2023-03-12 22:13:22] [INFO ] Implicit Places using invariants and state equation in 1765 ms returned []
Implicit Place search using SMT with State Equation took 2113 ms to find 0 implicit places.
[2023-03-12 22:13:22] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-12 22:13:22] [INFO ] Invariant cache hit.
[2023-03-12 22:13:22] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 526/1043 places, 1663/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2888 ms. Remains : 526/1043 places, 1663/2520 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(OR p1 p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 3 s213), p0:(LEQ s467 s375), p2:(LEQ s46 s422)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-05 finished in 3185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 16 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-12 22:13:23] [INFO ] Computed 22 place invariants in 34 ms
[2023-03-12 22:13:23] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-12 22:13:23] [INFO ] Invariant cache hit.
[2023-03-12 22:13:24] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:13:26] [INFO ] Implicit Places using invariants and state equation in 2737 ms returned []
Implicit Place search using SMT with State Equation took 3113 ms to find 0 implicit places.
[2023-03-12 22:13:26] [INFO ] Invariant cache hit.
[2023-03-12 22:13:27] [INFO ] Dead Transitions using invariants and state equation in 1176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4336 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (OR (GT s517 s842) (GT 1 s780)) (GT s528 s230)), p0:(LEQ 1 s780)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-07 finished in 4546 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)&&(F(p1)||(p2&&G(p3))))))'
Support contains 6 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 22 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-12 22:13:27] [INFO ] Invariant cache hit.
[2023-03-12 22:13:28] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-12 22:13:28] [INFO ] Invariant cache hit.
[2023-03-12 22:13:28] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:13:31] [INFO ] Implicit Places using invariants and state equation in 2998 ms returned []
Implicit Place search using SMT with State Equation took 3357 ms to find 0 implicit places.
[2023-03-12 22:13:31] [INFO ] Invariant cache hit.
[2023-03-12 22:13:32] [INFO ] Dead Transitions using invariants and state equation in 1027 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4422 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s230 s378), p1:(LEQ s7 s94), p2:(LEQ 1 s206), p3:(LEQ 1 s410)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 933 ms.
Product exploration explored 100000 steps with 50000 reset in 801 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X p0), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))
Knowledge based reduction with 8 factoid took 274 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-08 finished in 6676 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)||p1)) U (G((p0 U (p1||G(p0))))||(X(G(p2))&&(p0 U (p1||G(p0)))))))'
Support contains 4 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 0 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1034 place count 526 transition count 2003
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1375 place count 526 transition count 1662
Applied a total of 1375 rules in 106 ms. Remains 526 /1043 variables (removed 517) and now considering 1662/2520 (removed 858) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2023-03-12 22:13:34] [INFO ] Computed 22 place invariants in 27 ms
[2023-03-12 22:13:34] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-12 22:13:34] [INFO ] Invariant cache hit.
[2023-03-12 22:13:35] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-12 22:13:37] [INFO ] Implicit Places using invariants and state equation in 2275 ms returned []
Implicit Place search using SMT with State Equation took 2557 ms to find 0 implicit places.
[2023-03-12 22:13:37] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-12 22:13:37] [INFO ] Invariant cache hit.
[2023-03-12 22:13:37] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 526/1043 places, 1662/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3402 ms. Remains : 526/1043 places, 1662/2520 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 p2) p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(LEQ s464 s326), p0:(GT 3 s345), p1:(AND (GT 2 s83) (GT 3 s345))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 964 reset in 505 ms.
Product exploration explored 100000 steps with 963 reset in 446 ms.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (OR (AND p0 p2) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (OR (AND p0 p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 766 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-12 22:13:40] [INFO ] Invariant cache hit.
[2023-03-12 22:13:40] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-12 22:13:40] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 22:13:40] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 22:13:40] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-12 22:13:40] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-12 22:13:41] [INFO ] After 588ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-12 22:13:41] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-12 22:13:41] [INFO ] After 391ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :2 sat :5
[2023-03-12 22:13:42] [INFO ] After 808ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 225 ms.
[2023-03-12 22:13:42] [INFO ] After 1844ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 526 transition count 1661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 525 transition count 1661
Partial Free-agglomeration rule applied 436 times.
Drop transitions removed 436 transitions
Iterating global reduction 1 with 436 rules applied. Total rules applied 438 place count 525 transition count 1661
Applied a total of 438 rules in 77 ms. Remains 525 /526 variables (removed 1) and now considering 1661/1662 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 525/526 places, 1661/1662 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 200692 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200692 steps, saw 29608 distinct states, run finished after 3013 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1661 rows 525 cols
[2023-03-12 22:13:45] [INFO ] Computed 22 place invariants in 13 ms
[2023-03-12 22:13:45] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:13:45] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-12 22:13:45] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 22:13:46] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:13:46] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-12 22:13:46] [INFO ] After 508ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 22:13:46] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-12 22:13:47] [INFO ] After 429ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 22:13:47] [INFO ] After 804ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 232 ms.
[2023-03-12 22:13:47] [INFO ] After 1744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 40 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 525/525 places, 1661/1661 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 54 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
[2023-03-12 22:13:47] [INFO ] Invariant cache hit.
[2023-03-12 22:13:48] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-12 22:13:48] [INFO ] Invariant cache hit.
[2023-03-12 22:13:48] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-12 22:13:52] [INFO ] Implicit Places using invariants and state equation in 4064 ms returned []
Implicit Place search using SMT with State Equation took 4503 ms to find 0 implicit places.
[2023-03-12 22:13:52] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-12 22:13:52] [INFO ] Invariant cache hit.
[2023-03-12 22:13:53] [INFO ] Dead Transitions using invariants and state equation in 1139 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5756 ms. Remains : 525/525 places, 1661/1661 transitions.
Graph (trivial) has 1530 edges and 525 vertex of which 437 / 525 are part of one of the 2 SCC in 1 ms
Free SCC test removed 435 places
Drop transitions removed 1154 transitions
Ensure Unique test removed 407 transitions
Reduce isomorphic transitions removed 1561 transitions.
Graph (complete) has 222 edges and 90 vertex of which 29 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 29 transition count 40
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 60 place count 11 transition count 22
Iterating global reduction 1 with 18 rules applied. Total rules applied 78 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 1 with 2 rules applied. Total rules applied 80 place count 10 transition count 21
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 10 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 9 transition count 17
Applied a total of 84 rules in 5 ms. Remains 9 /525 variables (removed 516) and now considering 17/1661 (removed 1644) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 17 rows 9 cols
[2023-03-12 22:13:53] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 22:13:53] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 22:13:53] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 22:13:53] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-12 22:13:53] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (OR (AND p0 p2) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (OR (AND p0 p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (NOT (AND (NOT p2) p0 (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 19 factoid took 1114 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 25 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2023-03-12 22:13:55] [INFO ] Computed 22 place invariants in 28 ms
[2023-03-12 22:13:55] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-12 22:13:55] [INFO ] Invariant cache hit.
[2023-03-12 22:13:55] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-12 22:13:57] [INFO ] Implicit Places using invariants and state equation in 2369 ms returned []
Implicit Place search using SMT with State Equation took 2655 ms to find 0 implicit places.
[2023-03-12 22:13:57] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-12 22:13:57] [INFO ] Invariant cache hit.
[2023-03-12 22:13:58] [INFO ] Dead Transitions using invariants and state equation in 793 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3502 ms. Remains : 526/526 places, 1662/1662 transitions.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 346 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 95 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 22:13:59] [INFO ] Invariant cache hit.
[2023-03-12 22:13:59] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:13:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:13:59] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-12 22:13:59] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:13:59] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-12 22:14:00] [INFO ] After 276ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 22:14:00] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-12 22:14:00] [INFO ] After 1121ms 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 3 ms.
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 526 transition count 1661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 525 transition count 1661
Partial Free-agglomeration rule applied 436 times.
Drop transitions removed 436 transitions
Iterating global reduction 1 with 436 rules applied. Total rules applied 438 place count 525 transition count 1661
Applied a total of 438 rules in 71 ms. Remains 525 /526 variables (removed 1) and now considering 1661/1662 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 525/526 places, 1661/1662 transitions.
Incomplete random walk after 10000 steps, including 107 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 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 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 309942 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 309942 steps, saw 42215 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1661 rows 525 cols
[2023-03-12 22:14:03] [INFO ] Computed 22 place invariants in 12 ms
[2023-03-12 22:14:03] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:14:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-12 22:14:04] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 22:14:04] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:14:04] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-12 22:14:04] [INFO ] After 297ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 22:14:04] [INFO ] After 542ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-12 22:14:05] [INFO ] After 1165ms 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 6 ms.
Support contains 4 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 22 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 525/525 places, 1661/1661 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 36 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
[2023-03-12 22:14:05] [INFO ] Invariant cache hit.
[2023-03-12 22:14:05] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-12 22:14:05] [INFO ] Invariant cache hit.
[2023-03-12 22:14:05] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-12 22:14:10] [INFO ] Implicit Places using invariants and state equation in 4556 ms returned []
Implicit Place search using SMT with State Equation took 5005 ms to find 0 implicit places.
[2023-03-12 22:14:10] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-12 22:14:10] [INFO ] Invariant cache hit.
[2023-03-12 22:14:11] [INFO ] Dead Transitions using invariants and state equation in 800 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5889 ms. Remains : 525/525 places, 1661/1661 transitions.
Graph (trivial) has 1530 edges and 525 vertex of which 437 / 525 are part of one of the 2 SCC in 0 ms
Free SCC test removed 435 places
Drop transitions removed 1154 transitions
Ensure Unique test removed 407 transitions
Reduce isomorphic transitions removed 1561 transitions.
Graph (complete) has 222 edges and 90 vertex of which 29 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 29 transition count 40
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 60 place count 11 transition count 22
Iterating global reduction 1 with 18 rules applied. Total rules applied 78 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 1 with 2 rules applied. Total rules applied 80 place count 10 transition count 21
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 10 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 9 transition count 17
Applied a total of 84 rules in 7 ms. Remains 9 /525 variables (removed 516) and now considering 17/1661 (removed 1644) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 17 rows 9 cols
[2023-03-12 22:14:11] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 22:14:11] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:14:11] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:14:11] [INFO ] After 12ms 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-12 22:14:11] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 9 factoid took 320 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 167 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 962 reset in 464 ms.
Product exploration explored 100000 steps with 967 reset in 580 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 143 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 22 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2023-03-12 22:14:13] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 1662 rows 526 cols
[2023-03-12 22:14:13] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-12 22:14:13] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 717 ms. Remains : 526/526 places, 1662/1662 transitions.
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 10 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2023-03-12 22:14:13] [INFO ] Invariant cache hit.
[2023-03-12 22:14:14] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-12 22:14:14] [INFO ] Invariant cache hit.
[2023-03-12 22:14:14] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-12 22:14:15] [INFO ] Implicit Places using invariants and state equation in 1788 ms returned []
Implicit Place search using SMT with State Equation took 2054 ms to find 0 implicit places.
[2023-03-12 22:14:15] [INFO ] Invariant cache hit.
[2023-03-12 22:14:16] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2693 ms. Remains : 526/526 places, 1662/1662 transitions.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-09 finished in 42237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G((G(F(p1)) U p2))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 18 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-12 22:14:16] [INFO ] Computed 22 place invariants in 36 ms
[2023-03-12 22:14:17] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-12 22:14:17] [INFO ] Invariant cache hit.
[2023-03-12 22:14:17] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:14:19] [INFO ] Implicit Places using invariants and state equation in 2716 ms returned []
Implicit Place search using SMT with State Equation took 3045 ms to find 0 implicit places.
[2023-03-12 22:14:19] [INFO ] Invariant cache hit.
[2023-03-12 22:14:20] [INFO ] Dead Transitions using invariants and state equation in 1161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4235 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p2)), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ 1 s444), p0:(GT 3 s857), p1:(GT 1 s33)], 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33238 reset in 728 ms.
Product exploration explored 100000 steps with 33337 reset in 756 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Detected a total of 82/1043 stabilizing places and 140/2520 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 18 factoid took 1113 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) 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 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
Running SMT prover for 3 properties.
[2023-03-12 22:14:24] [INFO ] Invariant cache hit.
[2023-03-12 22:14:24] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2023-03-12 22:14:24] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-12 22:14:25] [INFO ] After 669ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-12 22:14:25] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:14:25] [INFO ] After 282ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-12 22:14:25] [INFO ] After 1277ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-12 22:14:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-12 22:14:25] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-12 22:14:26] [INFO ] After 606ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-12 22:14:26] [INFO ] After 572ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-12 22:14:27] [INFO ] After 758ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-12 22:14:27] [INFO ] After 1657ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1038 place count 524 transition count 2001
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1379 place count 524 transition count 1660
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1380 place count 524 transition count 1659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1381 place count 523 transition count 1659
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 3 with 420 rules applied. Total rules applied 1801 place count 523 transition count 1659
Applied a total of 1801 rules in 159 ms. Remains 523 /1043 variables (removed 520) and now considering 1659/2520 (removed 861) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 523/1043 places, 1659/2520 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 370103 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 370103 steps, saw 49067 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1659 rows 523 cols
[2023-03-12 22:14:30] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-12 22:14:30] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-12 22:14:30] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-12 22:14:31] [INFO ] After 404ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-12 22:14:31] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-12 22:14:31] [INFO ] After 230ms SMT Verify possible using 1596 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:14:31] [INFO ] After 811ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:14:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-12 22:14:31] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 22:14:31] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 22:14:32] [INFO ] After 221ms SMT Verify possible using 1596 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 22:14:32] [INFO ] After 353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-12 22:14:32] [INFO ] After 913ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 21 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 523/523 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 21 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-12 22:14:32] [INFO ] Invariant cache hit.
[2023-03-12 22:14:32] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-12 22:14:32] [INFO ] Invariant cache hit.
[2023-03-12 22:14:33] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-12 22:14:37] [INFO ] Implicit Places using invariants and state equation in 4200 ms returned []
Implicit Place search using SMT with State Equation took 4618 ms to find 0 implicit places.
[2023-03-12 22:14:37] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-12 22:14:37] [INFO ] Invariant cache hit.
[2023-03-12 22:14:37] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5252 ms. Remains : 523/523 places, 1659/1659 transitions.
Graph (trivial) has 1532 edges and 523 vertex of which 438 / 523 are part of one of the 2 SCC in 0 ms
Free SCC test removed 436 places
Drop transitions removed 1155 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1567 transitions.
Graph (complete) has 214 edges and 87 vertex of which 26 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 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 42 rules applied. Total rules applied 44 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 25 transition count 31
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 7 transition count 13
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 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 83 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 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 86 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 87 place count 5 transition count 8
Applied a total of 87 rules in 6 ms. Remains 5 /523 variables (removed 518) and now considering 8/1659 (removed 1651) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 22:14:37] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 22:14:37] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:14:37] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 22:14:37] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 22:14:37] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F p2)]
Knowledge based reduction with 19 factoid took 1045 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 251 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 17 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-12 22:14:39] [INFO ] Computed 22 place invariants in 40 ms
[2023-03-12 22:14:39] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-12 22:14:39] [INFO ] Invariant cache hit.
[2023-03-12 22:14:40] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:14:42] [INFO ] Implicit Places using invariants and state equation in 2652 ms returned []
Implicit Place search using SMT with State Equation took 3078 ms to find 0 implicit places.
[2023-03-12 22:14:42] [INFO ] Invariant cache hit.
[2023-03-12 22:14:43] [INFO ] Dead Transitions using invariants and state equation in 1006 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4114 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Detected a total of 82/1043 stabilizing places and 140/2520 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 480 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 21 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 22:14:44] [INFO ] Invariant cache hit.
[2023-03-12 22:14:44] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-12 22:14:44] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-12 22:14:45] [INFO ] After 671ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-12 22:14:45] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:14:45] [INFO ] After 339ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:14:45] [INFO ] After 1243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:14:45] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-12 22:14:45] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-12 22:14:46] [INFO ] After 583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 22:14:46] [INFO ] After 607ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 22:14:47] [INFO ] After 800ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-12 22:14:47] [INFO ] After 1690ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 0 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1038 place count 524 transition count 2001
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1379 place count 524 transition count 1660
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1380 place count 524 transition count 1659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1381 place count 523 transition count 1659
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 3 with 420 rules applied. Total rules applied 1801 place count 523 transition count 1659
Applied a total of 1801 rules in 169 ms. Remains 523 /1043 variables (removed 520) and now considering 1659/2520 (removed 861) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 523/1043 places, 1659/2520 transitions.
Incomplete random walk after 10000 steps, including 104 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 394477 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 394477 steps, saw 51916 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1659 rows 523 cols
[2023-03-12 22:14:50] [INFO ] Computed 22 place invariants in 12 ms
[2023-03-12 22:14:50] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:14:50] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 22:14:51] [INFO ] After 344ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-12 22:14:51] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-12 22:14:51] [INFO ] After 235ms SMT Verify possible using 1596 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:14:51] [INFO ] After 710ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:14:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-12 22:14:51] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 22:14:51] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 22:14:51] [INFO ] After 220ms SMT Verify possible using 1596 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 22:14:52] [INFO ] After 332ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-12 22:14:52] [INFO ] After 870ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 20 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 523/523 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 20 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-12 22:14:52] [INFO ] Invariant cache hit.
[2023-03-12 22:14:52] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-12 22:14:52] [INFO ] Invariant cache hit.
[2023-03-12 22:14:52] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-12 22:14:56] [INFO ] Implicit Places using invariants and state equation in 3968 ms returned []
Implicit Place search using SMT with State Equation took 4339 ms to find 0 implicit places.
[2023-03-12 22:14:56] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-12 22:14:56] [INFO ] Invariant cache hit.
[2023-03-12 22:14:57] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4925 ms. Remains : 523/523 places, 1659/1659 transitions.
Graph (trivial) has 1532 edges and 523 vertex of which 438 / 523 are part of one of the 2 SCC in 0 ms
Free SCC test removed 436 places
Drop transitions removed 1155 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1567 transitions.
Graph (complete) has 214 edges and 87 vertex of which 26 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 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 42 rules applied. Total rules applied 44 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 25 transition count 31
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 7 transition count 13
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 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 83 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 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 86 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 87 place count 5 transition count 8
Applied a total of 87 rules in 4 ms. Remains 5 /523 variables (removed 518) and now considering 8/1659 (removed 1651) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 22:14:57] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 22:14:57] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:14:57] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 22:14:57] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 22:14:57] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F p2), (F (AND (NOT p1) (NOT p2))), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 539 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 256 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 217 reset in 321 ms.
Product exploration explored 100000 steps with 216 reset in 336 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1043 transition count 2520
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 99 place count 1043 transition count 2520
Deduced a syphon composed of 119 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 119 place count 1043 transition count 2520
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 159 place count 1003 transition count 2480
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 199 place count 1003 transition count 2480
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: -718
Deduced a syphon composed of 477 places in 0 ms
Iterating global reduction 1 with 398 rules applied. Total rules applied 597 place count 1003 transition count 3198
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 675 place count 925 transition count 3120
Deduced a syphon composed of 399 places in 1 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 753 place count 925 transition count 3120
Deduced a syphon composed of 399 places in 0 ms
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 1 with 341 rules applied. Total rules applied 1094 place count 925 transition count 2779
Deduced a syphon composed of 399 places in 1 ms
Applied a total of 1094 rules in 199 ms. Remains 925 /1043 variables (removed 118) and now considering 2779/2520 (removed -259) transitions.
[2023-03-12 22:14:59] [INFO ] Redundant transitions in 54 ms returned []
// Phase 1: matrix 2779 rows 925 cols
[2023-03-12 22:14:59] [INFO ] Computed 22 place invariants in 29 ms
[2023-03-12 22:15:00] [INFO ] Dead Transitions using invariants and state equation in 985 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 925/1043 places, 2779/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1273 ms. Remains : 925/1043 places, 2779/2520 transitions.
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 17 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-12 22:15:00] [INFO ] Computed 22 place invariants in 26 ms
[2023-03-12 22:15:01] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-12 22:15:01] [INFO ] Invariant cache hit.
[2023-03-12 22:15:01] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:15:03] [INFO ] Implicit Places using invariants and state equation in 2622 ms returned []
Implicit Place search using SMT with State Equation took 3069 ms to find 0 implicit places.
[2023-03-12 22:15:03] [INFO ] Invariant cache hit.
[2023-03-12 22:15:04] [INFO ] Dead Transitions using invariants and state equation in 982 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4082 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-11 finished in 48256 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(p0)))||G(p1)))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 17 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-12 22:15:04] [INFO ] Invariant cache hit.
[2023-03-12 22:15:05] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-12 22:15:05] [INFO ] Invariant cache hit.
[2023-03-12 22:15:05] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:15:07] [INFO ] Implicit Places using invariants and state equation in 2740 ms returned []
Implicit Place search using SMT with State Equation took 3039 ms to find 0 implicit places.
[2023-03-12 22:15:08] [INFO ] Invariant cache hit.
[2023-03-12 22:15:09] [INFO ] Dead Transitions using invariants and state equation in 1023 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4092 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=p1, acceptance={} source=7 dest: 4}, { cond=(NOT p1), acceptance={} source=7 dest: 6}], [{ cond=(NOT p1), acceptance={} source=8 dest: 5}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=7, aps=[p0:(GT s787 s724), p1:(OR (GT s787 s724) (GT 1 s709))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 79 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-12 finished in 4364 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 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 18 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-12 22:15:09] [INFO ] Invariant cache hit.
[2023-03-12 22:15:09] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-12 22:15:09] [INFO ] Invariant cache hit.
[2023-03-12 22:15:10] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:15:12] [INFO ] Implicit Places using invariants and state equation in 3028 ms returned []
Implicit Place search using SMT with State Equation took 3327 ms to find 0 implicit places.
[2023-03-12 22:15:12] [INFO ] Invariant cache hit.
[2023-03-12 22:15:13] [INFO ] Dead Transitions using invariants and state equation in 981 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4349 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-13 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:(LEQ 2 s716)], 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]]
Stuttering criterion allowed to conclude after 468 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-13 finished in 4474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-020-LTLCardinality-02
Stuttering acceptance computed with spot in 62 ms :[true, p0, p0]
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 1 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 998 place count 544 transition count 2021
Drop transitions removed 324 transitions
Redundant transition composition rules discarded 324 transitions
Iterating global reduction 3 with 324 rules applied. Total rules applied 1322 place count 544 transition count 1697
Partial Post-agglomeration rule applied 38 times.
Drop transitions removed 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 1360 place count 544 transition count 1697
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1378 place count 526 transition count 1679
Iterating global reduction 3 with 18 rules applied. Total rules applied 1396 place count 526 transition count 1679
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 1414 place count 526 transition count 1661
Applied a total of 1414 rules in 144 ms. Remains 526 /1043 variables (removed 517) and now considering 1661/2520 (removed 859) transitions.
// Phase 1: matrix 1661 rows 526 cols
[2023-03-12 22:15:14] [INFO ] Computed 22 place invariants in 11 ms
[2023-03-12 22:15:14] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-12 22:15:14] [INFO ] Invariant cache hit.
[2023-03-12 22:15:14] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-12 22:15:15] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned []
Implicit Place search using SMT with State Equation took 1922 ms to find 0 implicit places.
[2023-03-12 22:15:15] [INFO ] Invariant cache hit.
[2023-03-12 22:15:16] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 526/1043 places, 1661/2520 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2632 ms. Remains : 526/1043 places, 1661/2520 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 3 s111) (LEQ 3 s5))], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 944 reset in 401 ms.
Product exploration explored 100000 steps with 939 reset in 405 ms.
Computed a total of 60 stabilizing places and 99 stable transitions
Computed a total of 60 stabilizing places and 99 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 220 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 59 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 412222 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 412222 steps, saw 60455 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 22:15:20] [INFO ] Invariant cache hit.
[2023-03-12 22:15:20] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:15:20] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-12 22:15:21] [INFO ] After 393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:15:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:15:21] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 22:15:21] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:15:21] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-12 22:15:21] [INFO ] After 176ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 22:15:21] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-12 22:15:21] [INFO ] After 697ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 526 transition count 1659
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 524 transition count 1659
Partial Free-agglomeration rule applied 421 times.
Drop transitions removed 421 transitions
Iterating global reduction 1 with 421 rules applied. Total rules applied 425 place count 524 transition count 1659
Applied a total of 425 rules in 73 ms. Remains 524 /526 variables (removed 2) and now considering 1659/1661 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 524/526 places, 1659/1661 transitions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 390404 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 390404 steps, saw 55242 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1659 rows 524 cols
[2023-03-12 22:15:24] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-12 22:15:25] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-12 22:15:25] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-12 22:15:25] [INFO ] After 455ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:15:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-12 22:15:25] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-12 22:15:25] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:15:25] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2023-03-12 22:15:25] [INFO ] After 193ms SMT Verify possible using 1577 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 22:15:26] [INFO ] After 256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-12 22:15:26] [INFO ] After 721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 20 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 524/524 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 20 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-12 22:15:26] [INFO ] Invariant cache hit.
[2023-03-12 22:15:26] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-12 22:15:26] [INFO ] Invariant cache hit.
[2023-03-12 22:15:26] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2023-03-12 22:15:30] [INFO ] Implicit Places using invariants and state equation in 3959 ms returned []
Implicit Place search using SMT with State Equation took 4388 ms to find 0 implicit places.
[2023-03-12 22:15:30] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-12 22:15:30] [INFO ] Invariant cache hit.
[2023-03-12 22:15:31] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5013 ms. Remains : 524/524 places, 1659/1659 transitions.
Graph (trivial) has 1519 edges and 524 vertex of which 418 / 524 are part of one of the 2 SCC in 0 ms
Free SCC test removed 416 places
Drop transitions removed 1084 transitions
Ensure Unique test removed 408 transitions
Reduce isomorphic transitions removed 1492 transitions.
Graph (complete) has 291 edges and 108 vertex of which 50 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.0 ms
Discarding 58 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 50 transition count 91
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 95 place count 16 transition count 40
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 16 transition count 40
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 146 place count 16 transition count 23
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 148 place count 15 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 150 place count 14 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 14 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 13 transition count 18
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 10 transition count 15
Applied a total of 158 rules in 8 ms. Remains 10 /524 variables (removed 514) and now considering 15/1659 (removed 1644) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2023-03-12 22:15:31] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 22:15:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 22:15:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 22:15:31] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:15:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 22:15:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 22:15:31] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:15:31] [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-12 22:15:31] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 61 ms :[true, p0, p0]
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Applied a total of 0 rules in 15 ms. Remains 526 /526 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
// Phase 1: matrix 1661 rows 526 cols
[2023-03-12 22:15:31] [INFO ] Computed 22 place invariants in 11 ms
[2023-03-12 22:15:31] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-12 22:15:31] [INFO ] Invariant cache hit.
[2023-03-12 22:15:32] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-12 22:15:33] [INFO ] Implicit Places using invariants and state equation in 1933 ms returned []
Implicit Place search using SMT with State Equation took 2135 ms to find 0 implicit places.
[2023-03-12 22:15:33] [INFO ] Invariant cache hit.
[2023-03-12 22:15:34] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2773 ms. Remains : 526/526 places, 1661/1661 transitions.
Computed a total of 60 stabilizing places and 99 stable transitions
Computed a total of 60 stabilizing places and 99 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 61 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 93 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 413833 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 413833 steps, saw 60701 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 22:15:37] [INFO ] Invariant cache hit.
[2023-03-12 22:15:37] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-12 22:15:37] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-12 22:15:37] [INFO ] After 417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:15:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:15:38] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 22:15:38] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:15:38] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-12 22:15:38] [INFO ] After 175ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 22:15:38] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-12 22:15:38] [INFO ] After 658ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 526 transition count 1659
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 524 transition count 1659
Partial Free-agglomeration rule applied 421 times.
Drop transitions removed 421 transitions
Iterating global reduction 1 with 421 rules applied. Total rules applied 425 place count 524 transition count 1659
Applied a total of 425 rules in 65 ms. Remains 524 /526 variables (removed 2) and now considering 1659/1661 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 524/526 places, 1659/1661 transitions.
Incomplete random walk after 10000 steps, including 104 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 385126 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 385126 steps, saw 54551 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1659 rows 524 cols
[2023-03-12 22:15:41] [INFO ] Computed 22 place invariants in 11 ms
[2023-03-12 22:15:41] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:15:41] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 22:15:42] [INFO ] After 435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:15:42] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:15:42] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 22:15:42] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:15:42] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2023-03-12 22:15:42] [INFO ] After 188ms SMT Verify possible using 1577 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 22:15:42] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-12 22:15:42] [INFO ] After 733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 22 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 524/524 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 21 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-12 22:15:42] [INFO ] Invariant cache hit.
[2023-03-12 22:15:43] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-12 22:15:43] [INFO ] Invariant cache hit.
[2023-03-12 22:15:43] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2023-03-12 22:15:47] [INFO ] Implicit Places using invariants and state equation in 4364 ms returned []
Implicit Place search using SMT with State Equation took 4723 ms to find 0 implicit places.
[2023-03-12 22:15:47] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-12 22:15:47] [INFO ] Invariant cache hit.
[2023-03-12 22:15:48] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5390 ms. Remains : 524/524 places, 1659/1659 transitions.
Graph (trivial) has 1519 edges and 524 vertex of which 418 / 524 are part of one of the 2 SCC in 1 ms
Free SCC test removed 416 places
Drop transitions removed 1084 transitions
Ensure Unique test removed 408 transitions
Reduce isomorphic transitions removed 1492 transitions.
Graph (complete) has 291 edges and 108 vertex of which 50 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.0 ms
Discarding 58 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 50 transition count 91
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 95 place count 16 transition count 40
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 16 transition count 40
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 146 place count 16 transition count 23
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 148 place count 15 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 150 place count 14 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 14 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 13 transition count 18
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 10 transition count 15
Applied a total of 158 rules in 4 ms. Remains 10 /524 variables (removed 514) and now considering 15/1659 (removed 1644) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2023-03-12 22:15:48] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 22:15:48] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 22:15:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 22:15:48] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:15:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 22:15:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 22:15:48] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:15:48] [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-12 22:15:48] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 65 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 65 ms :[true, p0, p0]
Product exploration explored 100000 steps with 949 reset in 393 ms.
Product exploration explored 100000 steps with 944 reset in 428 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 74 ms :[true, p0, p0]
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Applied a total of 0 rules in 20 ms. Remains 526 /526 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
[2023-03-12 22:15:49] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 1661 rows 526 cols
[2023-03-12 22:15:49] [INFO ] Computed 22 place invariants in 12 ms
[2023-03-12 22:15:50] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 698 ms. Remains : 526/526 places, 1661/1661 transitions.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Applied a total of 0 rules in 10 ms. Remains 526 /526 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
[2023-03-12 22:15:50] [INFO ] Invariant cache hit.
[2023-03-12 22:15:50] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-12 22:15:50] [INFO ] Invariant cache hit.
[2023-03-12 22:15:51] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-12 22:15:52] [INFO ] Implicit Places using invariants and state equation in 1791 ms returned []
Implicit Place search using SMT with State Equation took 2040 ms to find 0 implicit places.
[2023-03-12 22:15:52] [INFO ] Invariant cache hit.
[2023-03-12 22:15:53] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2598 ms. Remains : 526/526 places, 1661/1661 transitions.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-02 finished in 39346 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)||G(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' '!(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X(G(p2))&&(p0 U (p1||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(G(p0))||G((G(F(p1)) U p2))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-020-LTLCardinality-11
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p2)), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 1043 transition count 2383
Reduce places removed 137 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 138 rules applied. Total rules applied 275 place count 906 transition count 2382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 0 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 3 with 758 rules applied. Total rules applied 1034 place count 526 transition count 2003
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 3 with 341 rules applied. Total rules applied 1375 place count 526 transition count 1662
Applied a total of 1375 rules in 116 ms. Remains 526 /1043 variables (removed 517) and now considering 1662/2520 (removed 858) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2023-03-12 22:15:53] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-12 22:15:54] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-12 22:15:54] [INFO ] Invariant cache hit.
[2023-03-12 22:15:54] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-12 22:15:56] [INFO ] Implicit Places using invariants and state equation in 1866 ms returned []
Implicit Place search using SMT with State Equation took 2253 ms to find 0 implicit places.
[2023-03-12 22:15:56] [INFO ] Invariant cache hit.
[2023-03-12 22:15:56] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 526/1043 places, 1662/2520 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2932 ms. Remains : 526/1043 places, 1662/2520 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ 1 s210), p0:(GT 3 s428), p1:(GT 1 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33452 reset in 602 ms.
Product exploration explored 100000 steps with 33356 reset in 559 ms.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Detected a total of 65/526 stabilizing places and 102/1662 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 18 factoid took 824 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 95 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 22:15:59] [INFO ] Invariant cache hit.
[2023-03-12 22:15:59] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:15:59] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 15 ms returned sat
[2023-03-12 22:15:59] [INFO ] After 357ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-12 22:15:59] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-12 22:15:59] [INFO ] After 167ms SMT Verify possible using 1177 Read/Feed constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-12 22:15:59] [INFO ] After 674ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-12 22:15:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-12 22:15:59] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 22:16:00] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-12 22:16:00] [INFO ] After 220ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-12 22:16:00] [INFO ] After 329ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-12 22:16:00] [INFO ] After 826ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 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 526 transition count 1660
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 524 transition count 1660
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 524 transition count 1659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 523 transition count 1659
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 3 with 420 rules applied. Total rules applied 426 place count 523 transition count 1659
Applied a total of 426 rules in 63 ms. Remains 523 /526 variables (removed 3) and now considering 1659/1662 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 523/526 places, 1659/1662 transitions.
Incomplete random walk after 10000 steps, including 104 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 395904 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 395904 steps, saw 52081 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1659 rows 523 cols
[2023-03-12 22:16:03] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-12 22:16:03] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:16:03] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 22:16:04] [INFO ] After 377ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-12 22:16:04] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-12 22:16:04] [INFO ] After 210ms SMT Verify possible using 1596 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:16:04] [INFO ] After 702ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:16:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:16:04] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 22:16:04] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 22:16:05] [INFO ] After 216ms SMT Verify possible using 1596 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 22:16:05] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-12 22:16:05] [INFO ] After 862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 21 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 523/523 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 21 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-12 22:16:05] [INFO ] Invariant cache hit.
[2023-03-12 22:16:05] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-12 22:16:05] [INFO ] Invariant cache hit.
[2023-03-12 22:16:06] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-12 22:16:09] [INFO ] Implicit Places using invariants and state equation in 4180 ms returned []
Implicit Place search using SMT with State Equation took 4536 ms to find 0 implicit places.
[2023-03-12 22:16:09] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-12 22:16:09] [INFO ] Invariant cache hit.
[2023-03-12 22:16:10] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5139 ms. Remains : 523/523 places, 1659/1659 transitions.
Graph (trivial) has 1532 edges and 523 vertex of which 438 / 523 are part of one of the 2 SCC in 0 ms
Free SCC test removed 436 places
Drop transitions removed 1155 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1567 transitions.
Graph (complete) has 214 edges and 87 vertex of which 26 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 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 42 rules applied. Total rules applied 44 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 25 transition count 31
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 7 transition count 13
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 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 83 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 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 86 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 87 place count 5 transition count 8
Applied a total of 87 rules in 7 ms. Remains 5 /523 variables (removed 518) and now considering 8/1659 (removed 1651) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 22:16:10] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 22:16:10] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:16:10] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 22:16:10] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 22:16:10] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F p2)]
Knowledge based reduction with 19 factoid took 821 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 294 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Support contains 3 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 10 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2023-03-12 22:16:11] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-12 22:16:12] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-12 22:16:12] [INFO ] Invariant cache hit.
[2023-03-12 22:16:12] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-12 22:16:14] [INFO ] Implicit Places using invariants and state equation in 1786 ms returned []
Implicit Place search using SMT with State Equation took 2042 ms to find 0 implicit places.
[2023-03-12 22:16:14] [INFO ] Invariant cache hit.
[2023-03-12 22:16:14] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2622 ms. Remains : 526/526 places, 1662/1662 transitions.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Detected a total of 65/526 stabilizing places and 102/1662 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 339 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 95 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 22:16:15] [INFO ] Invariant cache hit.
[2023-03-12 22:16:15] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-12 22:16:15] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 22:16:15] [INFO ] After 361ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-12 22:16:15] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-12 22:16:15] [INFO ] After 167ms SMT Verify possible using 1177 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:16:15] [INFO ] After 668ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:16:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:16:15] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 22:16:16] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 22:16:16] [INFO ] After 222ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 22:16:16] [INFO ] After 326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-12 22:16:16] [INFO ] After 802ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 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 526 transition count 1660
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 524 transition count 1660
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 524 transition count 1659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 523 transition count 1659
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 3 with 420 rules applied. Total rules applied 426 place count 523 transition count 1659
Applied a total of 426 rules in 62 ms. Remains 523 /526 variables (removed 3) and now considering 1659/1662 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 523/526 places, 1659/1662 transitions.
Incomplete random walk after 10000 steps, including 108 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 390868 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 390868 steps, saw 51474 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1659 rows 523 cols
[2023-03-12 22:16:19] [INFO ] Computed 22 place invariants in 11 ms
[2023-03-12 22:16:20] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:16:20] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-12 22:16:20] [INFO ] After 359ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-12 22:16:20] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-12 22:16:20] [INFO ] After 211ms SMT Verify possible using 1596 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:16:20] [INFO ] After 693ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:16:20] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:16:20] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 22:16:21] [INFO ] After 370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 22:16:21] [INFO ] After 258ms SMT Verify possible using 1596 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 22:16:21] [INFO ] After 372ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-12 22:16:21] [INFO ] After 940ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 21 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 523/523 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 22 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-12 22:16:21] [INFO ] Invariant cache hit.
[2023-03-12 22:16:22] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-03-12 22:16:22] [INFO ] Invariant cache hit.
[2023-03-12 22:16:22] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-12 22:16:26] [INFO ] Implicit Places using invariants and state equation in 4193 ms returned []
Implicit Place search using SMT with State Equation took 4670 ms to find 0 implicit places.
[2023-03-12 22:16:26] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-12 22:16:26] [INFO ] Invariant cache hit.
[2023-03-12 22:16:27] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5386 ms. Remains : 523/523 places, 1659/1659 transitions.
Graph (trivial) has 1532 edges and 523 vertex of which 438 / 523 are part of one of the 2 SCC in 1 ms
Free SCC test removed 436 places
Drop transitions removed 1155 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1567 transitions.
Graph (complete) has 214 edges and 87 vertex of which 26 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 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 42 rules applied. Total rules applied 44 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 25 transition count 31
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 7 transition count 13
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 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 83 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 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 86 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 87 place count 5 transition count 8
Applied a total of 87 rules in 3 ms. Remains 5 /523 variables (removed 518) and now considering 8/1659 (removed 1651) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 22:16:27] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 22:16:27] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 22:16:27] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 22:16:27] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 22:16:27] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F p2), (F (AND (NOT p1) (NOT p2))), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 644 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 959 reset in 395 ms.
Product exploration explored 100000 steps with 966 reset in 414 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Support contains 3 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 26 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2023-03-12 22:16:29] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 1662 rows 526 cols
[2023-03-12 22:16:29] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-12 22:16:30] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 622 ms. Remains : 526/526 places, 1662/1662 transitions.
Support contains 3 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 8 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2023-03-12 22:16:30] [INFO ] Invariant cache hit.
[2023-03-12 22:16:30] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-12 22:16:30] [INFO ] Invariant cache hit.
[2023-03-12 22:16:30] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-12 22:16:32] [INFO ] Implicit Places using invariants and state equation in 1682 ms returned []
Implicit Place search using SMT with State Equation took 1888 ms to find 0 implicit places.
[2023-03-12 22:16:32] [INFO ] Invariant cache hit.
[2023-03-12 22:16:32] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2457 ms. Remains : 526/526 places, 1662/1662 transitions.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-11 finished in 39352 ms.
[2023-03-12 22:16:32] [INFO ] Flatten gal took : 96 ms
[2023-03-12 22:16:32] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 22:16:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1043 places, 2520 transitions and 6760 arcs took 26 ms.
Total runtime 320685 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2974/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2974/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2974/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2974/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CANInsertWithFailure-PT-020-LTLCardinality-02
Could not compute solution for formula : CANInsertWithFailure-PT-020-LTLCardinality-04
Could not compute solution for formula : CANInsertWithFailure-PT-020-LTLCardinality-09
Could not compute solution for formula : CANInsertWithFailure-PT-020-LTLCardinality-11

BK_STOP 1678659396590

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x560cf06913f4]
1: pnml2lts-mc(+0xa2496) [0x560cf0691496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f9741094140]
3: pnml2lts-mc(+0x405be5) [0x560cf09f4be5]
4: pnml2lts-mc(+0x16b3f9) [0x560cf075a3f9]
5: pnml2lts-mc(+0x164ac4) [0x560cf0753ac4]
6: pnml2lts-mc(+0x272e0a) [0x560cf0861e0a]
7: pnml2lts-mc(+0xb61f0) [0x560cf06a51f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f9740ee74d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f9740ee767a]
10: pnml2lts-mc(+0xa1581) [0x560cf0690581]
11: pnml2lts-mc(+0xa1910) [0x560cf0690910]
12: pnml2lts-mc(+0xa32a2) [0x560cf06922a2]
13: pnml2lts-mc(+0xa50f4) [0x560cf06940f4]
14: pnml2lts-mc(+0xa516b) [0x560cf069416b]
15: pnml2lts-mc(+0x3f34b3) [0x560cf09e24b3]
16: pnml2lts-mc(+0x7c63d) [0x560cf066b63d]
17: pnml2lts-mc(+0x67d86) [0x560cf0656d86]
18: pnml2lts-mc(+0x60a8a) [0x560cf064fa8a]
19: pnml2lts-mc(+0x5eb15) [0x560cf064db15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f9740ecfd0a]
21: pnml2lts-mc(+0x6075e) [0x560cf064f75e]
ltl formula name CANInsertWithFailure-PT-020-LTLCardinality-04
ltl formula formula --ltl=/tmp/2974/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1043 places, 2520 transitions and 6760 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2974/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2974/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.040 user 0.090 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2974/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2974/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name CANInsertWithFailure-PT-020-LTLCardinality-09
ltl formula formula --ltl=/tmp/2974/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1043 places, 2520 transitions and 6760 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2974/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2974/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.070 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2974/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2974/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name CANInsertWithFailure-PT-020-LTLCardinality-11
ltl formula formula --ltl=/tmp/2974/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1043 places, 2520 transitions and 6760 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.070 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2974/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2974/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2974/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2974/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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-020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695100715"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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