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.r295-tall-167873948300699.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 PolyORBNT-COL-S10J60, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948300699
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 00:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 00:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 01:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 01:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 00:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 94K Mar 5 18:23 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 PolyORBNT-COL-S10J60-LTLCardinality-00
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-01
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-02
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-03
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-04
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-05
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-06
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-07
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-08
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-09
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678889914983

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=PolyORBNT-COL-S10J60
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 14:18:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 14:18:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 14:18:36] [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-15 14:18:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 14:18:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 662 ms
[2023-03-15 14:18:37] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 14:18:37] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2023-03-15 14:18:37] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10005 steps, including 567 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 31) seen :13
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :8
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 14:18:37] [INFO ] Computed 13 place invariants in 7 ms
[2023-03-15 14:18:37] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-15 14:18:37] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 14:18:37] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:1
[2023-03-15 14:18:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-15 14:18:37] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 14:18:37] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :1
[2023-03-15 14:18:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:18:37] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :7 sat :1
[2023-03-15 14:18:37] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-15 14:18:37] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :1
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 40 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 38 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 38 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 37 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 35 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 28
Applied a total of 27 rules in 17 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
// Phase 1: matrix 28 rows 34 cols
[2023-03-15 14:18:37] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-15 14:18:37] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 34/48 places, 28/38 transitions.
Incomplete random walk after 10004 steps, including 735 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10003 steps, including 298 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Probably explored full state space saw : 521 states, properties seen :0
Probabilistic random walk after 1393 steps, saw 521 distinct states, run finished after 18 ms. (steps per millisecond=77 ) properties seen :0
Explored full state space saw : 521 states, properties seen :0
Exhaustive walk after 1393 steps, saw 521 distinct states, run finished after 3 ms. (steps per millisecond=464 ) properties seen :0
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 14:18:38] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2023-03-15 14:18:38] [INFO ] Flatten gal took : 22 ms
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 14:18:38] [INFO ] Flatten gal took : 7 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-15 14:18:38] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 192 ms.
[2023-03-15 14:18:38] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Deduced a syphon composed of 60 places in 42 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 328 out of 1234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1224 transition count 2810
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 1223 transition count 2809
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1223 transition count 2809
Applied a total of 12 rules in 164 ms. Remains 1223 /1234 variables (removed 11) and now considering 2809/2810 (removed 1) transitions.
[2023-03-15 14:18:38] [INFO ] Flow matrix only has 2800 transitions (discarded 9 similar events)
// Phase 1: matrix 2800 rows 1223 cols
[2023-03-15 14:18:38] [INFO ] Computed 142 place invariants in 208 ms
[2023-03-15 14:18:40] [INFO ] Dead Transitions using invariants and state equation in 2155 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-15 14:18:40] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-15 14:18:40] [INFO ] Computed 142 place invariants in 78 ms
[2023-03-15 14:18:41] [INFO ] Implicit Places using invariants in 855 ms returned []
[2023-03-15 14:18:41] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:18:41] [INFO ] Invariant cache hit.
[2023-03-15 14:18:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:18:48] [INFO ] Implicit Places using invariants and state equation in 6970 ms returned []
Implicit Place search using SMT with State Equation took 7833 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1223/1234 places, 2194/2810 transitions.
Applied a total of 0 rules in 40 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10202 ms. Remains : 1223/1234 places, 2194/2810 transitions.
Support contains 328 out of 1223 places after structural reductions.
[2023-03-15 14:18:48] [INFO ] Flatten gal took : 185 ms
[2023-03-15 14:18:49] [INFO ] Flatten gal took : 140 ms
[2023-03-15 14:18:49] [INFO ] Input system was already deterministic with 2194 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-15 14:18:50] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:18:50] [INFO ] Invariant cache hit.
[2023-03-15 14:18:50] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-15 14:18:51] [INFO ] [Nat]Absence check using 136 positive place invariants in 43 ms returned sat
[2023-03-15 14:18:51] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 33 ms returned sat
[2023-03-15 14:18:53] [INFO ] After 2145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-15 14:18:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:18:55] [INFO ] After 2112ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-15 14:18:57] [INFO ] Deduced a trap composed of 19 places in 596 ms of which 2 ms to minimize.
[2023-03-15 14:18:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 741 ms
[2023-03-15 14:18:58] [INFO ] After 4735ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1675 ms.
[2023-03-15 14:19:00] [INFO ] After 9195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 23 ms.
Support contains 130 out of 1223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 1223 transition count 2132
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 125 place count 1161 transition count 2131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 1160 transition count 2131
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 126 place count 1160 transition count 2067
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 254 place count 1096 transition count 2067
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 258 place count 1094 transition count 2065
Applied a total of 258 rules in 248 ms. Remains 1094 /1223 variables (removed 129) and now considering 2065/2194 (removed 129) transitions.
[2023-03-15 14:19:00] [INFO ] Flow matrix only has 2056 transitions (discarded 9 similar events)
// Phase 1: matrix 2056 rows 1094 cols
[2023-03-15 14:19:00] [INFO ] Computed 142 place invariants in 46 ms
[2023-03-15 14:19:01] [INFO ] Dead Transitions using invariants and state equation in 1139 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1390 ms. Remains : 1094/1223 places, 2065/2194 transitions.
Finished random walk after 1990 steps, including 143 resets, run visited all 9 properties in 40 ms. (steps per millisecond=49 )
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 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((p0||X((G(p1) U (p0&&G(p1)))))))'
Support contains 134 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 26 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-15 14:19:01] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-15 14:19:01] [INFO ] Computed 142 place invariants in 62 ms
[2023-03-15 14:19:03] [INFO ] Dead Transitions using invariants and state equation in 1628 ms found 0 transitions.
[2023-03-15 14:19:03] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:19:03] [INFO ] Invariant cache hit.
[2023-03-15 14:19:04] [INFO ] Implicit Places using invariants in 914 ms returned []
[2023-03-15 14:19:04] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:19:04] [INFO ] Invariant cache hit.
[2023-03-15 14:19:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:19:10] [INFO ] Implicit Places using invariants and state equation in 5948 ms returned []
Implicit Place search using SMT with State Equation took 6864 ms to find 0 implicit places.
[2023-03-15 14:19:10] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:19:10] [INFO ] Invariant cache hit.
[2023-03-15 14:19:11] [INFO ] Dead Transitions using invariants and state equation in 1543 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10070 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT (ADD s384 s385 s386 s387 s388 s389 s390 s391 s392 s393) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 1 reset in 3 ms.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-00 finished in 10372 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((G(p0)||(p1&&G(F(p2)))))))'
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 36 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-15 14:19:12] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:19:12] [INFO ] Invariant cache hit.
[2023-03-15 14:19:13] [INFO ] Dead Transitions using invariants and state equation in 1504 ms found 0 transitions.
[2023-03-15 14:19:13] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:19:13] [INFO ] Invariant cache hit.
[2023-03-15 14:19:14] [INFO ] Implicit Places using invariants in 974 ms returned []
[2023-03-15 14:19:14] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:19:14] [INFO ] Invariant cache hit.
[2023-03-15 14:19:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:19:22] [INFO ] Implicit Places using invariants and state equation in 7726 ms returned []
Implicit Place search using SMT with State Equation took 8706 ms to find 0 implicit places.
[2023-03-15 14:19:22] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:19:22] [INFO ] Invariant cache hit.
[2023-03-15 14:19:23] [INFO ] Dead Transitions using invariants and state equation in 1537 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11798 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(LEQ s378 s1092), p2:(LEQ 2 s380), p1:(LEQ s1090 (ADD s315 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327 s328 s329 s330 s331 s332 s333 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 95519 steps with 5350 reset in 749 ms.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-02 finished in 12805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 61 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 39 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-15 14:19:24] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:19:24] [INFO ] Invariant cache hit.
[2023-03-15 14:19:26] [INFO ] Dead Transitions using invariants and state equation in 1571 ms found 0 transitions.
[2023-03-15 14:19:26] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:19:26] [INFO ] Invariant cache hit.
[2023-03-15 14:19:27] [INFO ] Implicit Places using invariants in 961 ms returned []
[2023-03-15 14:19:27] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:19:27] [INFO ] Invariant cache hit.
[2023-03-15 14:19:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:19:34] [INFO ] Implicit Places using invariants and state equation in 7416 ms returned []
Implicit Place search using SMT with State Equation took 8382 ms to find 0 implicit places.
[2023-03-15 14:19:34] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:19:34] [INFO ] Invariant cache hit.
[2023-03-15 14:19:36] [INFO ] Dead Transitions using invariants and state equation in 1489 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11488 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 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...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 3 ms.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-08 finished in 11606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F((G(F(p1))||(F(p1)&&X(p2))))))))'
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 31 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-15 14:19:36] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:19:36] [INFO ] Invariant cache hit.
[2023-03-15 14:19:38] [INFO ] Dead Transitions using invariants and state equation in 1570 ms found 0 transitions.
[2023-03-15 14:19:38] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:19:38] [INFO ] Invariant cache hit.
[2023-03-15 14:19:38] [INFO ] Implicit Places using invariants in 877 ms returned []
[2023-03-15 14:19:38] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:19:38] [INFO ] Invariant cache hit.
[2023-03-15 14:19:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:19:44] [INFO ] Implicit Places using invariants and state equation in 5875 ms returned []
Implicit Place search using SMT with State Equation took 6759 ms to find 0 implicit places.
[2023-03-15 14:19:44] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:19:44] [INFO ] Invariant cache hit.
[2023-03-15 14:19:46] [INFO ] Dead Transitions using invariants and state equation in 1453 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9840 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s313 (ADD s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25016 reset in 976 ms.
Product exploration explored 100000 steps with 25008 reset in 967 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 374 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 559 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 163953 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{1=1}
Probabilistic random walk after 163953 steps, saw 49361 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :1
Running SMT prover for 4 properties.
[2023-03-15 14:19:52] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:19:52] [INFO ] Invariant cache hit.
[2023-03-15 14:19:52] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 14:19:53] [INFO ] [Nat]Absence check using 136 positive place invariants in 36 ms returned sat
[2023-03-15 14:19:53] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 22 ms returned sat
[2023-03-15 14:19:54] [INFO ] After 1718ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 14:19:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:19:57] [INFO ] After 2840ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 14:19:58] [INFO ] Deduced a trap composed of 319 places in 559 ms of which 3 ms to minimize.
[2023-03-15 14:19:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 738 ms
[2023-03-15 14:20:03] [INFO ] After 9018ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3570 ms.
[2023-03-15 14:20:07] [INFO ] After 14668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 1223 transition count 2131
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 1160 transition count 2131
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 126 place count 1160 transition count 2066
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 256 place count 1095 transition count 2066
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 260 place count 1093 transition count 2064
Applied a total of 260 rules in 125 ms. Remains 1093 /1223 variables (removed 130) and now considering 2064/2194 (removed 130) transitions.
[2023-03-15 14:20:07] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-15 14:20:07] [INFO ] Computed 142 place invariants in 42 ms
[2023-03-15 14:20:08] [INFO ] Dead Transitions using invariants and state equation in 1055 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1185 ms. Remains : 1093/1223 places, 2064/2194 transitions.
Incomplete random walk after 10000 steps, including 732 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 78 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 118 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 14:20:09] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:20:09] [INFO ] Invariant cache hit.
[2023-03-15 14:20:09] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 14:20:09] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-15 14:20:09] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-15 14:20:10] [INFO ] After 1189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 14:20:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:20:11] [INFO ] After 722ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 14:20:11] [INFO ] Deduced a trap composed of 192 places in 411 ms of which 1 ms to minimize.
[2023-03-15 14:20:12] [INFO ] Deduced a trap composed of 201 places in 383 ms of which 1 ms to minimize.
[2023-03-15 14:20:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1021 ms
[2023-03-15 14:20:13] [INFO ] After 2412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 476 ms.
[2023-03-15 14:20:13] [INFO ] After 4321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 53 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Incomplete random walk after 10000 steps, including 724 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 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 117 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 280498 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 280498 steps, saw 46236 distinct states, run finished after 3003 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 14:20:16] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:20:16] [INFO ] Invariant cache hit.
[2023-03-15 14:20:16] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 14:20:17] [INFO ] [Nat]Absence check using 135 positive place invariants in 30 ms returned sat
[2023-03-15 14:20:17] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-15 14:20:18] [INFO ] After 1211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 14:20:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:20:19] [INFO ] After 717ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 14:20:19] [INFO ] Deduced a trap composed of 192 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:20:20] [INFO ] Deduced a trap composed of 201 places in 418 ms of which 1 ms to minimize.
[2023-03-15 14:20:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1026 ms
[2023-03-15 14:20:20] [INFO ] After 2401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 472 ms.
[2023-03-15 14:20:21] [INFO ] After 4328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 51 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 51 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-15 14:20:21] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:20:21] [INFO ] Invariant cache hit.
[2023-03-15 14:20:22] [INFO ] Implicit Places using invariants in 742 ms returned []
[2023-03-15 14:20:22] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:20:22] [INFO ] Invariant cache hit.
[2023-03-15 14:20:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:20:27] [INFO ] Implicit Places using invariants and state equation in 4925 ms returned []
Implicit Place search using SMT with State Equation took 5670 ms to find 0 implicit places.
[2023-03-15 14:20:27] [INFO ] Redundant transitions in 99 ms returned []
[2023-03-15 14:20:27] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:20:27] [INFO ] Invariant cache hit.
[2023-03-15 14:20:28] [INFO ] Dead Transitions using invariants and state equation in 1080 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6910 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1093 transition count 2055
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 1093 transition count 2054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 1092 transition count 2054
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 21 place count 1092 transition count 2044
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 31 place count 1082 transition count 2044
Applied a total of 31 rules in 172 ms. Remains 1082 /1093 variables (removed 11) and now considering 2044/2064 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2044 rows 1082 cols
[2023-03-15 14:20:28] [INFO ] Computed 142 place invariants in 34 ms
[2023-03-15 14:20:28] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 14:20:28] [INFO ] [Nat]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-15 14:20:28] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-15 14:20:29] [INFO ] After 962ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 14:20:30] [INFO ] Deduced a trap composed of 218 places in 316 ms of which 1 ms to minimize.
[2023-03-15 14:20:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 478 ms
[2023-03-15 14:20:31] [INFO ] After 2333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 443 ms.
[2023-03-15 14:20:31] [INFO ] After 3011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (NOT p1)), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 497 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 38 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-15 14:20:32] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-15 14:20:32] [INFO ] Computed 142 place invariants in 44 ms
[2023-03-15 14:20:34] [INFO ] Dead Transitions using invariants and state equation in 1639 ms found 0 transitions.
[2023-03-15 14:20:34] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:20:34] [INFO ] Invariant cache hit.
[2023-03-15 14:20:35] [INFO ] Implicit Places using invariants in 866 ms returned []
[2023-03-15 14:20:35] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:20:35] [INFO ] Invariant cache hit.
[2023-03-15 14:20:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:20:41] [INFO ] Implicit Places using invariants and state equation in 6151 ms returned []
Implicit Place search using SMT with State Equation took 7019 ms to find 0 implicit places.
[2023-03-15 14:20:41] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:20:41] [INFO ] Invariant cache hit.
[2023-03-15 14:20:42] [INFO ] Dead Transitions using invariants and state equation in 1519 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10217 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 505 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 560 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 167819 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{1=1}
Probabilistic random walk after 167819 steps, saw 50573 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :1
Running SMT prover for 4 properties.
[2023-03-15 14:20:46] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:20:46] [INFO ] Invariant cache hit.
[2023-03-15 14:20:47] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 14:20:47] [INFO ] [Nat]Absence check using 136 positive place invariants in 36 ms returned sat
[2023-03-15 14:20:47] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 24 ms returned sat
[2023-03-15 14:20:49] [INFO ] After 1834ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 14:20:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:20:52] [INFO ] After 3063ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 14:20:53] [INFO ] Deduced a trap composed of 319 places in 531 ms of which 1 ms to minimize.
[2023-03-15 14:20:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 709 ms
[2023-03-15 14:20:58] [INFO ] After 9474ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3403 ms.
[2023-03-15 14:21:02] [INFO ] After 15065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 1223 transition count 2131
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 1160 transition count 2131
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 126 place count 1160 transition count 2066
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 256 place count 1095 transition count 2066
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 260 place count 1093 transition count 2064
Applied a total of 260 rules in 130 ms. Remains 1093 /1223 variables (removed 130) and now considering 2064/2194 (removed 130) transitions.
[2023-03-15 14:21:02] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-15 14:21:02] [INFO ] Computed 142 place invariants in 48 ms
[2023-03-15 14:21:03] [INFO ] Dead Transitions using invariants and state equation in 1225 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1357 ms. Remains : 1093/1223 places, 2064/2194 transitions.
Incomplete random walk after 10000 steps, including 739 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 14:21:03] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:21:03] [INFO ] Invariant cache hit.
[2023-03-15 14:21:04] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 14:21:04] [INFO ] [Nat]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-15 14:21:04] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-15 14:21:05] [INFO ] After 1165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 14:21:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:21:06] [INFO ] After 717ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 14:21:06] [INFO ] Deduced a trap composed of 192 places in 374 ms of which 1 ms to minimize.
[2023-03-15 14:21:07] [INFO ] Deduced a trap composed of 201 places in 387 ms of which 1 ms to minimize.
[2023-03-15 14:21:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 968 ms
[2023-03-15 14:21:07] [INFO ] After 2301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 448 ms.
[2023-03-15 14:21:08] [INFO ] After 4158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 57 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Incomplete random walk after 10000 steps, including 726 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 275365 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 275365 steps, saw 45431 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 14:21:11] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:21:11] [INFO ] Invariant cache hit.
[2023-03-15 14:21:11] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 14:21:11] [INFO ] [Nat]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-15 14:21:11] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-15 14:21:13] [INFO ] After 1121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 14:21:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:21:13] [INFO ] After 672ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 14:21:14] [INFO ] Deduced a trap composed of 192 places in 407 ms of which 1 ms to minimize.
[2023-03-15 14:21:14] [INFO ] Deduced a trap composed of 201 places in 416 ms of which 0 ms to minimize.
[2023-03-15 14:21:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1042 ms
[2023-03-15 14:21:15] [INFO ] After 2337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 462 ms.
[2023-03-15 14:21:15] [INFO ] After 4162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 51 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 68 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-15 14:21:16] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:21:16] [INFO ] Invariant cache hit.
[2023-03-15 14:21:16] [INFO ] Implicit Places using invariants in 794 ms returned []
[2023-03-15 14:21:16] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:21:16] [INFO ] Invariant cache hit.
[2023-03-15 14:21:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:21:22] [INFO ] Implicit Places using invariants and state equation in 5801 ms returned []
Implicit Place search using SMT with State Equation took 6606 ms to find 0 implicit places.
[2023-03-15 14:21:22] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-15 14:21:22] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:21:22] [INFO ] Invariant cache hit.
[2023-03-15 14:21:23] [INFO ] Dead Transitions using invariants and state equation in 1024 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7811 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1093 transition count 2055
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 1093 transition count 2054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 1092 transition count 2054
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 21 place count 1092 transition count 2044
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 31 place count 1082 transition count 2044
Applied a total of 31 rules in 158 ms. Remains 1082 /1093 variables (removed 11) and now considering 2044/2064 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2044 rows 1082 cols
[2023-03-15 14:21:23] [INFO ] Computed 142 place invariants in 37 ms
[2023-03-15 14:21:24] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 14:21:24] [INFO ] [Nat]Absence check using 135 positive place invariants in 41 ms returned sat
[2023-03-15 14:21:24] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 14:21:25] [INFO ] After 1008ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 14:21:26] [INFO ] Deduced a trap composed of 218 places in 322 ms of which 1 ms to minimize.
[2023-03-15 14:21:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 487 ms
[2023-03-15 14:21:26] [INFO ] After 2377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 429 ms.
[2023-03-15 14:21:27] [INFO ] After 3054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (NOT p1)), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 452 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Product exploration explored 100000 steps with 33244 reset in 894 ms.
Product exploration explored 100000 steps with 33258 reset in 906 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 1223 transition count 2194
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 63 place count 1223 transition count 2195
Deduced a syphon composed of 65 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 1223 transition count 2195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1222 transition count 2194
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1222 transition count 2194
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 129 places in 0 ms
Iterating global reduction 1 with 65 rules applied. Total rules applied 132 place count 1222 transition count 2194
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 193 place count 1161 transition count 2133
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 254 place count 1161 transition count 2133
Deduced a syphon composed of 68 places in 0 ms
Applied a total of 254 rules in 369 ms. Remains 1161 /1223 variables (removed 62) and now considering 2133/2194 (removed 61) transitions.
[2023-03-15 14:21:30] [INFO ] Flow matrix only has 2124 transitions (discarded 9 similar events)
// Phase 1: matrix 2124 rows 1161 cols
[2023-03-15 14:21:30] [INFO ] Computed 142 place invariants in 37 ms
[2023-03-15 14:21:32] [INFO ] Dead Transitions using invariants and state equation in 2267 ms found 0 transitions.
[2023-03-15 14:21:32] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-15 14:21:32] [INFO ] Flow matrix only has 2124 transitions (discarded 9 similar events)
[2023-03-15 14:21:32] [INFO ] Invariant cache hit.
[2023-03-15 14:21:35] [INFO ] Dead Transitions using invariants and state equation in 2246 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1161/1223 places, 2133/2194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4937 ms. Remains : 1161/1223 places, 2133/2194 transitions.
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 35 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-15 14:21:35] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-15 14:21:35] [INFO ] Computed 142 place invariants in 39 ms
[2023-03-15 14:21:36] [INFO ] Dead Transitions using invariants and state equation in 1649 ms found 0 transitions.
[2023-03-15 14:21:36] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:21:36] [INFO ] Invariant cache hit.
[2023-03-15 14:21:37] [INFO ] Implicit Places using invariants in 883 ms returned []
[2023-03-15 14:21:37] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:21:37] [INFO ] Invariant cache hit.
[2023-03-15 14:21:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:21:43] [INFO ] Implicit Places using invariants and state equation in 5596 ms returned []
Implicit Place search using SMT with State Equation took 6506 ms to find 0 implicit places.
[2023-03-15 14:21:43] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:21:43] [INFO ] Invariant cache hit.
[2023-03-15 14:21:44] [INFO ] Dead Transitions using invariants and state equation in 1548 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9750 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-10 finished in 128829 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&&F(p1))))'
Support contains 3 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 1223 transition count 2131
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 1160 transition count 2130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 1159 transition count 2130
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 128 place count 1159 transition count 2066
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 256 place count 1095 transition count 2066
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 260 place count 1093 transition count 2064
Applied a total of 260 rules in 159 ms. Remains 1093 /1223 variables (removed 130) and now considering 2064/2194 (removed 130) transitions.
[2023-03-15 14:21:45] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-15 14:21:45] [INFO ] Computed 142 place invariants in 53 ms
[2023-03-15 14:21:46] [INFO ] Dead Transitions using invariants and state equation in 1074 ms found 0 transitions.
[2023-03-15 14:21:46] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:21:46] [INFO ] Invariant cache hit.
[2023-03-15 14:21:47] [INFO ] Implicit Places using invariants in 808 ms returned []
[2023-03-15 14:21:47] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:21:47] [INFO ] Invariant cache hit.
[2023-03-15 14:21:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:21:55] [INFO ] Implicit Places using invariants and state equation in 7762 ms returned []
Implicit Place search using SMT with State Equation took 8575 ms to find 0 implicit places.
[2023-03-15 14:21:55] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-15 14:21:55] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:21:55] [INFO ] Invariant cache hit.
[2023-03-15 14:21:56] [INFO ] Dead Transitions using invariants and state equation in 1068 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1093/1223 places, 2064/2194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10943 ms. Remains : 1093/1223 places, 2064/2194 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ 1 s314), p0:(LEQ s313 s376)], 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, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-14 finished in 11044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||p0))))'
Support contains 3 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 46 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-15 14:21:56] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-15 14:21:56] [INFO ] Computed 142 place invariants in 41 ms
[2023-03-15 14:21:57] [INFO ] Dead Transitions using invariants and state equation in 1613 ms found 0 transitions.
[2023-03-15 14:21:58] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:21:58] [INFO ] Invariant cache hit.
[2023-03-15 14:21:58] [INFO ] Implicit Places using invariants in 964 ms returned []
[2023-03-15 14:21:58] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:21:58] [INFO ] Invariant cache hit.
[2023-03-15 14:21:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:22:05] [INFO ] Implicit Places using invariants and state equation in 6297 ms returned []
Implicit Place search using SMT with State Equation took 7263 ms to find 0 implicit places.
[2023-03-15 14:22:05] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-15 14:22:05] [INFO ] Invariant cache hit.
[2023-03-15 14:22:06] [INFO ] Dead Transitions using invariants and state equation in 1501 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10426 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GT 1 s394) (LEQ 2 s383)), p1:(GT 2 s379)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 849 ms.
Product exploration explored 100000 steps with 33333 reset in 877 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-15 finished in 12385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F((G(F(p1))||(F(p1)&&X(p2))))))))'
Found a Lengthening insensitive property : PolyORBNT-COL-S10J60-LTLCardinality-10
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 1223 transition count 2131
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 1160 transition count 2131
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 126 place count 1160 transition count 2066
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 256 place count 1095 transition count 2066
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 260 place count 1093 transition count 2064
Applied a total of 260 rules in 120 ms. Remains 1093 /1223 variables (removed 130) and now considering 2064/2194 (removed 130) transitions.
[2023-03-15 14:22:09] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-15 14:22:09] [INFO ] Computed 142 place invariants in 39 ms
[2023-03-15 14:22:10] [INFO ] Dead Transitions using invariants and state equation in 1135 ms found 0 transitions.
[2023-03-15 14:22:10] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:22:10] [INFO ] Invariant cache hit.
[2023-03-15 14:22:11] [INFO ] Implicit Places using invariants in 782 ms returned []
[2023-03-15 14:22:11] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:22:11] [INFO ] Invariant cache hit.
[2023-03-15 14:22:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:22:17] [INFO ] Implicit Places using invariants and state equation in 6529 ms returned []
Implicit Place search using SMT with State Equation took 7335 ms to find 0 implicit places.
[2023-03-15 14:22:17] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:22:17] [INFO ] Invariant cache hit.
[2023-03-15 14:22:18] [INFO ] Dead Transitions using invariants and state equation in 1051 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1093/1223 places, 2064/2194 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9647 ms. Remains : 1093/1223 places, 2064/2194 transitions.
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s313 (ADD s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25089 reset in 942 ms.
Product exploration explored 100000 steps with 24965 reset in 976 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 352 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 735 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 14:22:21] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:22:21] [INFO ] Invariant cache hit.
[2023-03-15 14:22:21] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 14:22:21] [INFO ] [Nat]Absence check using 135 positive place invariants in 29 ms returned sat
[2023-03-15 14:22:21] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 14:22:22] [INFO ] After 1107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 14:22:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:22:23] [INFO ] After 663ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 14:22:24] [INFO ] Deduced a trap composed of 192 places in 430 ms of which 1 ms to minimize.
[2023-03-15 14:22:24] [INFO ] Deduced a trap composed of 201 places in 379 ms of which 1 ms to minimize.
[2023-03-15 14:22:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1011 ms
[2023-03-15 14:22:25] [INFO ] After 2334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 441 ms.
[2023-03-15 14:22:25] [INFO ] After 4106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 46 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-15 14:22:25] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:22:25] [INFO ] Invariant cache hit.
[2023-03-15 14:22:26] [INFO ] Dead Transitions using invariants and state equation in 1031 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1079 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Incomplete random walk after 10000 steps, including 729 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 277058 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 277058 steps, saw 45717 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 14:22:30] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:22:30] [INFO ] Invariant cache hit.
[2023-03-15 14:22:30] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 14:22:30] [INFO ] [Nat]Absence check using 135 positive place invariants in 29 ms returned sat
[2023-03-15 14:22:30] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 34 ms returned sat
[2023-03-15 14:22:31] [INFO ] After 1102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 14:22:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:22:32] [INFO ] After 660ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 14:22:32] [INFO ] Deduced a trap composed of 192 places in 392 ms of which 1 ms to minimize.
[2023-03-15 14:22:33] [INFO ] Deduced a trap composed of 201 places in 404 ms of which 1 ms to minimize.
[2023-03-15 14:22:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1000 ms
[2023-03-15 14:22:33] [INFO ] After 2272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 437 ms.
[2023-03-15 14:22:34] [INFO ] After 4067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 44 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 43 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-15 14:22:34] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:22:34] [INFO ] Invariant cache hit.
[2023-03-15 14:22:35] [INFO ] Implicit Places using invariants in 767 ms returned []
[2023-03-15 14:22:35] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:22:35] [INFO ] Invariant cache hit.
[2023-03-15 14:22:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:22:41] [INFO ] Implicit Places using invariants and state equation in 6169 ms returned []
Implicit Place search using SMT with State Equation took 6938 ms to find 0 implicit places.
[2023-03-15 14:22:41] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-15 14:22:41] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:22:41] [INFO ] Invariant cache hit.
[2023-03-15 14:22:42] [INFO ] Dead Transitions using invariants and state equation in 1034 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8068 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1093 transition count 2055
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 1093 transition count 2054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 1092 transition count 2054
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 21 place count 1092 transition count 2044
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 31 place count 1082 transition count 2044
Applied a total of 31 rules in 152 ms. Remains 1082 /1093 variables (removed 11) and now considering 2044/2064 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2044 rows 1082 cols
[2023-03-15 14:22:42] [INFO ] Computed 142 place invariants in 38 ms
[2023-03-15 14:22:42] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 14:22:42] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-15 14:22:42] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 14:22:43] [INFO ] After 969ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 14:22:44] [INFO ] Deduced a trap composed of 218 places in 341 ms of which 0 ms to minimize.
[2023-03-15 14:22:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 503 ms
[2023-03-15 14:22:45] [INFO ] After 2300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 413 ms.
[2023-03-15 14:22:45] [INFO ] After 2951ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (NOT p1)), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 552 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 27 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-15 14:22:46] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-15 14:22:46] [INFO ] Computed 142 place invariants in 38 ms
[2023-03-15 14:22:47] [INFO ] Dead Transitions using invariants and state equation in 1104 ms found 0 transitions.
[2023-03-15 14:22:47] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:22:47] [INFO ] Invariant cache hit.
[2023-03-15 14:22:48] [INFO ] Implicit Places using invariants in 800 ms returned []
[2023-03-15 14:22:48] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:22:48] [INFO ] Invariant cache hit.
[2023-03-15 14:22:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:22:54] [INFO ] Implicit Places using invariants and state equation in 5934 ms returned []
Implicit Place search using SMT with State Equation took 6737 ms to find 0 implicit places.
[2023-03-15 14:22:54] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:22:54] [INFO ] Invariant cache hit.
[2023-03-15 14:22:55] [INFO ] Dead Transitions using invariants and state equation in 1027 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8901 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 409 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 736 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 96 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 116 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 14:22:56] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:22:56] [INFO ] Invariant cache hit.
[2023-03-15 14:22:56] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 14:22:56] [INFO ] [Nat]Absence check using 135 positive place invariants in 28 ms returned sat
[2023-03-15 14:22:56] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 14:22:57] [INFO ] After 1124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 14:22:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:22:58] [INFO ] After 670ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 14:22:59] [INFO ] Deduced a trap composed of 192 places in 408 ms of which 1 ms to minimize.
[2023-03-15 14:22:59] [INFO ] Deduced a trap composed of 201 places in 403 ms of which 1 ms to minimize.
[2023-03-15 14:22:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1020 ms
[2023-03-15 14:23:00] [INFO ] After 2318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 444 ms.
[2023-03-15 14:23:00] [INFO ] After 4120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 57 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-15 14:23:00] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:23:00] [INFO ] Invariant cache hit.
[2023-03-15 14:23:01] [INFO ] Dead Transitions using invariants and state equation in 1071 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1129 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Incomplete random walk after 10000 steps, including 730 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 281935 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 281935 steps, saw 46457 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 14:23:05] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:23:05] [INFO ] Invariant cache hit.
[2023-03-15 14:23:05] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 14:23:05] [INFO ] [Nat]Absence check using 135 positive place invariants in 30 ms returned sat
[2023-03-15 14:23:05] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-15 14:23:06] [INFO ] After 1107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 14:23:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:23:07] [INFO ] After 664ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 14:23:07] [INFO ] Deduced a trap composed of 192 places in 421 ms of which 4 ms to minimize.
[2023-03-15 14:23:08] [INFO ] Deduced a trap composed of 201 places in 376 ms of which 1 ms to minimize.
[2023-03-15 14:23:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1009 ms
[2023-03-15 14:23:08] [INFO ] After 2287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 445 ms.
[2023-03-15 14:23:09] [INFO ] After 4097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 47 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 51 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-15 14:23:09] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:23:09] [INFO ] Invariant cache hit.
[2023-03-15 14:23:10] [INFO ] Implicit Places using invariants in 784 ms returned []
[2023-03-15 14:23:10] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:23:10] [INFO ] Invariant cache hit.
[2023-03-15 14:23:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:23:15] [INFO ] Implicit Places using invariants and state equation in 4844 ms returned []
Implicit Place search using SMT with State Equation took 5629 ms to find 0 implicit places.
[2023-03-15 14:23:15] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-15 14:23:15] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:23:15] [INFO ] Invariant cache hit.
[2023-03-15 14:23:16] [INFO ] Dead Transitions using invariants and state equation in 1057 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6779 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1093 transition count 2055
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 1093 transition count 2054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 1092 transition count 2054
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 21 place count 1092 transition count 2044
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 31 place count 1082 transition count 2044
Applied a total of 31 rules in 149 ms. Remains 1082 /1093 variables (removed 11) and now considering 2044/2064 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2044 rows 1082 cols
[2023-03-15 14:23:16] [INFO ] Computed 142 place invariants in 40 ms
[2023-03-15 14:23:16] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 14:23:16] [INFO ] [Nat]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-15 14:23:16] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-15 14:23:17] [INFO ] After 977ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 14:23:18] [INFO ] Deduced a trap composed of 218 places in 335 ms of which 1 ms to minimize.
[2023-03-15 14:23:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 494 ms
[2023-03-15 14:23:19] [INFO ] After 2296ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 419 ms.
[2023-03-15 14:23:19] [INFO ] After 2951ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (NOT p1)), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 395 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Product exploration explored 100000 steps with 33340 reset in 936 ms.
Product exploration explored 100000 steps with 33436 reset in 939 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 49 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-15 14:23:22] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-15 14:23:22] [INFO ] Computed 142 place invariants in 41 ms
[2023-03-15 14:23:23] [INFO ] Dead Transitions using invariants and state equation in 1119 ms found 0 transitions.
[2023-03-15 14:23:23] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-15 14:23:23] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:23:23] [INFO ] Invariant cache hit.
[2023-03-15 14:23:24] [INFO ] Dead Transitions using invariants and state equation in 1046 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2262 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 26 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-15 14:23:24] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:23:24] [INFO ] Invariant cache hit.
[2023-03-15 14:23:25] [INFO ] Dead Transitions using invariants and state equation in 1021 ms found 0 transitions.
[2023-03-15 14:23:25] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:23:25] [INFO ] Invariant cache hit.
[2023-03-15 14:23:26] [INFO ] Implicit Places using invariants in 792 ms returned []
[2023-03-15 14:23:26] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:23:26] [INFO ] Invariant cache hit.
[2023-03-15 14:23:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:23:32] [INFO ] Implicit Places using invariants and state equation in 5602 ms returned []
Implicit Place search using SMT with State Equation took 6396 ms to find 0 implicit places.
[2023-03-15 14:23:32] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-15 14:23:32] [INFO ] Invariant cache hit.
[2023-03-15 14:23:33] [INFO ] Dead Transitions using invariants and state equation in 1024 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8469 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-10 finished in 84528 ms.
[2023-03-15 14:23:33] [INFO ] Flatten gal took : 96 ms
[2023-03-15 14:23:33] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-15 14:23:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1223 places, 2194 transitions and 12082 arcs took 18 ms.
Total runtime 296993 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBNT-COL-S10J60
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

BK_STOP 1678890269430

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 PolyORBNT-COL-S10J60-LTLCardinality-10
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J60-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 3/32 PolyORBNT-COL-S10J60-LTLCardinality-10 130544 m, 26108 m/sec, 715087 t fired, .

Time elapsed: 5 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J60-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 6/32 PolyORBNT-COL-S10J60-LTLCardinality-10 273029 m, 28497 m/sec, 1497539 t fired, .

Time elapsed: 10 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J60-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 9/32 PolyORBNT-COL-S10J60-LTLCardinality-10 418890 m, 29172 m/sec, 2273461 t fired, .

Time elapsed: 15 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J60-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 12/32 PolyORBNT-COL-S10J60-LTLCardinality-10 560181 m, 28258 m/sec, 3021538 t fired, .

Time elapsed: 20 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J60-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 15/32 PolyORBNT-COL-S10J60-LTLCardinality-10 702531 m, 28470 m/sec, 3759858 t fired, .

Time elapsed: 25 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J60-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 19/32 PolyORBNT-COL-S10J60-LTLCardinality-10 845939 m, 28681 m/sec, 4474212 t fired, .

Time elapsed: 30 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J60-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 22/32 PolyORBNT-COL-S10J60-LTLCardinality-10 992000 m, 29212 m/sec, 5202680 t fired, .

Time elapsed: 35 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J60-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 25/32 PolyORBNT-COL-S10J60-LTLCardinality-10 1135719 m, 28743 m/sec, 5916909 t fired, .

Time elapsed: 40 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J60-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 28/32 PolyORBNT-COL-S10J60-LTLCardinality-10 1281619 m, 29180 m/sec, 6644461 t fired, .

Time elapsed: 45 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J60-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 31/32 PolyORBNT-COL-S10J60-LTLCardinality-10 1425361 m, 28748 m/sec, 7358843 t fired, .

Time elapsed: 50 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for PolyORBNT-COL-S10J60-LTLCardinality-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J60-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S10J60-LTLCardinality-10: LTL unknown AGGR


Time elapsed: 55 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J60"
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 PolyORBNT-COL-S10J60, 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 r295-tall-167873948300699"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J60.tgz
mv PolyORBNT-COL-S10J60 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;