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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 11K Feb 25 12:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Feb 25 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 169K Feb 25 12:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 51K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 165K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 12:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 25 12:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 194K Feb 25 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 798K Feb 25 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 434K 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 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678614019591

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=BridgeAndVehicles-PT-V20P20N10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 09:40:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 09:40:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 09:40:21] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-12 09:40:21] [INFO ] Transformed 68 places.
[2023-03-12 09:40:21] [INFO ] Transformed 548 transitions.
[2023-03-12 09:40:21] [INFO ] Parsed PT model containing 68 places and 548 transitions and 4070 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Applied a total of 0 rules in 20 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:40:21] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2023-03-12 09:40:21] [INFO ] Computed 7 place invariants in 15 ms
[2023-03-12 09:40:21] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
[2023-03-12 09:40:21] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:40:21] [INFO ] Invariant cache hit.
[2023-03-12 09:40:22] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-12 09:40:22] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:40:22] [INFO ] Invariant cache hit.
[2023-03-12 09:40:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:22] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-03-12 09:40:22] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:40:22] [INFO ] Invariant cache hit.
[2023-03-12 09:40:22] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 847 ms. Remains : 68/68 places, 548/548 transitions.
Support contains 16 out of 68 places after structural reductions.
[2023-03-12 09:40:22] [INFO ] Flatten gal took : 67 ms
[2023-03-12 09:40:22] [INFO ] Flatten gal took : 38 ms
[2023-03-12 09:40:22] [INFO ] Input system was already deterministic with 548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 22) seen :16
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 09:40:23] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:40:23] [INFO ] Invariant cache hit.
[2023-03-12 09:40:23] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 09:40:23] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-12 09:40:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 09:40:23] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-12 09:40:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:23] [INFO ] After 28ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2023-03-12 09:40:23] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-12 09:40:23] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 64 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2023-03-12 09:40:24] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2023-03-12 09:40:24] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 09:40:24] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 65/68 places, 547/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 604925 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 604925 steps, saw 148937 distinct states, run finished after 3002 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 09:40:27] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:27] [INFO ] Invariant cache hit.
[2023-03-12 09:40:27] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:40:27] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 09:40:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:40:27] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 09:40:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:27] [INFO ] After 30ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 09:40:27] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-12 09:40:27] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 24 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 65/65 places, 547/547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 59 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-12 09:40:27] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:27] [INFO ] Invariant cache hit.
[2023-03-12 09:40:27] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-12 09:40:27] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:27] [INFO ] Invariant cache hit.
[2023-03-12 09:40:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:28] [INFO ] Implicit Places using invariants and state equation in 219 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 380 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/65 places, 547/547 transitions.
Applied a total of 0 rules in 15 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 455 ms. Remains : 63/65 places, 547/547 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 646183 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 646183 steps, saw 158494 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 09:40:31] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2023-03-12 09:40:31] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 09:40:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:40:31] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 09:40:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:40:31] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 09:40:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:31] [INFO ] After 28ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 09:40:31] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-12 09:40:31] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 17 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 63/63 places, 547/547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 16 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-12 09:40:31] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:31] [INFO ] Invariant cache hit.
[2023-03-12 09:40:31] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-12 09:40:31] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:31] [INFO ] Invariant cache hit.
[2023-03-12 09:40:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:31] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2023-03-12 09:40:32] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-12 09:40:32] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:32] [INFO ] Invariant cache hit.
[2023-03-12 09:40:32] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 651 ms. Remains : 63/63 places, 547/547 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 63 transition count 129
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 422 place count 61 transition count 127
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 424 place count 61 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 426 place count 59 transition count 125
Applied a total of 426 rules in 14 ms. Remains 59 /63 variables (removed 4) and now considering 125/547 (removed 422) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 125 rows 59 cols
[2023-03-12 09:40:32] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:40:32] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:40:32] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 09:40:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:40:32] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 09:40:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 09:40:32] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 09:40:32] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-12 09:40:32] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 51 stabilizing places and 84 stable transitions
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 548
Applied a total of 1 rules in 5 ms. Remains 67 /68 variables (removed 1) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:40:32] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2023-03-12 09:40:32] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 09:40:33] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
[2023-03-12 09:40:33] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:40:33] [INFO ] Invariant cache hit.
[2023-03-12 09:40:33] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-12 09:40:33] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:40:33] [INFO ] Invariant cache hit.
[2023-03-12 09:40:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:33] [INFO ] Implicit Places using invariants and state equation in 292 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 423 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/68 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 619 ms. Remains : 65/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1526 reset in 411 ms.
Product exploration explored 100000 steps with 1548 reset in 294 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Graph (complete) has 1101 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/65 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 82 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-12 09:40:34] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2023-03-12 09:40:34] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:40:35] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:40:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:35] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-12 09:40:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:40:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:40:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:35] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-12 09:40:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:35] [INFO ] [Nat]Added 22 Read/Feed constraints in 94 ms returned sat
[2023-03-12 09:40:35] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2023-03-12 09:40:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-12 09:40:35] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 32 ms.
[2023-03-12 09:40:35] [INFO ] Added : 26 causal constraints over 6 iterations in 149 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 548/548 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 547
Applied a total of 2 rules in 60 ms. Remains 64 /65 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2023-03-12 09:40:35] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2023-03-12 09:40:35] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:40:35] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
[2023-03-12 09:40:35] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:35] [INFO ] Invariant cache hit.
[2023-03-12 09:40:36] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-12 09:40:36] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:36] [INFO ] Invariant cache hit.
[2023-03-12 09:40:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:36] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-12 09:40:36] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-12 09:40:36] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:36] [INFO ] Invariant cache hit.
[2023-03-12 09:40:36] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/65 places, 547/548 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 723 ms. Remains : 64/65 places, 547/548 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 1099 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 68 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=68 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-12 09:40:36] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:36] [INFO ] Invariant cache hit.
[2023-03-12 09:40:37] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:40:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:37] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-12 09:40:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:40:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:40:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:37] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-12 09:40:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:37] [INFO ] [Nat]Added 22 Read/Feed constraints in 159 ms returned sat
[2023-03-12 09:40:37] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2023-03-12 09:40:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2023-03-12 09:40:37] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 44 ms.
[2023-03-12 09:40:37] [INFO ] Added : 28 causal constraints over 7 iterations in 149 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1721 reset in 325 ms.
Product exploration explored 100000 steps with 1742 reset in 304 ms.
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 23 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-12 09:40:38] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:38] [INFO ] Invariant cache hit.
[2023-03-12 09:40:38] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
[2023-03-12 09:40:38] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:38] [INFO ] Invariant cache hit.
[2023-03-12 09:40:38] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-12 09:40:38] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:38] [INFO ] Invariant cache hit.
[2023-03-12 09:40:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:39] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-12 09:40:39] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-12 09:40:39] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:39] [INFO ] Invariant cache hit.
[2023-03-12 09:40:39] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 776 ms. Remains : 64/64 places, 547/547 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00 finished in 6675 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))&&F(p1)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 36 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2023-03-12 09:40:39] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2023-03-12 09:40:39] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:40:39] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
[2023-03-12 09:40:39] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:39] [INFO ] Invariant cache hit.
[2023-03-12 09:40:39] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-12 09:40:39] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:39] [INFO ] Invariant cache hit.
[2023-03-12 09:40:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:40] [INFO ] Implicit Places using invariants and state equation in 271 ms returned [22, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 389 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/68 places, 547/548 transitions.
Applied a total of 0 rules in 30 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 666 ms. Remains : 63/68 places, 547/548 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT 1 s48), p0:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 152 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-01 finished in 904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 41 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2023-03-12 09:40:40] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2023-03-12 09:40:40] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:40:40] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
[2023-03-12 09:40:40] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:40] [INFO ] Invariant cache hit.
[2023-03-12 09:40:40] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-12 09:40:40] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:40] [INFO ] Invariant cache hit.
[2023-03-12 09:40:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:41] [INFO ] Implicit Places using invariants and state equation in 281 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 401 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/68 places, 547/548 transitions.
Applied a total of 0 rules in 27 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 673 ms. Remains : 64/68 places, 547/548 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s47 s22), p1:(GT 3 s47)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2751 reset in 390 ms.
Product exploration explored 100000 steps with 2608 reset in 347 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 292 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 370 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-12 09:40:43] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2023-03-12 09:40:43] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:40:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:40:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:43] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-12 09:40:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:40:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:40:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:43] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-12 09:40:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:43] [INFO ] [Nat]Added 22 Read/Feed constraints in 171 ms returned sat
[2023-03-12 09:40:43] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2023-03-12 09:40:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-12 09:40:43] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 33 ms.
[2023-03-12 09:40:43] [INFO ] Added : 29 causal constraints over 6 iterations in 103 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 40 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-12 09:40:43] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:43] [INFO ] Invariant cache hit.
[2023-03-12 09:40:44] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
[2023-03-12 09:40:44] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:44] [INFO ] Invariant cache hit.
[2023-03-12 09:40:44] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-12 09:40:44] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:44] [INFO ] Invariant cache hit.
[2023-03-12 09:40:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:44] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-12 09:40:44] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 09:40:44] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:44] [INFO ] Invariant cache hit.
[2023-03-12 09:40:44] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 826 ms. Remains : 64/64 places, 547/547 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 248 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 329 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-12 09:40:45] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:45] [INFO ] Invariant cache hit.
[2023-03-12 09:40:45] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:40:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:45] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-12 09:40:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:40:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:40:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:46] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-12 09:40:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:46] [INFO ] [Nat]Added 22 Read/Feed constraints in 159 ms returned sat
[2023-03-12 09:40:46] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2023-03-12 09:40:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-12 09:40:46] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 18 ms.
[2023-03-12 09:40:46] [INFO ] Added : 29 causal constraints over 6 iterations in 71 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2792 reset in 310 ms.
Product exploration explored 100000 steps with 2843 reset in 279 ms.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 18 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-12 09:40:47] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:47] [INFO ] Invariant cache hit.
[2023-03-12 09:40:47] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
[2023-03-12 09:40:47] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:47] [INFO ] Invariant cache hit.
[2023-03-12 09:40:47] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-12 09:40:47] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:47] [INFO ] Invariant cache hit.
[2023-03-12 09:40:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:47] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-12 09:40:47] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 09:40:47] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:47] [INFO ] Invariant cache hit.
[2023-03-12 09:40:48] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 908 ms. Remains : 64/64 places, 547/547 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02 finished in 7816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 63 transition count 546
Applied a total of 6 rules in 43 ms. Remains 63 /68 variables (removed 5) and now considering 546/548 (removed 2) transitions.
[2023-03-12 09:40:48] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
// Phase 1: matrix 128 rows 63 cols
[2023-03-12 09:40:48] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 09:40:48] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-12 09:40:48] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
[2023-03-12 09:40:48] [INFO ] Invariant cache hit.
[2023-03-12 09:40:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:48] [INFO ] Implicit Places using invariants and state equation in 216 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 579 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/68 places, 546/548 transitions.
Applied a total of 0 rules in 18 ms. Remains 61 /61 variables (removed 0) and now considering 546/546 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 641 ms. Remains : 61/68 places, 546/548 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 (ADD s45 s46))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 765 reset in 271 ms.
Product exploration explored 100000 steps with 765 reset in 283 ms.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-12 09:40:49] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
// Phase 1: matrix 128 rows 61 cols
[2023-03-12 09:40:49] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-12 09:40:50] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:40:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:50] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-12 09:40:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:40:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:40:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:50] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-12 09:40:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:50] [INFO ] [Nat]Added 22 Read/Feed constraints in 424 ms returned sat
[2023-03-12 09:40:50] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 75 transitions) in 32 ms.
[2023-03-12 09:40:50] [INFO ] Added : 19 causal constraints over 5 iterations in 123 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 546/546 transitions.
Applied a total of 0 rules in 22 ms. Remains 61 /61 variables (removed 0) and now considering 546/546 (removed 0) transitions.
[2023-03-12 09:40:50] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
[2023-03-12 09:40:50] [INFO ] Invariant cache hit.
[2023-03-12 09:40:50] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-12 09:40:50] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
[2023-03-12 09:40:50] [INFO ] Invariant cache hit.
[2023-03-12 09:40:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:51] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-03-12 09:40:51] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 09:40:51] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
[2023-03-12 09:40:51] [INFO ] Invariant cache hit.
[2023-03-12 09:40:51] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 610 ms. Remains : 61/61 places, 546/546 transitions.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-12 09:40:51] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
[2023-03-12 09:40:51] [INFO ] Invariant cache hit.
[2023-03-12 09:40:51] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-12 09:40:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:51] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-12 09:40:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:40:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-12 09:40:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:52] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-12 09:40:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:52] [INFO ] [Nat]Added 22 Read/Feed constraints in 415 ms returned sat
[2023-03-12 09:40:52] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 75 transitions) in 21 ms.
[2023-03-12 09:40:52] [INFO ] Added : 19 causal constraints over 5 iterations in 97 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 765 reset in 271 ms.
Product exploration explored 100000 steps with 764 reset in 271 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 546/546 transitions.
Applied a total of 0 rules in 16 ms. Remains 61 /61 variables (removed 0) and now considering 546/546 (removed 0) transitions.
[2023-03-12 09:40:53] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
[2023-03-12 09:40:53] [INFO ] Invariant cache hit.
[2023-03-12 09:40:53] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-12 09:40:53] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
[2023-03-12 09:40:53] [INFO ] Invariant cache hit.
[2023-03-12 09:40:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:53] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2023-03-12 09:40:53] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 09:40:53] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
[2023-03-12 09:40:53] [INFO ] Invariant cache hit.
[2023-03-12 09:40:53] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 598 ms. Remains : 61/61 places, 546/546 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03 finished in 5653 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((X(F(p1))||p0))))'
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Applied a total of 2 rules in 3 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:40:53] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-12 09:40:53] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:40:54] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
[2023-03-12 09:40:54] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:40:54] [INFO ] Invariant cache hit.
[2023-03-12 09:40:54] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-12 09:40:54] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:40:54] [INFO ] Invariant cache hit.
[2023-03-12 09:40:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:54] [INFO ] Implicit Places using invariants and state equation in 237 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 337 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/68 places, 548/548 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 526 ms. Remains : 65/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ 1 s22) (LEQ 2 (ADD s48 s49))), p1:(LEQ s23 (ADD s25 s26))], 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][false, false, false]]
Product exploration explored 100000 steps with 37460 reset in 287 ms.
Product exploration explored 100000 steps with 37472 reset in 281 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Computed a total of 48 stabilizing places and 84 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-04 finished in 1303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 66 transition count 547
Applied a total of 3 rules in 17 ms. Remains 66 /68 variables (removed 2) and now considering 547/548 (removed 1) transitions.
[2023-03-12 09:40:55] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 66 cols
[2023-03-12 09:40:55] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 09:40:55] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
[2023-03-12 09:40:55] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:55] [INFO ] Invariant cache hit.
[2023-03-12 09:40:55] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-12 09:40:55] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:55] [INFO ] Invariant cache hit.
[2023-03-12 09:40:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:55] [INFO ] Implicit Places using invariants and state equation in 288 ms returned [22, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 395 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/68 places, 547/548 transitions.
Applied a total of 0 rules in 13 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 607 ms. Remains : 64/68 places, 547/548 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s52 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1950 reset in 221 ms.
Product exploration explored 100000 steps with 1954 reset in 218 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 1099 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 54 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=54 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
[2023-03-12 09:40:56] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2023-03-12 09:40:56] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:40:57] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:40:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:57] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-12 09:40:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:40:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:40:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:57] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-12 09:40:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:57] [INFO ] [Nat]Added 22 Read/Feed constraints in 12 ms returned sat
[2023-03-12 09:40:57] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2023-03-12 09:40:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-12 09:40:57] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 19 ms.
[2023-03-12 09:40:57] [INFO ] Added : 14 causal constraints over 5 iterations in 106 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 30 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-12 09:40:57] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:57] [INFO ] Invariant cache hit.
[2023-03-12 09:40:57] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
[2023-03-12 09:40:57] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:57] [INFO ] Invariant cache hit.
[2023-03-12 09:40:57] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-12 09:40:57] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:57] [INFO ] Invariant cache hit.
[2023-03-12 09:40:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:57] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2023-03-12 09:40:57] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 09:40:57] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:57] [INFO ] Invariant cache hit.
[2023-03-12 09:40:58] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 744 ms. Remains : 64/64 places, 547/547 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 1099 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
Finished random walk after 56 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 251 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0)]
[2023-03-12 09:40:59] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:40:59] [INFO ] Invariant cache hit.
[2023-03-12 09:40:59] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:40:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:59] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-12 09:40:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:40:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 09:40:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:59] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2023-03-12 09:40:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:40:59] [INFO ] [Nat]Added 22 Read/Feed constraints in 19 ms returned sat
[2023-03-12 09:40:59] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
[2023-03-12 09:40:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-12 09:40:59] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 20 ms.
[2023-03-12 09:41:00] [INFO ] Added : 15 causal constraints over 4 iterations in 187 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1952 reset in 241 ms.
Product exploration explored 100000 steps with 1948 reset in 231 ms.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 26 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-12 09:41:00] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:00] [INFO ] Invariant cache hit.
[2023-03-12 09:41:00] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
[2023-03-12 09:41:00] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:00] [INFO ] Invariant cache hit.
[2023-03-12 09:41:00] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-12 09:41:00] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:00] [INFO ] Invariant cache hit.
[2023-03-12 09:41:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:01] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-12 09:41:01] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 09:41:01] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:01] [INFO ] Invariant cache hit.
[2023-03-12 09:41:01] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 779 ms. Remains : 64/64 places, 547/547 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05 finished in 6301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G(p0)))))'
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 65 transition count 547
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 65 transition count 547
Applied a total of 4 rules in 5 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2023-03-12 09:41:01] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2023-03-12 09:41:01] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:41:01] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
[2023-03-12 09:41:01] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:01] [INFO ] Invariant cache hit.
[2023-03-12 09:41:01] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-12 09:41:01] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:01] [INFO ] Invariant cache hit.
[2023-03-12 09:41:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:01] [INFO ] Implicit Places using invariants and state equation in 227 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 322 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/68 places, 547/548 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 529 ms. Remains : 63/68 places, 547/548 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 43 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-06 finished in 633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (X(X(p1)) U (p2&&G(p1))))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Applied a total of 2 rules in 2 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:41:02] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-12 09:41:02] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:41:02] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
[2023-03-12 09:41:02] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:02] [INFO ] Invariant cache hit.
[2023-03-12 09:41:02] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-12 09:41:02] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:02] [INFO ] Invariant cache hit.
[2023-03-12 09:41:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:02] [INFO ] Implicit Places using invariants and state equation in 205 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 305 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/68 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 498 ms. Remains : 64/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LEQ s23 1) (LEQ s0 s49)), p2:(LEQ s0 s49), p1:(LEQ 3 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22316 reset in 395 ms.
Product exploration explored 100000 steps with 22199 reset in 364 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 p1 p0))), (X (OR (NOT p2) (NOT p1))), (X (NOT p0)), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0)))), (X p1), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 25 factoid took 1672 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10009 steps, including 19 resets, run finished after 87 ms. (steps per millisecond=115 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10008 steps, including 21 resets, run finished after 87 ms. (steps per millisecond=115 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 09:41:06] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-12 09:41:06] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:41:06] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:06] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-12 09:41:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:06] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-12 09:41:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:06] [INFO ] After 55ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-12 09:41:06] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-12 09:41:06] [INFO ] After 318ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 15 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:41:06] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:06] [INFO ] Invariant cache hit.
[2023-03-12 09:41:06] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 435468 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 435468 steps, saw 109651 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 09:41:10] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:10] [INFO ] Invariant cache hit.
[2023-03-12 09:41:10] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:10] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 09:41:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:10] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 09:41:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:10] [INFO ] After 53ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 09:41:10] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-12 09:41:10] [INFO ] After 309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 16 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 18 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:41:10] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:10] [INFO ] Invariant cache hit.
[2023-03-12 09:41:11] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-12 09:41:11] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:11] [INFO ] Invariant cache hit.
[2023-03-12 09:41:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:11] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2023-03-12 09:41:11] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 09:41:11] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:11] [INFO ] Invariant cache hit.
[2023-03-12 09:41:11] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 582 ms. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 7 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 127 rows 61 cols
[2023-03-12 09:41:11] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 09:41:11] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 09:41:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:11] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 09:41:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 09:41:11] [INFO ] After 36ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 09:41:11] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-12 09:41:11] [INFO ] After 265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 p1 p0))), (X (OR (NOT p2) (NOT p1))), (X (NOT p0)), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0)))), (X p1), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (AND p1 p2)), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND p0 p1)), (F (AND p0 p1 p2)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 26 factoid took 1434 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter insensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
[2023-03-12 09:41:13] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-12 09:41:13] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:41:14] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:41:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:41:14] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-12 09:41:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:41:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:41:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:41:14] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-12 09:41:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:14] [INFO ] [Nat]Added 22 Read/Feed constraints in 417 ms returned sat
[2023-03-12 09:41:14] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 29 ms.
[2023-03-12 09:41:14] [INFO ] Added : 10 causal constraints over 5 iterations in 112 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 17 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:41:14] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:14] [INFO ] Invariant cache hit.
[2023-03-12 09:41:15] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
[2023-03-12 09:41:15] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:15] [INFO ] Invariant cache hit.
[2023-03-12 09:41:15] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-12 09:41:15] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:15] [INFO ] Invariant cache hit.
[2023-03-12 09:41:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:15] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2023-03-12 09:41:15] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 09:41:15] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:15] [INFO ] Invariant cache hit.
[2023-03-12 09:41:15] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 832 ms. Remains : 64/64 places, 548/548 transitions.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 p2))), (X (AND (NOT p0) p1)), (X (OR p0 p1)), (X p1), (X (X (AND p1 (NOT p2)))), true, (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 981 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 09:41:17] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:17] [INFO ] Invariant cache hit.
[2023-03-12 09:41:17] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:17] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 09:41:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:17] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 09:41:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:17] [INFO ] After 85ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 09:41:17] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-12 09:41:18] [INFO ] After 384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 23 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 14 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:41:18] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:18] [INFO ] Invariant cache hit.
[2023-03-12 09:41:18] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 456125 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{}
Probabilistic random walk after 456125 steps, saw 114797 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 09:41:21] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:21] [INFO ] Invariant cache hit.
[2023-03-12 09:41:21] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:21] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 09:41:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:21] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 09:41:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:22] [INFO ] After 65ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 09:41:22] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-12 09:41:22] [INFO ] After 320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 20 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 14 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 13 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:41:22] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:22] [INFO ] Invariant cache hit.
[2023-03-12 09:41:22] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-12 09:41:22] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:22] [INFO ] Invariant cache hit.
[2023-03-12 09:41:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:22] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-12 09:41:22] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 09:41:22] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:22] [INFO ] Invariant cache hit.
[2023-03-12 09:41:22] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 495 ms. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 6 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 127 rows 61 cols
[2023-03-12 09:41:22] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 09:41:22] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 09:41:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:22] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 09:41:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 09:41:22] [INFO ] After 35ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 09:41:22] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-12 09:41:22] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 p2))), (X (AND (NOT p0) p1)), (X (OR p0 p1)), (X p1), (X (X (AND p1 (NOT p2)))), true, (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1))), (F (AND p2 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Knowledge based reduction with 21 factoid took 1117 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
[2023-03-12 09:41:24] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-12 09:41:24] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:41:24] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:41:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:41:24] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-12 09:41:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:41:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:41:24] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-12 09:41:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:25] [INFO ] [Nat]Added 22 Read/Feed constraints in 330 ms returned sat
[2023-03-12 09:41:25] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 16 ms.
[2023-03-12 09:41:25] [INFO ] Added : 10 causal constraints over 5 iterations in 58 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 586 reset in 367 ms.
Product exploration explored 100000 steps with 585 reset in 332 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 18 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:41:26] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:26] [INFO ] Invariant cache hit.
[2023-03-12 09:41:26] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
[2023-03-12 09:41:26] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:26] [INFO ] Invariant cache hit.
[2023-03-12 09:41:26] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-12 09:41:26] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:26] [INFO ] Invariant cache hit.
[2023-03-12 09:41:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:26] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-12 09:41:26] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-12 09:41:26] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:26] [INFO ] Invariant cache hit.
[2023-03-12 09:41:26] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 758 ms. Remains : 64/64 places, 548/548 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 finished in 24873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||(F(p1)&&(p2||X(p0)))) U G(p2)))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Applied a total of 2 rules in 3 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:41:26] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-12 09:41:26] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:41:27] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
[2023-03-12 09:41:27] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:27] [INFO ] Invariant cache hit.
[2023-03-12 09:41:27] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-12 09:41:27] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:27] [INFO ] Invariant cache hit.
[2023-03-12 09:41:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:27] [INFO ] Implicit Places using invariants and state equation in 191 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 294 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/68 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 534 ms. Remains : 64/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 2 s23), p1:(LEQ 2 s0), p0:(LEQ 2 s49)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1511 reset in 248 ms.
Product exploration explored 100000 steps with 1511 reset in 324 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X p2)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1003 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 09:41:29] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-12 09:41:29] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:41:29] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:29] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:41:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:29] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:41:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:30] [INFO ] After 32ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:41:30] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 0 ms to minimize.
[2023-03-12 09:41:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-12 09:41:30] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-12 09:41:30] [INFO ] After 326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 15 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:41:30] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:30] [INFO ] Invariant cache hit.
[2023-03-12 09:41:30] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10002 steps, including 21 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 607807 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 607807 steps, saw 149521 distinct states, run finished after 3004 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 09:41:33] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:33] [INFO ] Invariant cache hit.
[2023-03-12 09:41:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:41:33] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:41:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:41:34] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:41:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:34] [INFO ] After 82ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:41:34] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2023-03-12 09:41:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-12 09:41:34] [INFO ] After 281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-12 09:41:34] [INFO ] After 459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 16 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 14 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:41:34] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:34] [INFO ] Invariant cache hit.
[2023-03-12 09:41:34] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-12 09:41:34] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:34] [INFO ] Invariant cache hit.
[2023-03-12 09:41:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:34] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2023-03-12 09:41:34] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 09:41:34] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:34] [INFO ] Invariant cache hit.
[2023-03-12 09:41:35] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 645 ms. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 12 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 127 rows 61 cols
[2023-03-12 09:41:35] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:41:35] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:35] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:41:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:41:35] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:41:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 09:41:35] [INFO ] After 25ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:41:35] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-12 09:41:35] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X p2)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p2 (NOT p0) (NOT p1))), (F (NOT p1)), (F p0), (F (AND p2 (NOT p1))), (F (AND p2 p0 (NOT p1)))]
Knowledge based reduction with 18 factoid took 1160 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 230 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:41:37] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-12 09:41:37] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:41:37] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
[2023-03-12 09:41:37] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:37] [INFO ] Invariant cache hit.
[2023-03-12 09:41:37] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-12 09:41:37] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:37] [INFO ] Invariant cache hit.
[2023-03-12 09:41:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:37] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2023-03-12 09:41:37] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:37] [INFO ] Invariant cache hit.
[2023-03-12 09:41:37] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 833 ms. Remains : 64/64 places, 548/548 transitions.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1313 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 09:41:39] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:39] [INFO ] Invariant cache hit.
[2023-03-12 09:41:39] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:39] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:41:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:41:40] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:41:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:40] [INFO ] After 47ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:41:40] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2023-03-12 09:41:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-12 09:41:40] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-12 09:41:40] [INFO ] After 344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 14 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:41:40] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:40] [INFO ] Invariant cache hit.
[2023-03-12 09:41:40] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 665411 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{}
Probabilistic random walk after 665411 steps, saw 162808 distinct states, run finished after 3001 ms. (steps per millisecond=221 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 09:41:43] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:43] [INFO ] Invariant cache hit.
[2023-03-12 09:41:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:43] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:41:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:44] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:41:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:44] [INFO ] After 32ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:41:44] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2023-03-12 09:41:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-12 09:41:44] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-12 09:41:44] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 17 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 16 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:41:44] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:44] [INFO ] Invariant cache hit.
[2023-03-12 09:41:44] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-12 09:41:44] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:44] [INFO ] Invariant cache hit.
[2023-03-12 09:41:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:44] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2023-03-12 09:41:44] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 09:41:44] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:44] [INFO ] Invariant cache hit.
[2023-03-12 09:41:44] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 583 ms. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 4 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 127 rows 61 cols
[2023-03-12 09:41:44] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:41:44] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:44] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:41:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:45] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:41:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 09:41:45] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:41:45] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-12 09:41:45] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p2 (NOT p0) (NOT p1))), (F (NOT p1)), (F p0), (F (AND p2 (NOT p1))), (F (AND p2 p0 (NOT p1)))]
Knowledge based reduction with 18 factoid took 1396 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 261 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 1505 reset in 316 ms.
Product exploration explored 100000 steps with 1506 reset in 295 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 218 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 24 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:41:48] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-12 09:41:48] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:41:48] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
[2023-03-12 09:41:48] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-12 09:41:48] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:48] [INFO ] Invariant cache hit.
[2023-03-12 09:41:48] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 482 ms. Remains : 64/64 places, 548/548 transitions.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:41:48] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:48] [INFO ] Invariant cache hit.
[2023-03-12 09:41:49] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
[2023-03-12 09:41:49] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:49] [INFO ] Invariant cache hit.
[2023-03-12 09:41:49] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-12 09:41:49] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:49] [INFO ] Invariant cache hit.
[2023-03-12 09:41:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:49] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2023-03-12 09:41:49] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:49] [INFO ] Invariant cache hit.
[2023-03-12 09:41:49] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 714 ms. Remains : 64/64 places, 548/548 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08 finished in 22626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(p1)))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Applied a total of 2 rules in 3 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:41:49] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-12 09:41:49] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 09:41:49] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
[2023-03-12 09:41:49] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:49] [INFO ] Invariant cache hit.
[2023-03-12 09:41:49] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-12 09:41:49] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:49] [INFO ] Invariant cache hit.
[2023-03-12 09:41:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:50] [INFO ] Implicit Places using invariants and state equation in 230 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 329 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/68 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 535 ms. Remains : 64/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s24 s0), p1:(LEQ s23 s49)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-12 finished in 713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
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 0 with 2 rules applied. Total rules applied 3 place count 66 transition count 547
Applied a total of 3 rules in 22 ms. Remains 66 /68 variables (removed 2) and now considering 547/548 (removed 1) transitions.
[2023-03-12 09:41:50] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 66 cols
[2023-03-12 09:41:50] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 09:41:50] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
[2023-03-12 09:41:50] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:50] [INFO ] Invariant cache hit.
[2023-03-12 09:41:50] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-12 09:41:50] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:50] [INFO ] Invariant cache hit.
[2023-03-12 09:41:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:50] [INFO ] Implicit Places using invariants and state equation in 310 ms returned [22, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 415 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/68 places, 547/548 transitions.
Applied a total of 0 rules in 16 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 679 ms. Remains : 64/68 places, 547/548 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 2 s23) (LEQ s23 s49))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2747 reset in 270 ms.
Product exploration explored 100000 steps with 2725 reset in 281 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 1099 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 21 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-12 09:41:52] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2023-03-12 09:41:52] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:41:52] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
[2023-03-12 09:41:52] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:52] [INFO ] Invariant cache hit.
[2023-03-12 09:41:52] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-12 09:41:52] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:52] [INFO ] Invariant cache hit.
[2023-03-12 09:41:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:52] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-12 09:41:52] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-12 09:41:52] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:52] [INFO ] Invariant cache hit.
[2023-03-12 09:41:53] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 871 ms. Remains : 64/64 places, 547/547 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 1099 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2709 reset in 320 ms.
Product exploration explored 100000 steps with 2754 reset in 310 ms.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 16 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-12 09:41:54] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:54] [INFO ] Invariant cache hit.
[2023-03-12 09:41:54] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
[2023-03-12 09:41:54] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:54] [INFO ] Invariant cache hit.
[2023-03-12 09:41:54] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-12 09:41:54] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:54] [INFO ] Invariant cache hit.
[2023-03-12 09:41:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:54] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-12 09:41:54] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 09:41:54] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:54] [INFO ] Invariant cache hit.
[2023-03-12 09:41:55] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 826 ms. Remains : 64/64 places, 547/547 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13 finished in 4935 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)))'
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Applied a total of 2 rules in 3 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:41:55] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-12 09:41:55] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:41:55] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
[2023-03-12 09:41:55] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:55] [INFO ] Invariant cache hit.
[2023-03-12 09:41:55] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-12 09:41:55] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:41:55] [INFO ] Invariant cache hit.
[2023-03-12 09:41:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:55] [INFO ] Implicit Places using invariants and state equation in 268 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 396 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/68 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 600 ms. Remains : 64/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, p0, p0]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-14 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:(GT 1 s49)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-14 finished in 696 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)))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
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 0 with 2 rules applied. Total rules applied 3 place count 66 transition count 547
Applied a total of 3 rules in 50 ms. Remains 66 /68 variables (removed 2) and now considering 547/548 (removed 1) transitions.
[2023-03-12 09:41:56] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 66 cols
[2023-03-12 09:41:56] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 09:41:56] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
[2023-03-12 09:41:56] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:56] [INFO ] Invariant cache hit.
[2023-03-12 09:41:56] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-12 09:41:56] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:56] [INFO ] Invariant cache hit.
[2023-03-12 09:41:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:56] [INFO ] Implicit Places using invariants and state equation in 250 ms returned [22, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 393 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 64/68 places, 547/548 transitions.
Applied a total of 0 rules in 14 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 700 ms. Remains : 64/68 places, 547/548 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s51)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1753 reset in 284 ms.
Product exploration explored 100000 steps with 1704 reset in 313 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 1099 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 71 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-03-12 09:41:57] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2023-03-12 09:41:57] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:41:58] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:41:58] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-12 09:41:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:41:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:41:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:41:58] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-12 09:41:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:58] [INFO ] [Nat]Added 22 Read/Feed constraints in 213 ms returned sat
[2023-03-12 09:41:58] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
[2023-03-12 09:41:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 395 ms
[2023-03-12 09:41:59] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 27 ms.
[2023-03-12 09:41:59] [INFO ] Added : 28 causal constraints over 7 iterations in 138 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 17 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-12 09:41:59] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:59] [INFO ] Invariant cache hit.
[2023-03-12 09:41:59] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
[2023-03-12 09:41:59] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:59] [INFO ] Invariant cache hit.
[2023-03-12 09:41:59] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-12 09:41:59] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:59] [INFO ] Invariant cache hit.
[2023-03-12 09:41:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:41:59] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2023-03-12 09:41:59] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 09:41:59] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:41:59] [INFO ] Invariant cache hit.
[2023-03-12 09:41:59] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 815 ms. Remains : 64/64 places, 547/547 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 1099 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 69 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=69 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-12 09:42:00] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:42:00] [INFO ] Invariant cache hit.
[2023-03-12 09:42:00] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:42:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:42:00] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-12 09:42:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:42:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:42:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:42:00] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-12 09:42:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:00] [INFO ] [Nat]Added 22 Read/Feed constraints in 181 ms returned sat
[2023-03-12 09:42:01] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2023-03-12 09:42:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-12 09:42:01] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 16 ms.
[2023-03-12 09:42:01] [INFO ] Added : 28 causal constraints over 7 iterations in 94 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1737 reset in 231 ms.
Product exploration explored 100000 steps with 1743 reset in 246 ms.
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 15 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-12 09:42:01] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:42:01] [INFO ] Invariant cache hit.
[2023-03-12 09:42:02] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
[2023-03-12 09:42:02] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:42:02] [INFO ] Invariant cache hit.
[2023-03-12 09:42:02] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-12 09:42:02] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:42:02] [INFO ] Invariant cache hit.
[2023-03-12 09:42:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:02] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2023-03-12 09:42:02] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-12 09:42:02] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:42:02] [INFO ] Invariant cache hit.
[2023-03-12 09:42:02] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 852 ms. Remains : 64/64 places, 547/547 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00 finished in 6739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(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' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (X(X(p1)) U (p2&&G(p1))))))'
Found a Lengthening insensitive property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:42:03] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-12 09:42:03] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 09:42:03] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
[2023-03-12 09:42:03] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:03] [INFO ] Invariant cache hit.
[2023-03-12 09:42:03] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-12 09:42:03] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:03] [INFO ] Invariant cache hit.
[2023-03-12 09:42:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:04] [INFO ] Implicit Places using invariants and state equation in 250 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 410 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 64/68 places, 548/548 transitions.
Applied a total of 0 rules in 8 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 666 ms. Remains : 64/68 places, 548/548 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LEQ s23 1) (LEQ s0 s49)), p2:(LEQ s0 s49), p1:(LEQ 3 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22290 reset in 301 ms.
Product exploration explored 100000 steps with 22164 reset in 380 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 p1 p0))), (X (OR (NOT p2) (NOT p1))), (X (NOT p0)), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0)))), (X p1), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 25 factoid took 2342 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 09:42:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-12 09:42:08] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:42:08] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:08] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-12 09:42:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:08] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-12 09:42:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:08] [INFO ] After 67ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-12 09:42:08] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-12 09:42:08] [INFO ] After 340ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 23 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:42:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:08] [INFO ] Invariant cache hit.
[2023-03-12 09:42:08] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 421769 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 421769 steps, saw 105796 distinct states, run finished after 3003 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 09:42:12] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:12] [INFO ] Invariant cache hit.
[2023-03-12 09:42:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:12] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 09:42:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2023-03-12 09:42:12] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 09:42:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:12] [INFO ] After 56ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 09:42:12] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-12 09:42:12] [INFO ] After 303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 15 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 15 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:42:12] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:12] [INFO ] Invariant cache hit.
[2023-03-12 09:42:12] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-12 09:42:12] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:12] [INFO ] Invariant cache hit.
[2023-03-12 09:42:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:13] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2023-03-12 09:42:13] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 09:42:13] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:13] [INFO ] Invariant cache hit.
[2023-03-12 09:42:13] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 599 ms. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 7 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 127 rows 61 cols
[2023-03-12 09:42:13] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:42:13] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 09:42:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:42:13] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 09:42:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 09:42:13] [INFO ] After 46ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 09:42:13] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-12 09:42:13] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 p1 p0))), (X (OR (NOT p2) (NOT p1))), (X (NOT p0)), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0)))), (X p1), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (AND p1 p2)), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND p0 p1)), (F (AND p0 p1 p2)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 26 factoid took 1213 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter insensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
[2023-03-12 09:42:15] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-12 09:42:15] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:42:15] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:42:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:42:15] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-12 09:42:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:42:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:42:15] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-12 09:42:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:16] [INFO ] [Nat]Added 22 Read/Feed constraints in 407 ms returned sat
[2023-03-12 09:42:16] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 16 ms.
[2023-03-12 09:42:16] [INFO ] Added : 10 causal constraints over 5 iterations in 63 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 13 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:42:16] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:16] [INFO ] Invariant cache hit.
[2023-03-12 09:42:16] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
[2023-03-12 09:42:16] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:16] [INFO ] Invariant cache hit.
[2023-03-12 09:42:16] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-12 09:42:16] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:16] [INFO ] Invariant cache hit.
[2023-03-12 09:42:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:16] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-12 09:42:16] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 09:42:16] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:16] [INFO ] Invariant cache hit.
[2023-03-12 09:42:16] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 720 ms. Remains : 64/64 places, 548/548 transitions.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 p2))), (X (AND (NOT p0) p1)), (X (OR p0 p1)), (X p1), (X (X (AND p1 (NOT p2)))), true, (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 886 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 09:42:18] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:18] [INFO ] Invariant cache hit.
[2023-03-12 09:42:18] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:18] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 09:42:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:18] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 09:42:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:18] [INFO ] After 66ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 09:42:18] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-12 09:42:18] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 30 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 11 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:42:19] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:19] [INFO ] Invariant cache hit.
[2023-03-12 09:42:19] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 179996 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179996 steps, saw 50046 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 09:42:22] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:22] [INFO ] Invariant cache hit.
[2023-03-12 09:42:22] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:22] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 09:42:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2023-03-12 09:42:23] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 09:42:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:23] [INFO ] After 63ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 09:42:23] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-12 09:42:23] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 11 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 11 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:42:23] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:23] [INFO ] Invariant cache hit.
[2023-03-12 09:42:23] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-12 09:42:23] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:23] [INFO ] Invariant cache hit.
[2023-03-12 09:42:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:23] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-12 09:42:23] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 09:42:23] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:23] [INFO ] Invariant cache hit.
[2023-03-12 09:42:23] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 501 ms. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 5 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 127 rows 61 cols
[2023-03-12 09:42:23] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:42:23] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 09:42:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:24] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 09:42:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 09:42:24] [INFO ] After 33ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 09:42:24] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-12 09:42:24] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 p2))), (X (AND (NOT p0) p1)), (X (OR p0 p1)), (X p1), (X (X (AND p1 (NOT p2)))), true, (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1))), (F (AND p2 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Knowledge based reduction with 21 factoid took 813 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
[2023-03-12 09:42:25] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-12 09:42:25] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 09:42:25] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:42:25] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-12 09:42:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:42:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:42:25] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-12 09:42:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:25] [INFO ] [Nat]Added 22 Read/Feed constraints in 320 ms returned sat
[2023-03-12 09:42:25] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 23 ms.
[2023-03-12 09:42:26] [INFO ] Added : 10 causal constraints over 5 iterations in 80 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 585 reset in 238 ms.
Product exploration explored 100000 steps with 586 reset in 265 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 11 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:42:26] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:26] [INFO ] Invariant cache hit.
[2023-03-12 09:42:27] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
[2023-03-12 09:42:27] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:27] [INFO ] Invariant cache hit.
[2023-03-12 09:42:27] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-12 09:42:27] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:27] [INFO ] Invariant cache hit.
[2023-03-12 09:42:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:27] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-03-12 09:42:27] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 09:42:27] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:27] [INFO ] Invariant cache hit.
[2023-03-12 09:42:27] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 771 ms. Remains : 64/64 places, 548/548 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 finished in 24612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||(F(p1)&&(p2||X(p0)))) U G(p2)))'
Found a Lengthening insensitive property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:42:27] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-12 09:42:27] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:42:28] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
[2023-03-12 09:42:28] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:28] [INFO ] Invariant cache hit.
[2023-03-12 09:42:28] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-12 09:42:28] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:28] [INFO ] Invariant cache hit.
[2023-03-12 09:42:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:28] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 307 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 64/68 places, 548/548 transitions.
Applied a total of 0 rules in 10 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 502 ms. Remains : 64/68 places, 548/548 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 2 s23), p1:(LEQ 2 s0), p0:(LEQ 2 s49)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1515 reset in 346 ms.
Product exploration explored 100000 steps with 1509 reset in 329 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X p2)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1025 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 09:42:30] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-12 09:42:30] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:42:30] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:30] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:42:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:30] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:42:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:30] [INFO ] After 55ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:42:30] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
[2023-03-12 09:42:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-12 09:42:30] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-12 09:42:30] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 17 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:42:30] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:30] [INFO ] Invariant cache hit.
[2023-03-12 09:42:31] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10009 steps, including 21 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 685183 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 685183 steps, saw 167365 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 09:42:34] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:34] [INFO ] Invariant cache hit.
[2023-03-12 09:42:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:42:34] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:42:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:34] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:42:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:34] [INFO ] After 31ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:42:34] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2023-03-12 09:42:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-12 09:42:34] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-12 09:42:34] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 22 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 16 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:42:34] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:34] [INFO ] Invariant cache hit.
[2023-03-12 09:42:34] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-12 09:42:34] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:34] [INFO ] Invariant cache hit.
[2023-03-12 09:42:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:35] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2023-03-12 09:42:35] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 09:42:35] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:35] [INFO ] Invariant cache hit.
[2023-03-12 09:42:35] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 598 ms. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 6 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 127 rows 61 cols
[2023-03-12 09:42:35] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:42:35] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:42:35] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:42:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:35] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:42:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 09:42:35] [INFO ] After 20ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:42:35] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-12 09:42:35] [INFO ] After 157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X p2)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p2 (NOT p0) (NOT p1))), (F (NOT p1)), (F p0), (F (AND p2 (NOT p1))), (F (AND p2 p0 (NOT p1)))]
Knowledge based reduction with 18 factoid took 849 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:42:36] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-12 09:42:36] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 09:42:37] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
[2023-03-12 09:42:37] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:37] [INFO ] Invariant cache hit.
[2023-03-12 09:42:37] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-12 09:42:37] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:37] [INFO ] Invariant cache hit.
[2023-03-12 09:42:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:37] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-12 09:42:37] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:37] [INFO ] Invariant cache hit.
[2023-03-12 09:42:37] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 640 ms. Remains : 64/64 places, 548/548 transitions.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 752 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10002 steps, including 20 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 09:42:38] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:38] [INFO ] Invariant cache hit.
[2023-03-12 09:42:38] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:38] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:42:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:38] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:42:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:38] [INFO ] After 31ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:42:38] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2023-03-12 09:42:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-12 09:42:38] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-12 09:42:38] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 11 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:42:38] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:38] [INFO ] Invariant cache hit.
[2023-03-12 09:42:39] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 728999 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 728999 steps, saw 177281 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 09:42:42] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:42] [INFO ] Invariant cache hit.
[2023-03-12 09:42:42] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:42] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:42:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:42] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:42:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:42] [INFO ] After 32ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:42:42] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2023-03-12 09:42:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-12 09:42:42] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-12 09:42:42] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 12 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 12 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:42:42] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:42] [INFO ] Invariant cache hit.
[2023-03-12 09:42:43] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-12 09:42:43] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:43] [INFO ] Invariant cache hit.
[2023-03-12 09:42:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:43] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-12 09:42:43] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 09:42:43] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:43] [INFO ] Invariant cache hit.
[2023-03-12 09:42:43] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 474 ms. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 11 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 127 rows 61 cols
[2023-03-12 09:42:43] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 09:42:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:43] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:42:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:42:43] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:42:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 09:42:43] [INFO ] After 25ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:42:43] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-12 09:42:43] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p2 (NOT p0) (NOT p1))), (F (NOT p1)), (F p0), (F (AND p2 (NOT p1))), (F (AND p2 p0 (NOT p1)))]
Knowledge based reduction with 18 factoid took 995 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 262 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 247 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 1508 reset in 293 ms.
Product exploration explored 100000 steps with 1509 reset in 290 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 241 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 16 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:42:46] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-12 09:42:46] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 09:42:46] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
[2023-03-12 09:42:46] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 09:42:46] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:46] [INFO ] Invariant cache hit.
[2023-03-12 09:42:46] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 471 ms. Remains : 64/64 places, 548/548 transitions.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 09:42:46] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:46] [INFO ] Invariant cache hit.
[2023-03-12 09:42:46] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
[2023-03-12 09:42:46] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:46] [INFO ] Invariant cache hit.
[2023-03-12 09:42:47] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-12 09:42:47] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:47] [INFO ] Invariant cache hit.
[2023-03-12 09:42:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:47] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-12 09:42:47] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 09:42:47] [INFO ] Invariant cache hit.
[2023-03-12 09:42:47] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 682 ms. Remains : 64/64 places, 548/548 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08 finished in 19871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-12 09:42:47] [INFO ] Flatten gal took : 56 ms
[2023-03-12 09:42:47] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-12 09:42:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 548 transitions and 4070 arcs took 9 ms.
Total runtime 146374 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4179/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4179/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4179/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4179/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4179/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4179/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4179/ltl_6_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00
Could not compute solution for formula : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02
Could not compute solution for formula : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03
Could not compute solution for formula : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05
Could not compute solution for formula : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07
Could not compute solution for formula : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08
Could not compute solution for formula : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13

BK_STOP 1678614169411

--------------------
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 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00
ltl formula formula --ltl=/tmp/4179/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 68 places, 548 transitions and 4070 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.130 real 0.030 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4179/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4179/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4179/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4179/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02
ltl formula formula --ltl=/tmp/4179/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 68 places, 548 transitions and 4070 arcs
Warning: program compiled against libxml 210 using older 209
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.160 real 0.020 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4179/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4179/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4179/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4179/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03
ltl formula formula --ltl=/tmp/4179/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: =============================================================================
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 68 places, 548 transitions and 4070 arcs
Warning: program compiled against libxml 210 using older 209
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.130 real 0.030 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4179/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4179/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4179/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4179/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05
ltl formula formula --ltl=/tmp/4179/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 68 places, 548 transitions and 4070 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4179/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4179/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4179/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.020 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4179/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07
ltl formula formula --ltl=/tmp/4179/ltl_4_
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
pnml2lts-mc( 0/ 4): Petri net has 68 places, 548 transitions and 4070 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.010 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4179/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4179/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4179/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4179/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08
ltl formula formula --ltl=/tmp/4179/ltl_5_
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 68 places, 548 transitions and 4070 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.110 real 0.010 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4179/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4179/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4179/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4179/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13
ltl formula formula --ltl=/tmp/4179/ltl_6_
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
pnml2lts-mc( 0/ 4): Petri net has 68 places, 548 transitions and 4070 arcs
Warning: program compiled against libxml 210 using older 209
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.110 real 0.020 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4179/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4179/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4179/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4179/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="BridgeAndVehicles-PT-V20P20N10"
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 BridgeAndVehicles-PT-V20P20N10, 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-167813694400203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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