About the Execution of LoLa+red for LamportFastMutEx-COL-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 854.783 | 59938.00 | 88348.00 | 639.70 | FFFFFFFFFFFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r231-tall-167856416000371.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is LamportFastMutEx-COL-6, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416000371
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.1K Feb 25 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 13:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 13:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 25 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 42K 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 LamportFastMutEx-COL-6-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679447568889
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-6
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 01:12:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 01:12:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:12:50] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 01:12:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 01:12:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 448 ms
[2023-03-22 01:12:50] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 217 PT places and 525.0 transition bindings in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 01:12:51] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2023-03-22 01:12:51] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10005 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 28) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 17 rows 15 cols
[2023-03-22 01:12:51] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-22 01:12:51] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-22 01:12:51] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 01:12:51] [INFO ] Flatten gal took : 13 ms
[2023-03-22 01:12:51] [INFO ] Flatten gal took : 3 ms
Domain [pid(7), pid(7)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-22 01:12:51] [INFO ] Unfolded HLPN to a Petri net with 217 places and 420 transitions 1834 arcs in 19 ms.
[2023-03-22 01:12:51] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 66 transitions.
Support contains 144 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 13 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 01:12:51] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2023-03-22 01:12:51] [INFO ] Computed 50 place invariants in 6 ms
[2023-03-22 01:12:51] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-22 01:12:51] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:12:51] [INFO ] Invariant cache hit.
[2023-03-22 01:12:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 01:12:51] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-22 01:12:51] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:12:51] [INFO ] Invariant cache hit.
[2023-03-22 01:12:52] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 456 ms. Remains : 176/176 places, 354/354 transitions.
Support contains 144 out of 176 places after structural reductions.
[2023-03-22 01:12:52] [INFO ] Flatten gal took : 30 ms
[2023-03-22 01:12:52] [INFO ] Flatten gal took : 41 ms
[2023-03-22 01:12:52] [INFO ] Input system was already deterministic with 354 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 25) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-22 01:12:52] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:12:52] [INFO ] Invariant cache hit.
[2023-03-22 01:12:52] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 01:12:52] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:12:52] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 01:12:52] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:12:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 01:12:52] [INFO ] After 43ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:12:52] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2023-03-22 01:12:52] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2023-03-22 01:12:53] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 0 ms to minimize.
[2023-03-22 01:12:53] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2023-03-22 01:12:53] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2023-03-22 01:12:53] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 0 ms to minimize.
[2023-03-22 01:12:53] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2023-03-22 01:12:53] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2023-03-22 01:12:53] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2023-03-22 01:12:53] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2023-03-22 01:12:53] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 0 ms to minimize.
[2023-03-22 01:12:53] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 0 ms to minimize.
[2023-03-22 01:12:53] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2023-03-22 01:12:53] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2023-03-22 01:12:53] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2023-03-22 01:12:54] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2023-03-22 01:12:54] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2023-03-22 01:12:54] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2023-03-22 01:12:54] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2023-03-22 01:12:54] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 0 ms to minimize.
[2023-03-22 01:12:54] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 0 ms to minimize.
[2023-03-22 01:12:54] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 0 ms to minimize.
[2023-03-22 01:12:54] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 0 ms to minimize.
[2023-03-22 01:12:54] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2023-03-22 01:12:54] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2023-03-22 01:12:54] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2019 ms
[2023-03-22 01:12:54] [INFO ] After 2096ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-22 01:12:54] [INFO ] After 2251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 18 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 348
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 170 transition count 342
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 164 transition count 342
Applied a total of 24 rules in 39 ms. Remains 164 /176 variables (removed 12) and now considering 342/354 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 164/176 places, 342/354 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1281682 steps, run timeout after 3001 ms. (steps per millisecond=427 ) properties seen :{}
Probabilistic random walk after 1281682 steps, saw 416665 distinct states, run finished after 3001 ms. (steps per millisecond=427 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:12:57] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 164 cols
[2023-03-22 01:12:57] [INFO ] Computed 50 place invariants in 5 ms
[2023-03-22 01:12:58] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2023-03-22 01:12:58] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:12:58] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 01:12:58] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:12:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 01:12:58] [INFO ] After 33ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:12:58] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-22 01:12:58] [INFO ] After 231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 18 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 13 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 164/164 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 12 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-22 01:12:58] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 01:12:58] [INFO ] Invariant cache hit.
[2023-03-22 01:12:58] [INFO ] Implicit Places using invariants in 139 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 160 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 158/164 places, 342/342 transitions.
Applied a total of 0 rules in 23 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 195 ms. Remains : 158/164 places, 342/342 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1369420 steps, run timeout after 3001 ms. (steps per millisecond=456 ) properties seen :{}
Probabilistic random walk after 1369420 steps, saw 437995 distinct states, run finished after 3003 ms. (steps per millisecond=456 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:13:01] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-22 01:13:01] [INFO ] Computed 44 place invariants in 4 ms
[2023-03-22 01:13:01] [INFO ] [Real]Absence check using 44 positive place invariants in 6 ms returned sat
[2023-03-22 01:13:01] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:13:01] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-22 01:13:01] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:13:01] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:01] [INFO ] After 33ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:13:01] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 0 ms to minimize.
[2023-03-22 01:13:01] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2023-03-22 01:13:02] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2023-03-22 01:13:02] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2023-03-22 01:13:02] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 0 ms to minimize.
[2023-03-22 01:13:02] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 0 ms to minimize.
[2023-03-22 01:13:02] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 0 ms to minimize.
[2023-03-22 01:13:02] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 4 ms to minimize.
[2023-03-22 01:13:02] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 0 ms to minimize.
[2023-03-22 01:13:02] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 0 ms to minimize.
[2023-03-22 01:13:02] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 0 ms to minimize.
[2023-03-22 01:13:02] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 0 ms to minimize.
[2023-03-22 01:13:02] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2023-03-22 01:13:03] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 0 ms to minimize.
[2023-03-22 01:13:03] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 0 ms to minimize.
[2023-03-22 01:13:03] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1266 ms
[2023-03-22 01:13:03] [INFO ] After 1323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-22 01:13:03] [INFO ] After 1461ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 18 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 12 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 158/158 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-22 01:13:03] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 01:13:03] [INFO ] Invariant cache hit.
[2023-03-22 01:13:03] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-22 01:13:03] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 01:13:03] [INFO ] Invariant cache hit.
[2023-03-22 01:13:03] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:03] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-22 01:13:03] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-22 01:13:03] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 01:13:03] [INFO ] Invariant cache hit.
[2023-03-22 01:13:03] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 466 ms. Remains : 158/158 places, 342/342 transitions.
Graph (trivial) has 102 edges and 158 vertex of which 30 / 158 are part of one of the 6 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 60 transitions
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 120 transitions.
Graph (complete) has 426 edges and 134 vertex of which 127 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 127 transition count 186
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 38 place count 127 transition count 150
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 30 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 1 with 102 rules applied. Total rules applied 140 place count 61 transition count 150
Applied a total of 140 rules in 24 ms. Remains 61 /158 variables (removed 97) and now considering 150/342 (removed 192) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 150 rows 61 cols
[2023-03-22 01:13:03] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-22 01:13:03] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 01:13:03] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:13:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 01:13:03] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:13:03] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-22 01:13:03] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 1 stabilizing places and 6 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 12 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 348
Applied a total of 12 rules in 11 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2023-03-22 01:13:04] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 170 cols
[2023-03-22 01:13:04] [INFO ] Computed 50 place invariants in 3 ms
[2023-03-22 01:13:04] [INFO ] Implicit Places using invariants in 112 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 129 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/176 places, 348/354 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 164 transition count 342
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 158 transition count 342
Applied a total of 12 rules in 13 ms. Remains 158 /164 variables (removed 6) and now considering 342/348 (removed 6) transitions.
[2023-03-22 01:13:04] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-22 01:13:04] [INFO ] Computed 44 place invariants in 2 ms
[2023-03-22 01:13:04] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-22 01:13:04] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 01:13:04] [INFO ] Invariant cache hit.
[2023-03-22 01:13:04] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:04] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 158/176 places, 342/354 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 501 ms. Remains : 158/176 places, 342/354 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-00 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=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=[p0:(LEQ (ADD s44 s45 s46 s47 s48 s49) (ADD s56 s57 s58 s59 s60 s61)), p1:(GT 2 (ADD s56 s57 s58 s59 s60 s61))], 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 0 reset in 309 ms.
Stack based approach found an accepted trace after 387 steps with 0 reset with depth 388 and stack size 388 in 2 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-00 finished in 1079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1))))'
Support contains 30 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 01:13:05] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2023-03-22 01:13:05] [INFO ] Computed 50 place invariants in 1 ms
[2023-03-22 01:13:05] [INFO ] Implicit Places using invariants in 148 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 149 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 157 ms. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s38 s39 s40 s41 s42 s43) (ADD s146 s147 s148 s149 s150 s151)), p0:(AND (LEQ (ADD s56 s57 s58 s59 s60 s61) (ADD s50 s51 s52 s53 s54 s55)) (LEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 222 ms.
Stack based approach found an accepted trace after 386 steps with 0 reset with depth 387 and stack size 387 in 1 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-01 finished in 525 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 36 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 348
Applied a total of 12 rules in 10 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2023-03-22 01:13:05] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 170 cols
[2023-03-22 01:13:05] [INFO ] Computed 50 place invariants in 1 ms
[2023-03-22 01:13:05] [INFO ] Implicit Places using invariants in 129 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 131 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/176 places, 348/354 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 149 ms. Remains : 164/176 places, 348/354 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-02 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 3 (ADD s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 ...], 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 0 reset in 249 ms.
Stack based approach found an accepted trace after 649 steps with 0 reset with depth 650 and stack size 650 in 2 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-02 finished in 451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||G(p2)))'
Support contains 60 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 348
Applied a total of 12 rules in 11 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2023-03-22 01:13:06] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:06] [INFO ] Invariant cache hit.
[2023-03-22 01:13:06] [INFO ] Implicit Places using invariants in 97 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 98 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/176 places, 348/354 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 115 ms. Remains : 164/176 places, 348/354 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(LEQ 3 (ADD s32 s33 s34 s35 s36 s37)), p0:(LEQ (ADD s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 165 steps with 25 reset in 5 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-03 finished in 264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(p0) U p1))'
Support contains 42 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 01:13:06] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2023-03-22 01:13:06] [INFO ] Computed 50 place invariants in 1 ms
[2023-03-22 01:13:06] [INFO ] Implicit Places using invariants in 96 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 97 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 2 (ADD s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 ...], 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]]
Entered a terminal (fully accepting) state of product in 2940 steps with 114 reset in 24 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-05 finished in 213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(G(p0))&&G(p1)))&&F(G((!p0 U p2)))))'
Support contains 48 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 4 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 01:13:06] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:06] [INFO ] Invariant cache hit.
[2023-03-22 01:13:06] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-22 01:13:06] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:06] [INFO ] Invariant cache hit.
[2023-03-22 01:13:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 01:13:06] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-22 01:13:06] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-22 01:13:06] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:06] [INFO ] Invariant cache hit.
[2023-03-22 01:13:07] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 422 ms. Remains : 176/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 4}, { cond=p1, acceptance={1} source=1 dest: 5}], [{ cond=(OR p2 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 1}, { cond=p0, acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={1} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1} source=5 dest: 1}, { cond=p1, acceptance={1} source=5 dest: 5}]], initial=0, aps=[p1:(GT 2 (ADD s50 s51 s52 s53 s54 s55)), p2:(LEQ 1 (ADD s110 s111 s112 s113 s114 s115)), p0:(GT 3 (ADD s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 224 ms.
Stack based approach found an accepted trace after 292 steps with 0 reset with depth 293 and stack size 293 in 1 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-07 finished in 873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 48 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 6 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 01:13:07] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:07] [INFO ] Invariant cache hit.
[2023-03-22 01:13:07] [INFO ] Implicit Places using invariants in 107 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 119 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 170 transition count 348
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 164 transition count 348
Applied a total of 12 rules in 7 ms. Remains 164 /170 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2023-03-22 01:13:07] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2023-03-22 01:13:07] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-22 01:13:07] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-22 01:13:07] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:07] [INFO ] Invariant cache hit.
[2023-03-22 01:13:07] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:07] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 164/176 places, 348/354 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 416 ms. Remains : 164/176 places, 348/354 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT (ADD s146 s147 s148 s149 s150 s151) (ADD s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4769 reset in 247 ms.
Product exploration explored 100000 steps with 4695 reset in 299 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 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 27 ms :[(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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 111 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-22 01:13:08] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:08] [INFO ] Invariant cache hit.
[2023-03-22 01:13:08] [INFO ] [Real]Absence check using 44 positive place invariants in 12 ms returned sat
[2023-03-22 01:13:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:09] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2023-03-22 01:13:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:09] [INFO ] [Nat]Absence check using 44 positive place invariants in 12 ms returned sat
[2023-03-22 01:13:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:09] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-22 01:13:09] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:09] [INFO ] [Nat]Added 36 Read/Feed constraints in 8 ms returned sat
[2023-03-22 01:13:09] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2023-03-22 01:13:09] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2023-03-22 01:13:09] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2023-03-22 01:13:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 180 ms
[2023-03-22 01:13:09] [INFO ] Computed and/alt/rep : 222/1098/222 causal constraints (skipped 30 transitions) in 19 ms.
[2023-03-22 01:13:10] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-22 01:13:10] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-22 01:13:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2023-03-22 01:13:10] [INFO ] Added : 154 causal constraints over 32 iterations in 897 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 48 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2023-03-22 01:13:10] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:10] [INFO ] Invariant cache hit.
[2023-03-22 01:13:10] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-22 01:13:10] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:10] [INFO ] Invariant cache hit.
[2023-03-22 01:13:10] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:10] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-22 01:13:10] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 01:13:10] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:10] [INFO ] Invariant cache hit.
[2023-03-22 01:13:10] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 515 ms. Remains : 164/164 places, 348/348 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 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 25 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 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)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-22 01:13:11] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:11] [INFO ] Invariant cache hit.
[2023-03-22 01:13:11] [INFO ] [Real]Absence check using 44 positive place invariants in 11 ms returned sat
[2023-03-22 01:13:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:11] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-22 01:13:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:11] [INFO ] [Nat]Absence check using 44 positive place invariants in 12 ms returned sat
[2023-03-22 01:13:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:11] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-22 01:13:11] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:11] [INFO ] [Nat]Added 36 Read/Feed constraints in 13 ms returned sat
[2023-03-22 01:13:11] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2023-03-22 01:13:11] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2023-03-22 01:13:11] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2023-03-22 01:13:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 174 ms
[2023-03-22 01:13:11] [INFO ] Computed and/alt/rep : 222/1098/222 causal constraints (skipped 30 transitions) in 19 ms.
[2023-03-22 01:13:12] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-03-22 01:13:12] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2023-03-22 01:13:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2023-03-22 01:13:12] [INFO ] Added : 154 causal constraints over 32 iterations in 830 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4756 reset in 232 ms.
Product exploration explored 100000 steps with 4796 reset in 264 ms.
Support contains 48 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2023-03-22 01:13:13] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:13] [INFO ] Invariant cache hit.
[2023-03-22 01:13:13] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-22 01:13:13] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:13] [INFO ] Invariant cache hit.
[2023-03-22 01:13:13] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:13] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-22 01:13:13] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 01:13:13] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:13] [INFO ] Invariant cache hit.
[2023-03-22 01:13:13] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 421 ms. Remains : 164/164 places, 348/348 transitions.
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-08 finished in 6199 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 U (G(p0)||(p0&&(p1 U (p2||G(p1)))))))))'
Support contains 18 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 7 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 01:13:13] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2023-03-22 01:13:13] [INFO ] Computed 50 place invariants in 1 ms
[2023-03-22 01:13:13] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-22 01:13:13] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:13] [INFO ] Invariant cache hit.
[2023-03-22 01:13:13] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 01:13:14] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-22 01:13:14] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 01:13:14] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:14] [INFO ] Invariant cache hit.
[2023-03-22 01:13:14] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 457 ms. Remains : 176/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NOT (AND (LEQ 3 (ADD s110 s111 s112 s113 s114 s115)) (LEQ (ADD s158 s159 s160 s161 s162 s163) (ADD s56 s57 s58 s59 s60 s61)))) (GT 3 (ADD s110 s1...], nbAcceptance=2, 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 4370 reset in 300 ms.
Product exploration explored 100000 steps with 4390 reset in 271 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 379 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 01:13:15] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:15] [INFO ] Invariant cache hit.
[2023-03-22 01:13:15] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (G (NOT (AND p1 (NOT p2) p0))), (G (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (F p0), (F (AND (NOT p1) (NOT p2) p0))]
Knowledge based reduction with 11 factoid took 517 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
[2023-03-22 01:13:16] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:16] [INFO ] Invariant cache hit.
[2023-03-22 01:13:16] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-22 01:13:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:16] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2023-03-22 01:13:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:16] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-22 01:13:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:16] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-22 01:13:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 01:13:16] [INFO ] [Nat]Added 72 Read/Feed constraints in 14 ms returned sat
[2023-03-22 01:13:16] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2023-03-22 01:13:16] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:13:16] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2023-03-22 01:13:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 143 ms
[2023-03-22 01:13:16] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 19 ms.
[2023-03-22 01:13:17] [INFO ] Added : 73 causal constraints over 16 iterations in 351 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 18 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 12 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 01:13:17] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:17] [INFO ] Invariant cache hit.
[2023-03-22 01:13:17] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-22 01:13:17] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:17] [INFO ] Invariant cache hit.
[2023-03-22 01:13:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 01:13:17] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-22 01:13:17] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 01:13:17] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:17] [INFO ] Invariant cache hit.
[2023-03-22 01:13:17] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 489 ms. Remains : 176/176 places, 354/354 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 314 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:13:18] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:18] [INFO ] Invariant cache hit.
[2023-03-22 01:13:18] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (G (OR (NOT p1) p2))]
False Knowledge obtained : [(F p0), (F (AND (NOT p2) p0)), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0))))]
Knowledge based reduction with 10 factoid took 391 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
[2023-03-22 01:13:18] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:18] [INFO ] Invariant cache hit.
[2023-03-22 01:13:18] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-22 01:13:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:18] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-22 01:13:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:18] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-22 01:13:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:19] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-22 01:13:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 01:13:19] [INFO ] [Nat]Added 72 Read/Feed constraints in 12 ms returned sat
[2023-03-22 01:13:19] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2023-03-22 01:13:19] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2023-03-22 01:13:19] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:13:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 139 ms
[2023-03-22 01:13:19] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 22 ms.
[2023-03-22 01:13:19] [INFO ] Added : 73 causal constraints over 16 iterations in 318 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4448 reset in 218 ms.
Product exploration explored 100000 steps with 4421 reset in 215 ms.
Support contains 18 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 4 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 01:13:20] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:20] [INFO ] Invariant cache hit.
[2023-03-22 01:13:20] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-22 01:13:20] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:20] [INFO ] Invariant cache hit.
[2023-03-22 01:13:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 01:13:20] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-22 01:13:20] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 01:13:20] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:20] [INFO ] Invariant cache hit.
[2023-03-22 01:13:20] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 460 ms. Remains : 176/176 places, 354/354 transitions.
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-09 finished in 6862 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&&X(G(!p0))))))'
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 01:13:20] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:20] [INFO ] Invariant cache hit.
[2023-03-22 01:13:20] [INFO ] Implicit Places using invariants in 119 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 120 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, true, p0]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s158 s159 s160 s161 s162 s163))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 183 ms.
Stack based approach found an accepted trace after 316 steps with 0 reset with depth 317 and stack size 317 in 1 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-10 finished in 416 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((G(F(p0)) U p1))))'
Support contains 18 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 01:13:20] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:20] [INFO ] Invariant cache hit.
[2023-03-22 01:13:21] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-22 01:13:21] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:21] [INFO ] Invariant cache hit.
[2023-03-22 01:13:21] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 01:13:21] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2023-03-22 01:13:21] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:21] [INFO ] Invariant cache hit.
[2023-03-22 01:13:21] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 461 ms. Remains : 176/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 1 (ADD s44 s45 s46 s47 s48 s49)), p0:(AND (LEQ 3 (ADD s110 s111 s112 s113 s114 s115)) (LEQ (ADD s32 s33 s34 s35 s36 s37) (ADD s44 s45 s46 s47 s48 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 495 reset in 176 ms.
Stack based approach found an accepted trace after 374 steps with 1 reset with depth 75 and stack size 75 in 0 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-12 finished in 825 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((F(p0)&&X((p1 U p2)))))'
Support contains 24 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 01:13:21] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:21] [INFO ] Invariant cache hit.
[2023-03-22 01:13:21] [INFO ] Implicit Places using invariants in 103 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 104 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s50 s51 s52 s53 s54 s55)), p2:(LEQ (ADD s0 s1 s2 s3 s4 s5) (ADD s152 s153 s154 s155 s156 s157)), p1:(GT 3 (ADD s68 s69 s70 s71 s72 s73))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8908 reset in 240 ms.
Product exploration explored 100000 steps with 8963 reset in 222 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 246 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:13:22] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2023-03-22 01:13:22] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-22 01:13:22] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:13:22] [INFO ] [Nat]Absence check using 44 positive place invariants in 6 ms returned sat
[2023-03-22 01:13:23] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:13:23] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:23] [INFO ] After 28ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:13:23] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2023-03-22 01:13:23] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-22 01:13:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2023-03-22 01:13:23] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 01:13:23] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 24 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 354/354 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 170 transition count 348
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 164 transition count 348
Applied a total of 12 rules in 8 ms. Remains 164 /170 variables (removed 6) and now considering 348/354 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 164/170 places, 348/354 transitions.
Finished random walk after 9203 steps, including 2 resets, run visited all 1 properties in 20 ms. (steps per millisecond=460 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F p2), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 302 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2023-03-22 01:13:23] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:23] [INFO ] Invariant cache hit.
[2023-03-22 01:13:23] [INFO ] [Real]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-22 01:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:23] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-22 01:13:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:24] [INFO ] [Nat]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-22 01:13:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:24] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-22 01:13:24] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:24] [INFO ] [Nat]Added 36 Read/Feed constraints in 10 ms returned sat
[2023-03-22 01:13:24] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-22 01:13:24] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2023-03-22 01:13:24] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2023-03-22 01:13:24] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-22 01:13:24] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2023-03-22 01:13:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 298 ms
[2023-03-22 01:13:24] [INFO ] Computed and/alt/rep : 234/1176/234 causal constraints (skipped 24 transitions) in 16 ms.
[2023-03-22 01:13:25] [INFO ] Added : 148 causal constraints over 31 iterations in 589 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-22 01:13:25] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:25] [INFO ] Invariant cache hit.
[2023-03-22 01:13:25] [INFO ] [Real]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-22 01:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:25] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-22 01:13:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:25] [INFO ] [Nat]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-22 01:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:25] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-22 01:13:25] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:25] [INFO ] [Nat]Added 36 Read/Feed constraints in 10 ms returned sat
[2023-03-22 01:13:25] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 4 ms to minimize.
[2023-03-22 01:13:25] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2023-03-22 01:13:25] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2023-03-22 01:13:25] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2023-03-22 01:13:25] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:13:25] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2023-03-22 01:13:25] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2023-03-22 01:13:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 379 ms
[2023-03-22 01:13:25] [INFO ] Computed and/alt/rep : 234/1176/234 causal constraints (skipped 24 transitions) in 18 ms.
[2023-03-22 01:13:26] [INFO ] Added : 78 causal constraints over 17 iterations in 311 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 24 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 01:13:26] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:26] [INFO ] Invariant cache hit.
[2023-03-22 01:13:26] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-22 01:13:26] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:26] [INFO ] Invariant cache hit.
[2023-03-22 01:13:26] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:26] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2023-03-22 01:13:26] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:26] [INFO ] Invariant cache hit.
[2023-03-22 01:13:26] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 170/170 places, 354/354 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 206 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Finished random walk after 7559 steps, including 2 resets, run visited all 3 properties in 15 ms. (steps per millisecond=503 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (AND (NOT p1) (NOT p2) (NOT p0)))]
Knowledge based reduction with 7 factoid took 269 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2023-03-22 01:13:27] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:27] [INFO ] Invariant cache hit.
[2023-03-22 01:13:27] [INFO ] [Real]Absence check using 44 positive place invariants in 8 ms returned sat
[2023-03-22 01:13:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:27] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2023-03-22 01:13:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:27] [INFO ] [Nat]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-22 01:13:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:27] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-22 01:13:27] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:27] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2023-03-22 01:13:27] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2023-03-22 01:13:27] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2023-03-22 01:13:28] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2023-03-22 01:13:28] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2023-03-22 01:13:28] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2023-03-22 01:13:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 282 ms
[2023-03-22 01:13:28] [INFO ] Computed and/alt/rep : 234/1176/234 causal constraints (skipped 24 transitions) in 25 ms.
[2023-03-22 01:13:28] [INFO ] Added : 148 causal constraints over 31 iterations in 611 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-22 01:13:28] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:28] [INFO ] Invariant cache hit.
[2023-03-22 01:13:28] [INFO ] [Real]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-22 01:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:28] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-22 01:13:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:29] [INFO ] [Nat]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-22 01:13:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:29] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-22 01:13:29] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:29] [INFO ] [Nat]Added 36 Read/Feed constraints in 10 ms returned sat
[2023-03-22 01:13:29] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2023-03-22 01:13:29] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2023-03-22 01:13:29] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2023-03-22 01:13:29] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2023-03-22 01:13:29] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:13:29] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2023-03-22 01:13:29] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2023-03-22 01:13:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 375 ms
[2023-03-22 01:13:29] [INFO ] Computed and/alt/rep : 234/1176/234 causal constraints (skipped 24 transitions) in 15 ms.
[2023-03-22 01:13:29] [INFO ] Added : 78 causal constraints over 17 iterations in 303 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 8861 reset in 199 ms.
Product exploration explored 100000 steps with 8952 reset in 195 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Support contains 24 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 354/354 transitions.
Applied a total of 0 rules in 16 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 01:13:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:13:30] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:30] [INFO ] Invariant cache hit.
[2023-03-22 01:13:30] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 155 ms. Remains : 170/170 places, 354/354 transitions.
Support contains 24 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 354/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 01:13:30] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:30] [INFO ] Invariant cache hit.
[2023-03-22 01:13:30] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-22 01:13:30] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:30] [INFO ] Invariant cache hit.
[2023-03-22 01:13:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:31] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2023-03-22 01:13:31] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:31] [INFO ] Invariant cache hit.
[2023-03-22 01:13:31] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 400 ms. Remains : 170/170 places, 354/354 transitions.
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-14 finished in 9539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0&&X(!p0)) U G(p1)))))'
Support contains 48 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 01:13:31] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2023-03-22 01:13:31] [INFO ] Computed 50 place invariants in 1 ms
[2023-03-22 01:13:31] [INFO ] Implicit Places using invariants in 95 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 96 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (OR (NOT p1) p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(LEQ (ADD s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-15 finished in 273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
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 U (G(p0)||(p0&&(p1 U (p2||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((F(p0)&&X((p1 U p2)))))'
Found a Shortening insensitive property : LamportFastMutEx-COL-6-LTLCardinality-14
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Support contains 24 out of 176 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 6 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 01:13:31] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 01:13:31] [INFO ] Invariant cache hit.
[2023-03-22 01:13:32] [INFO ] Implicit Places using invariants in 98 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 102 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 170 transition count 348
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 164 transition count 348
Applied a total of 12 rules in 5 ms. Remains 164 /170 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2023-03-22 01:13:32] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2023-03-22 01:13:32] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-22 01:13:32] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-22 01:13:32] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:32] [INFO ] Invariant cache hit.
[2023-03-22 01:13:32] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:32] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 164/176 places, 348/354 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 427 ms. Remains : 164/176 places, 348/354 transitions.
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s50 s51 s52 s53 s54 s55)), p2:(LEQ (ADD s0 s1 s2 s3 s4 s5) (ADD s146 s147 s148 s149 s150 s151)), p1:(GT 3 (ADD s68 s69 s70 s71 s72 s73))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8872 reset in 199 ms.
Product exploration explored 100000 steps with 8923 reset in 215 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 271 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:13:33] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:33] [INFO ] Invariant cache hit.
[2023-03-22 01:13:33] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:13:33] [INFO ] [Nat]Absence check using 44 positive place invariants in 11 ms returned sat
[2023-03-22 01:13:33] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:13:33] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:33] [INFO ] After 27ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:13:33] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2023-03-22 01:13:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-22 01:13:33] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-22 01:13:33] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 24 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 164/164 places, 348/348 transitions.
Finished random walk after 3610 steps, including 1 resets, run visited all 1 properties in 9 ms. (steps per millisecond=401 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F p2), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 283 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2023-03-22 01:13:34] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:34] [INFO ] Invariant cache hit.
[2023-03-22 01:13:34] [INFO ] [Real]Absence check using 44 positive place invariants in 9 ms returned sat
[2023-03-22 01:13:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:34] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-22 01:13:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:34] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2023-03-22 01:13:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:34] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-22 01:13:34] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:34] [INFO ] [Nat]Added 36 Read/Feed constraints in 19 ms returned sat
[2023-03-22 01:13:34] [INFO ] Computed and/alt/rep : 222/1098/222 causal constraints (skipped 30 transitions) in 17 ms.
[2023-03-22 01:13:34] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:13:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-22 01:13:34] [INFO ] Added : 66 causal constraints over 14 iterations in 333 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-22 01:13:34] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:34] [INFO ] Invariant cache hit.
[2023-03-22 01:13:34] [INFO ] [Real]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-22 01:13:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:34] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-22 01:13:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:35] [INFO ] [Nat]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-22 01:13:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:35] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-03-22 01:13:35] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:35] [INFO ] [Nat]Added 36 Read/Feed constraints in 8 ms returned sat
[2023-03-22 01:13:35] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2023-03-22 01:13:35] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2023-03-22 01:13:35] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2023-03-22 01:13:35] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2023-03-22 01:13:35] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2023-03-22 01:13:35] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2023-03-22 01:13:35] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2023-03-22 01:13:35] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2023-03-22 01:13:35] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2023-03-22 01:13:35] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2023-03-22 01:13:35] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2023-03-22 01:13:35] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:13:36] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:13:36] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2023-03-22 01:13:36] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2023-03-22 01:13:36] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 0 ms to minimize.
[2023-03-22 01:13:36] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1047 ms
[2023-03-22 01:13:36] [INFO ] Computed and/alt/rep : 222/1098/222 causal constraints (skipped 30 transitions) in 13 ms.
[2023-03-22 01:13:36] [INFO ] Added : 179 causal constraints over 38 iterations in 735 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 24 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 1 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2023-03-22 01:13:36] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:36] [INFO ] Invariant cache hit.
[2023-03-22 01:13:37] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-22 01:13:37] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:37] [INFO ] Invariant cache hit.
[2023-03-22 01:13:37] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:37] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-22 01:13:37] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:37] [INFO ] Invariant cache hit.
[2023-03-22 01:13:37] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 445 ms. Remains : 164/164 places, 348/348 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 207 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:13:37] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:37] [INFO ] Invariant cache hit.
[2023-03-22 01:13:37] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:13:37] [INFO ] [Nat]Absence check using 44 positive place invariants in 6 ms returned sat
[2023-03-22 01:13:37] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:13:37] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:37] [INFO ] After 27ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:13:38] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2023-03-22 01:13:38] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2023-03-22 01:13:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2023-03-22 01:13:38] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-22 01:13:38] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 24 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 164/164 places, 348/348 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1468456 steps, run timeout after 3001 ms. (steps per millisecond=489 ) properties seen :{}
Probabilistic random walk after 1468456 steps, saw 466920 distinct states, run finished after 3001 ms. (steps per millisecond=489 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:13:41] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:41] [INFO ] Invariant cache hit.
[2023-03-22 01:13:41] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:13:41] [INFO ] [Nat]Absence check using 44 positive place invariants in 6 ms returned sat
[2023-03-22 01:13:41] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:13:41] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:41] [INFO ] After 25ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:13:41] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2023-03-22 01:13:41] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2023-03-22 01:13:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2023-03-22 01:13:41] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 01:13:41] [INFO ] After 313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 24 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 164/164 places, 348/348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2023-03-22 01:13:41] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:41] [INFO ] Invariant cache hit.
[2023-03-22 01:13:41] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-22 01:13:41] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:41] [INFO ] Invariant cache hit.
[2023-03-22 01:13:41] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:41] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-22 01:13:41] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 01:13:41] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:41] [INFO ] Invariant cache hit.
[2023-03-22 01:13:41] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 438 ms. Remains : 164/164 places, 348/348 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 164 transition count 258
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 90 place count 164 transition count 222
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 30 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 1 with 102 rules applied. Total rules applied 192 place count 98 transition count 222
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 204 place count 92 transition count 252
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 210 place count 92 transition count 246
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 216 place count 86 transition count 246
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 222 place count 86 transition count 246
Applied a total of 222 rules in 12 ms. Remains 86 /164 variables (removed 78) and now considering 246/348 (removed 102) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 246 rows 86 cols
[2023-03-22 01:13:41] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-22 01:13:41] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:13:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 01:13:42] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:13:42] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-22 01:13:42] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2)]
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2023-03-22 01:13:42] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2023-03-22 01:13:42] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-22 01:13:42] [INFO ] [Real]Absence check using 44 positive place invariants in 9 ms returned sat
[2023-03-22 01:13:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:42] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-22 01:13:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:42] [INFO ] [Nat]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-22 01:13:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:43] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-03-22 01:13:43] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:43] [INFO ] [Nat]Added 36 Read/Feed constraints in 16 ms returned sat
[2023-03-22 01:13:43] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2023-03-22 01:13:43] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2023-03-22 01:13:43] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2023-03-22 01:13:43] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2023-03-22 01:13:43] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2023-03-22 01:13:43] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2023-03-22 01:13:43] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2023-03-22 01:13:43] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2023-03-22 01:13:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 523 ms
[2023-03-22 01:13:43] [INFO ] Computed and/alt/rep : 222/1098/222 causal constraints (skipped 30 transitions) in 16 ms.
[2023-03-22 01:13:44] [INFO ] Added : 171 causal constraints over 35 iterations in 691 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-22 01:13:44] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:44] [INFO ] Invariant cache hit.
[2023-03-22 01:13:44] [INFO ] [Real]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-22 01:13:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:44] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-22 01:13:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:44] [INFO ] [Nat]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-22 01:13:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:44] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-22 01:13:44] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:44] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2023-03-22 01:13:44] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2023-03-22 01:13:44] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2023-03-22 01:13:44] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2023-03-22 01:13:44] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2023-03-22 01:13:45] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2023-03-22 01:13:45] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2023-03-22 01:13:45] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2023-03-22 01:13:45] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2023-03-22 01:13:45] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2023-03-22 01:13:45] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2023-03-22 01:13:45] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2023-03-22 01:13:45] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:13:45] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:13:45] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-22 01:13:45] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2023-03-22 01:13:45] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2023-03-22 01:13:45] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1043 ms
[2023-03-22 01:13:45] [INFO ] Computed and/alt/rep : 222/1098/222 causal constraints (skipped 30 transitions) in 13 ms.
[2023-03-22 01:13:46] [INFO ] Added : 179 causal constraints over 38 iterations in 739 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 8914 reset in 196 ms.
Product exploration explored 100000 steps with 8901 reset in 204 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Support contains 24 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2023-03-22 01:13:47] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 01:13:47] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:47] [INFO ] Invariant cache hit.
[2023-03-22 01:13:47] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 164/164 places, 348/348 transitions.
Support contains 24 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 1 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2023-03-22 01:13:47] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:47] [INFO ] Invariant cache hit.
[2023-03-22 01:13:47] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-22 01:13:47] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:47] [INFO ] Invariant cache hit.
[2023-03-22 01:13:47] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 01:13:47] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2023-03-22 01:13:47] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 01:13:47] [INFO ] Invariant cache hit.
[2023-03-22 01:13:47] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 414 ms. Remains : 164/164 places, 348/348 transitions.
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-14 finished in 15996 ms.
[2023-03-22 01:13:47] [INFO ] Flatten gal took : 20 ms
[2023-03-22 01:13:47] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-22 01:13:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 176 places, 354 transitions and 1536 arcs took 7 ms.
Total runtime 57492 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT LamportFastMutEx-COL-6
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality
FORMULA LamportFastMutEx-COL-6-LTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-COL-6-LTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-COL-6-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1679447628827
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 9 (type EXCL) for 0 LamportFastMutEx-COL-6-LTLCardinality-08
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 9 (type EXCL) for LamportFastMutEx-COL-6-LTLCardinality-08
lola: result : true
lola: markings : 10
lola: fired transitions : 10
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 LamportFastMutEx-COL-6-LTLCardinality-09
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for LamportFastMutEx-COL-6-LTLCardinality-09
lola: result : false
lola: markings : 10
lola: fired transitions : 10
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 LamportFastMutEx-COL-6-LTLCardinality-14
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for LamportFastMutEx-COL-6-LTLCardinality-14
lola: result : false
lola: markings : 15
lola: fired transitions : 15
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-6-LTLCardinality-08: F false state space / EG
LamportFastMutEx-COL-6-LTLCardinality-09: LTL false LTL model checker
LamportFastMutEx-COL-6-LTLCardinality-14: LTL false LTL model checker
Time elapsed: 0 secs. Pages in use: 1
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="LamportFastMutEx-COL-6"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is LamportFastMutEx-COL-6, 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 r231-tall-167856416000371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-6.tgz
mv LamportFastMutEx-COL-6 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 '
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 ;