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-167873947900444.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 PolyORBLF-COL-S06J04T04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947900444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 13:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 14:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 14:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 14:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 14:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S06J04T04-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678844412077

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 01:40:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 01:40:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 01:40:13] [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 01:40:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 01:40:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 698 ms
[2023-03-15 01:40:14] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 454 PT places and 7036.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 01:40:14] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2023-03-15 01:40:14] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 968 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 27) seen :10
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 17) seen :10
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-15 01:40:14] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-15 01:40:14] [INFO ] Computed 26 place invariants in 9 ms
[2023-03-15 01:40:15] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-15 01:40:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-15 01:40:15] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 01:40:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 01:40:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 01:40:15] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 01:40:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-15 01:40:15] [INFO ] After 30ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 01:40:15] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-15 01:40:15] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
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 25 place count 68 transition count 53
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 24 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
[2023-03-15 01:40:15] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2023-03-15 01:40:15] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-15 01:40:15] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 60/81 places, 45/65 transitions.
Incomplete random walk after 10005 steps, including 1092 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished Best-First random walk after 111 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=111 )
[2023-03-15 01:40:15] [INFO ] Flatten gal took : 37 ms
[2023-03-15 01:40:15] [INFO ] Flatten gal took : 9 ms
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2023-03-15 01:40:15] [INFO ] Unfolded HLPN to a Petri net with 454 places and 6994 transitions 59152 arcs in 158 ms.
[2023-03-15 01:40:15] [INFO ] Unfolded 12 HLPN properties in 1 ms.
[2023-03-15 01:40:15] [INFO ] Reduced 640 identical enabling conditions.
[2023-03-15 01:40:15] [INFO ] Reduced 640 identical enabling conditions.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 196 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 448 transition count 1614
Applied a total of 6 rules in 119 ms. Remains 448 /454 variables (removed 6) and now considering 1614/1614 (removed 0) transitions.
[2023-03-15 01:40:15] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 448 cols
[2023-03-15 01:40:15] [INFO ] Computed 44 place invariants in 62 ms
[2023-03-15 01:40:17] [INFO ] Dead Transitions using invariants and state equation in 1360 ms found 612 transitions.
Found 612 dead transitions using SMT.
Drop transitions removed 612 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 612 transitions.
[2023-03-15 01:40:17] [INFO ] Flow matrix only has 978 transitions (discarded 24 similar events)
// Phase 1: matrix 978 rows 448 cols
[2023-03-15 01:40:17] [INFO ] Computed 44 place invariants in 39 ms
[2023-03-15 01:40:17] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-15 01:40:17] [INFO ] Flow matrix only has 978 transitions (discarded 24 similar events)
[2023-03-15 01:40:17] [INFO ] Invariant cache hit.
[2023-03-15 01:40:18] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 01:40:22] [INFO ] Implicit Places using invariants and state equation in 5044 ms returned []
Implicit Place search using SMT with State Equation took 5389 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 448/454 places, 1002/1614 transitions.
Applied a total of 0 rules in 28 ms. Remains 448 /448 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6901 ms. Remains : 448/454 places, 1002/1614 transitions.
Support contains 196 out of 448 places after structural reductions.
[2023-03-15 01:40:22] [INFO ] Flatten gal took : 121 ms
[2023-03-15 01:40:23] [INFO ] Flatten gal took : 106 ms
[2023-03-15 01:40:23] [INFO ] Input system was already deterministic with 1002 transitions.
Finished random walk after 1658 steps, including 6 resets, run visited all 27 properties in 141 ms. (steps per millisecond=11 )
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' '!((F(p0)&&(F(G(p1)) U p2)))'
Support contains 17 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 1002/1002 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 448 transition count 986
Reduce places removed 16 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 20 rules applied. Total rules applied 36 place count 432 transition count 982
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 40 place count 428 transition count 982
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 40 place count 428 transition count 926
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 152 place count 372 transition count 926
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 156 place count 368 transition count 922
Iterating global reduction 3 with 4 rules applied. Total rules applied 160 place count 368 transition count 922
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 224 place count 336 transition count 890
Applied a total of 224 rules in 157 ms. Remains 336 /448 variables (removed 112) and now considering 890/1002 (removed 112) transitions.
[2023-03-15 01:40:24] [INFO ] Flow matrix only has 866 transitions (discarded 24 similar events)
// Phase 1: matrix 866 rows 336 cols
[2023-03-15 01:40:24] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-15 01:40:24] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
[2023-03-15 01:40:24] [INFO ] Flow matrix only has 866 transitions (discarded 24 similar events)
[2023-03-15 01:40:24] [INFO ] Invariant cache hit.
[2023-03-15 01:40:24] [INFO ] Implicit Places using invariants in 236 ms returned [286, 287, 288, 289]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 240 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 332/448 places, 890/1002 transitions.
Applied a total of 0 rules in 18 ms. Remains 332 /332 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 850 ms. Remains : 332/448 places, 890/1002 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (OR (LT s133 1) (LT s291 1)) (OR (LT s132 1) (LT s291 1)) (OR (LT s134 1) (LT s291 1)) (OR (LT s131 1) (LT s291 1))) (AND (GEQ s6 1) (GEQ s64 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 198 steps with 0 reset in 5 ms.
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T04-LTLFireability-00 finished in 1191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F((!p1 U (p2||G(!p1)))))))'
Support contains 50 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1002/1002 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 444 transition count 998
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 444 transition count 998
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 440 transition count 994
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 440 transition count 994
Applied a total of 16 rules in 15 ms. Remains 440 /448 variables (removed 8) and now considering 994/1002 (removed 8) transitions.
[2023-03-15 01:40:25] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
// Phase 1: matrix 970 rows 440 cols
[2023-03-15 01:40:25] [INFO ] Computed 44 place invariants in 16 ms
[2023-03-15 01:40:25] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
[2023-03-15 01:40:25] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:40:25] [INFO ] Invariant cache hit.
[2023-03-15 01:40:25] [INFO ] Implicit Places using invariants in 279 ms returned [354, 355, 356, 357]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 281 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 436/448 places, 994/1002 transitions.
Applied a total of 0 rules in 5 ms. Remains 436 /436 variables (removed 0) and now considering 994/994 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 715 ms. Remains : 436/448 places, 994/1002 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1), true]
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (NOT (OR (AND (GEQ s83 1) (GEQ s85 1) (GEQ s131 1)) (AND (GEQ s83 1) (GEQ s85 1) (GEQ s130 1)) (AND (GEQ s83 1) (GEQ s85 1) (GEQ s129 1)) (AND (GE...], 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]]
Product exploration explored 100000 steps with 33333 reset in 632 ms.
Product exploration explored 100000 steps with 33333 reset in 536 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 p2 p0 (NOT p1)), (X p2), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S06J04T04-LTLFireability-01 finished in 2174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((X(p1)&&G(p2)) U X(p3))||p0)))'
Support contains 17 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1002/1002 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 444 transition count 998
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 444 transition count 998
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 440 transition count 994
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 440 transition count 994
Applied a total of 16 rules in 20 ms. Remains 440 /448 variables (removed 8) and now considering 994/1002 (removed 8) transitions.
[2023-03-15 01:40:27] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:40:27] [INFO ] Invariant cache hit.
[2023-03-15 01:40:27] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
[2023-03-15 01:40:27] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:40:27] [INFO ] Invariant cache hit.
[2023-03-15 01:40:28] [INFO ] Implicit Places using invariants in 298 ms returned [354, 355, 356, 357]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 299 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 436/448 places, 994/1002 transitions.
Applied a total of 0 rules in 11 ms. Remains 436 /436 variables (removed 0) and now considering 994/994 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 881 ms. Remains : 436/448 places, 994/1002 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), true, (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p3) p1), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p3)) (AND (NOT p3) (NOT p1))), acceptance={0} source=3 dest: 4}, { cond=(AND p2 (NOT p3) p1), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s246 1) (GEQ s249 1)) (AND (GEQ s246 1) (GEQ s250 1)) (AND (GEQ s246 1) (GEQ s251 1)) (AND (GEQ s246 1) (GEQ s252 1))), p2:(OR (GEQ s234 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T04-LTLFireability-02 finished in 1089 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 U p1) U X(p2))||G(p3))))'
Support contains 9 out of 448 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1002/1002 transitions.
Applied a total of 0 rules in 7 ms. Remains 448 /448 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
[2023-03-15 01:40:28] [INFO ] Flow matrix only has 978 transitions (discarded 24 similar events)
// Phase 1: matrix 978 rows 448 cols
[2023-03-15 01:40:28] [INFO ] Computed 44 place invariants in 18 ms
[2023-03-15 01:40:28] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
[2023-03-15 01:40:28] [INFO ] Flow matrix only has 978 transitions (discarded 24 similar events)
[2023-03-15 01:40:28] [INFO ] Invariant cache hit.
[2023-03-15 01:40:29] [INFO ] Implicit Places using invariants in 254 ms returned [354, 355, 356, 357]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 257 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 444/448 places, 1002/1002 transitions.
Applied a total of 0 rules in 5 ms. Remains 444 /444 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 723 ms. Remains : 444/448 places, 1002/1002 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(OR (GEQ s372 1) (GEQ s373 1) (GEQ s370 1) (GEQ s371 1)), p2:(OR (AND (GEQ s195 1) (GEQ s203 1)) (AND (GEQ s194 1) (GEQ s203 1)) (AND (GEQ s193 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 110 steps with 2 reset in 4 ms.
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T04-LTLFireability-03 finished in 840 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)&&!(p0 U p1)))'
Support contains 21 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 1002/1002 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 448 transition count 970
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 416 transition count 970
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 64 place count 416 transition count 922
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 160 place count 368 transition count 922
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 256 place count 320 transition count 874
Applied a total of 256 rules in 45 ms. Remains 320 /448 variables (removed 128) and now considering 874/1002 (removed 128) transitions.
[2023-03-15 01:40:29] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 320 cols
[2023-03-15 01:40:29] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-15 01:40:29] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
[2023-03-15 01:40:29] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
[2023-03-15 01:40:29] [INFO ] Invariant cache hit.
[2023-03-15 01:40:29] [INFO ] Implicit Places using invariants in 237 ms returned [274, 275, 276, 277]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 239 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 316/448 places, 874/1002 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 312 transition count 870
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 312 transition count 870
Applied a total of 8 rules in 32 ms. Remains 312 /316 variables (removed 4) and now considering 870/874 (removed 4) transitions.
[2023-03-15 01:40:29] [INFO ] Flow matrix only has 846 transitions (discarded 24 similar events)
// Phase 1: matrix 846 rows 312 cols
[2023-03-15 01:40:29] [INFO ] Computed 40 place invariants in 13 ms
[2023-03-15 01:40:30] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-15 01:40:30] [INFO ] Flow matrix only has 846 transitions (discarded 24 similar events)
[2023-03-15 01:40:30] [INFO ] Invariant cache hit.
[2023-03-15 01:40:30] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 01:40:35] [INFO ] Implicit Places using invariants and state equation in 5336 ms returned []
Implicit Place search using SMT with State Equation took 5652 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 312/448 places, 870/1002 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6418 ms. Remains : 312/448 places, 870/1002 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), p1, (OR (NOT p0) p1)]
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (LT s81 1) (LT s107 1) (LT s110 1)) (OR (LT s81 1) (LT s107 1) (LT s111 1)) (OR (LT s80 1) (LT s107 1) (LT s111 1)) (OR (LT s80 1) (LT s107 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T04-LTLFireability-05 finished in 6569 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 9 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1002/1002 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 444 transition count 998
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 444 transition count 998
Applied a total of 8 rules in 13 ms. Remains 444 /448 variables (removed 4) and now considering 998/1002 (removed 4) transitions.
[2023-03-15 01:40:35] [INFO ] Flow matrix only has 974 transitions (discarded 24 similar events)
// Phase 1: matrix 974 rows 444 cols
[2023-03-15 01:40:35] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-15 01:40:36] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
[2023-03-15 01:40:36] [INFO ] Flow matrix only has 974 transitions (discarded 24 similar events)
[2023-03-15 01:40:36] [INFO ] Invariant cache hit.
[2023-03-15 01:40:36] [INFO ] Implicit Places using invariants in 295 ms returned [354, 355, 356, 357]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 312 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 440/448 places, 998/1002 transitions.
Applied a total of 0 rules in 4 ms. Remains 440 /440 variables (removed 0) and now considering 998/998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 762 ms. Remains : 440/448 places, 998/1002 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLFireability-08 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 (GEQ s355 1) (GEQ s354 1) (GEQ s357 1) (GEQ s356 1)), p1:(OR (AND (GEQ s195 1) (GEQ s203 1)) (AND (GEQ s194 1) (GEQ s203 1)) (AND (GEQ s193 1) (GEQ...], 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]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T04-LTLFireability-08 finished in 889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1) U (!p2||X(p3))))))'
Support contains 39 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1002/1002 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 444 transition count 998
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 444 transition count 998
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 440 transition count 994
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 440 transition count 994
Applied a total of 16 rules in 26 ms. Remains 440 /448 variables (removed 8) and now considering 994/1002 (removed 8) transitions.
[2023-03-15 01:40:36] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
// Phase 1: matrix 970 rows 440 cols
[2023-03-15 01:40:36] [INFO ] Computed 44 place invariants in 22 ms
[2023-03-15 01:40:37] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
[2023-03-15 01:40:37] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:40:37] [INFO ] Invariant cache hit.
[2023-03-15 01:40:37] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-15 01:40:37] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:40:37] [INFO ] Invariant cache hit.
[2023-03-15 01:40:37] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 01:40:41] [INFO ] Implicit Places using invariants and state equation in 3840 ms returned []
Implicit Place search using SMT with State Equation took 4119 ms to find 0 implicit places.
[2023-03-15 01:40:41] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:40:41] [INFO ] Invariant cache hit.
[2023-03-15 01:40:41] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 440/448 places, 994/1002 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5065 ms. Remains : 440/448 places, 994/1002 transitions.
Stuttering acceptance computed with spot in 297 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s248 1) (GEQ s252 1)) (AND (GEQ s248 1) (GEQ s249 1)) (AND (GEQ s248 1) (GEQ s250 1)) (AND (GEQ s248 1) (GEQ s251 1))), p1:(OR (GEQ s418 ...], 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]]
Product exploration explored 100000 steps with 581 reset in 339 ms.
Product exploration explored 100000 steps with 613 reset in 433 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 p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p1) p0 (NOT p3)))), (X (NOT (OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3))))), (X (X (NOT p3))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (OR (AND p2 p1) (AND p2 p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1132 ms. Reduced automaton from 5 states, 19 edges and 4 AP (stutter sensitive) to 5 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Finished random walk after 2891 steps, including 17 resets, run visited all 11 properties in 96 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p1) p0 (NOT p3)))), (X (NOT (OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3))))), (X (X (NOT p3))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (OR (AND p2 p1) (AND p2 p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F p3), (F (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (AND (NOT p0) (NOT p1) p2)), (F (OR (AND p0 p2) (AND p1 p2))), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p3))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 19 factoid took 1135 ms. Reduced automaton from 5 states, 19 edges and 4 AP (stutter sensitive) to 5 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Stuttering acceptance computed with spot in 191 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Support contains 39 out of 440 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 440/440 places, 994/994 transitions.
Applied a total of 0 rules in 10 ms. Remains 440 /440 variables (removed 0) and now considering 994/994 (removed 0) transitions.
[2023-03-15 01:40:45] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:40:45] [INFO ] Invariant cache hit.
[2023-03-15 01:40:46] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
[2023-03-15 01:40:46] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:40:46] [INFO ] Invariant cache hit.
[2023-03-15 01:40:46] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-15 01:40:46] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:40:46] [INFO ] Invariant cache hit.
[2023-03-15 01:40:46] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 01:40:50] [INFO ] Implicit Places using invariants and state equation in 3865 ms returned []
Implicit Place search using SMT with State Equation took 4156 ms to find 0 implicit places.
[2023-03-15 01:40:50] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:40:50] [INFO ] Invariant cache hit.
[2023-03-15 01:40:50] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5026 ms. Remains : 440/440 places, 994/994 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) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p3))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 927 ms. Reduced automaton from 5 states, 19 edges and 4 AP (stutter sensitive) to 5 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Finished random walk after 550 steps, including 2 resets, run visited all 11 properties in 17 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p3))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p3) p2)), (F p3), (F (OR (AND p0 (NOT p3) p2) (AND p1 (NOT p3) p2))), (F (AND p0 (NOT p1) (NOT p3) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (OR (AND p0 p2) (AND p1 p2))), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p3))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 19 factoid took 1291 ms. Reduced automaton from 5 states, 19 edges and 4 AP (stutter sensitive) to 5 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Stuttering acceptance computed with spot in 245 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Stuttering acceptance computed with spot in 211 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Product exploration explored 100000 steps with 548 reset in 477 ms.
Product exploration explored 100000 steps with 602 reset in 485 ms.
Support contains 39 out of 440 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 440/440 places, 994/994 transitions.
Applied a total of 0 rules in 4 ms. Remains 440 /440 variables (removed 0) and now considering 994/994 (removed 0) transitions.
[2023-03-15 01:40:55] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:40:55] [INFO ] Invariant cache hit.
[2023-03-15 01:40:55] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
[2023-03-15 01:40:55] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:40:55] [INFO ] Invariant cache hit.
[2023-03-15 01:40:55] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-15 01:40:55] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:40:55] [INFO ] Invariant cache hit.
[2023-03-15 01:40:56] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 01:40:59] [INFO ] Implicit Places using invariants and state equation in 3672 ms returned []
Implicit Place search using SMT with State Equation took 4003 ms to find 0 implicit places.
[2023-03-15 01:40:59] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:40:59] [INFO ] Invariant cache hit.
[2023-03-15 01:41:00] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4975 ms. Remains : 440/440 places, 994/994 transitions.
Treatment of property PolyORBLF-COL-S06J04T04-LTLFireability-09 finished in 23619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G((p1||G(p2)))))))'
Support contains 42 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1002/1002 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 444 transition count 998
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 444 transition count 998
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 440 transition count 994
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 440 transition count 994
Applied a total of 16 rules in 12 ms. Remains 440 /448 variables (removed 8) and now considering 994/1002 (removed 8) transitions.
[2023-03-15 01:41:00] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:41:00] [INFO ] Invariant cache hit.
[2023-03-15 01:41:00] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
[2023-03-15 01:41:00] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:41:00] [INFO ] Invariant cache hit.
[2023-03-15 01:41:01] [INFO ] Implicit Places using invariants in 235 ms returned [354, 355, 356, 357]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 256 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 436/448 places, 994/1002 transitions.
Applied a total of 0 rules in 4 ms. Remains 436 /436 variables (removed 0) and now considering 994/994 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 857 ms. Remains : 436/448 places, 994/1002 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p2:(OR (AND (GEQ s195 1) (GEQ s203 1)) (AND (GEQ s194 1) (GEQ s203 1)) (AND (GEQ s193 1) (GEQ s203 1)) (AND (GEQ s192 1) (GEQ s203 1))), p1:(AND (OR (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 537 ms.
Product exploration explored 100000 steps with 33333 reset in 557 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 p2) p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S06J04T04-LTLFireability-11 finished in 2305 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 5 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1002/1002 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 444 transition count 998
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 444 transition count 998
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 440 transition count 994
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 440 transition count 994
Applied a total of 16 rules in 16 ms. Remains 440 /448 variables (removed 8) and now considering 994/1002 (removed 8) transitions.
[2023-03-15 01:41:02] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:41:02] [INFO ] Invariant cache hit.
[2023-03-15 01:41:02] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
[2023-03-15 01:41:02] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:41:02] [INFO ] Invariant cache hit.
[2023-03-15 01:41:03] [INFO ] Implicit Places using invariants in 297 ms returned [354, 355, 356, 357]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 298 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 436/448 places, 994/1002 transitions.
Applied a total of 0 rules in 3 ms. Remains 436 /436 variables (removed 0) and now considering 994/994 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 717 ms. Remains : 436/448 places, 994/1002 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s83 1) (LT s184 1)) (OR (LT s83 1) (LT s183 1)) (OR (LT s83 1) (LT s186 1)) (OR (LT s83 1) (LT s185 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 519 ms.
Product exploration explored 100000 steps with 50000 reset in 520 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 50 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S06J04T04-LTLFireability-12 finished in 1897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(!p1)))'
Support contains 36 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1002/1002 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 444 transition count 998
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 444 transition count 998
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 440 transition count 994
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 440 transition count 994
Applied a total of 16 rules in 17 ms. Remains 440 /448 variables (removed 8) and now considering 994/1002 (removed 8) transitions.
[2023-03-15 01:41:04] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:41:04] [INFO ] Invariant cache hit.
[2023-03-15 01:41:04] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
[2023-03-15 01:41:04] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2023-03-15 01:41:04] [INFO ] Invariant cache hit.
[2023-03-15 01:41:05] [INFO ] Implicit Places using invariants in 282 ms returned [354, 355, 356, 357]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 311 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 436/448 places, 994/1002 transitions.
Applied a total of 0 rules in 3 ms. Remains 436 /436 variables (removed 0) and now considering 994/994 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 851 ms. Remains : 436/448 places, 994/1002 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) p1), p1, (NOT p0), true]
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s38 1) (GEQ s134 1)) (AND (GEQ s45 1) (GEQ s134 1)) (AND (GEQ s55 1) (GEQ s134 1)) (AND (GEQ s40 1) (GEQ s134 1)) (AND (GEQ s43 1) (GEQ s...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 586 ms.
Product exploration explored 100000 steps with 50000 reset in 592 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 p0 (NOT p1)), (X p0), (X (NOT p1)), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S06J04T04-LTLFireability-13 finished in 2237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((!p0 U p1))||G(p2))))'
Support contains 18 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 1002/1002 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 448 transition count 978
Reduce places removed 24 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 28 rules applied. Total rules applied 52 place count 424 transition count 974
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 56 place count 420 transition count 974
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 56 place count 420 transition count 926
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 152 place count 372 transition count 926
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 240 place count 328 transition count 882
Applied a total of 240 rules in 36 ms. Remains 328 /448 variables (removed 120) and now considering 882/1002 (removed 120) transitions.
[2023-03-15 01:41:06] [INFO ] Flow matrix only has 858 transitions (discarded 24 similar events)
// Phase 1: matrix 858 rows 328 cols
[2023-03-15 01:41:06] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-15 01:41:07] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
[2023-03-15 01:41:07] [INFO ] Flow matrix only has 858 transitions (discarded 24 similar events)
[2023-03-15 01:41:07] [INFO ] Invariant cache hit.
[2023-03-15 01:41:07] [INFO ] Implicit Places using invariants in 258 ms returned [282, 283, 284, 285]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 285 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 324/448 places, 882/1002 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 320 transition count 878
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 320 transition count 878
Applied a total of 8 rules in 14 ms. Remains 320 /324 variables (removed 4) and now considering 878/882 (removed 4) transitions.
[2023-03-15 01:41:07] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
// Phase 1: matrix 854 rows 320 cols
[2023-03-15 01:41:07] [INFO ] Computed 40 place invariants in 16 ms
[2023-03-15 01:41:07] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-15 01:41:07] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
[2023-03-15 01:41:07] [INFO ] Invariant cache hit.
[2023-03-15 01:41:08] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 01:41:11] [INFO ] Implicit Places using invariants and state equation in 3693 ms returned []
Implicit Place search using SMT with State Equation took 4133 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 320/448 places, 878/1002 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4928 ms. Remains : 320/448 places, 878/1002 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p1) (AND p2 (NOT p0))), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(AND (OR (LT s113 1) (LT s116 1) (LT s120 1)) (OR (LT s113 1) (LT s116 1) (LT s119 1)) (OR (LT s113 1) (LT s116 1) (LT s122 1)) (OR (LT s113 1) (LT s11...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 951 reset in 738 ms.
Product exploration explored 100000 steps with 954 reset in 750 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 p2 (NOT p1) (NOT p0)), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (OR (AND p2 p1) (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (AND p2 (NOT p1) (NOT p0))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))))), (X (X (OR (AND p2 p1) (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p2 (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 455 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 78 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 01:41:13] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
[2023-03-15 01:41:13] [INFO ] Invariant cache hit.
[2023-03-15 01:41:13] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-15 01:41:13] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-15 01:41:13] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (OR (AND p2 p1) (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (AND p2 (NOT p1) (NOT p0))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))))), (X (X (OR (AND p2 p1) (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p2 (NOT p1) (NOT p0)))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (F (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 14 factoid took 616 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 18 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 878/878 transitions.
Applied a total of 0 rules in 10 ms. Remains 320 /320 variables (removed 0) and now considering 878/878 (removed 0) transitions.
[2023-03-15 01:41:14] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
[2023-03-15 01:41:14] [INFO ] Invariant cache hit.
[2023-03-15 01:41:15] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
[2023-03-15 01:41:15] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
[2023-03-15 01:41:15] [INFO ] Invariant cache hit.
[2023-03-15 01:41:15] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-15 01:41:15] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
[2023-03-15 01:41:15] [INFO ] Invariant cache hit.
[2023-03-15 01:41:15] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 01:41:19] [INFO ] Implicit Places using invariants and state equation in 3837 ms returned []
Implicit Place search using SMT with State Equation took 4142 ms to find 0 implicit places.
[2023-03-15 01:41:19] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-15 01:41:19] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
[2023-03-15 01:41:19] [INFO ] Invariant cache hit.
[2023-03-15 01:41:19] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5139 ms. Remains : 320/320 places, 878/878 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) p2 (NOT p1)), (X (AND (NOT p0) (NOT p1) p2)), (X (OR (AND (NOT p0) p2) (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 841 ms. Reduced automaton from 2 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 112 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 01:41:20] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
[2023-03-15 01:41:20] [INFO ] Invariant cache hit.
[2023-03-15 01:41:21] [INFO ] [Real]Absence check using 15 positive place invariants in 24 ms returned sat
[2023-03-15 01:41:21] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 35 ms returned sat
[2023-03-15 01:41:21] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (AND (NOT p0) (NOT p1) p2)), (X (OR (AND (NOT p0) p2) (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (F (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 18 factoid took 761 ms. Reduced automaton from 2 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 925 reset in 541 ms.
Product exploration explored 100000 steps with 921 reset in 548 ms.
Support contains 18 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 878/878 transitions.
Applied a total of 0 rules in 10 ms. Remains 320 /320 variables (removed 0) and now considering 878/878 (removed 0) transitions.
[2023-03-15 01:41:23] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
[2023-03-15 01:41:23] [INFO ] Invariant cache hit.
[2023-03-15 01:41:23] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
[2023-03-15 01:41:23] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
[2023-03-15 01:41:23] [INFO ] Invariant cache hit.
[2023-03-15 01:41:23] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-15 01:41:23] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
[2023-03-15 01:41:23] [INFO ] Invariant cache hit.
[2023-03-15 01:41:24] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 01:41:27] [INFO ] Implicit Places using invariants and state equation in 3956 ms returned []
Implicit Place search using SMT with State Equation took 4231 ms to find 0 implicit places.
[2023-03-15 01:41:27] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 01:41:27] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
[2023-03-15 01:41:27] [INFO ] Invariant cache hit.
[2023-03-15 01:41:28] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5195 ms. Remains : 320/320 places, 878/878 transitions.
Treatment of property PolyORBLF-COL-S06J04T04-LTLFireability-14 finished in 21732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(p1))))'
Support contains 9 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1002/1002 transitions.
Applied a total of 0 rules in 4 ms. Remains 448 /448 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
[2023-03-15 01:41:28] [INFO ] Flow matrix only has 978 transitions (discarded 24 similar events)
// Phase 1: matrix 978 rows 448 cols
[2023-03-15 01:41:28] [INFO ] Computed 44 place invariants in 17 ms
[2023-03-15 01:41:28] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
[2023-03-15 01:41:28] [INFO ] Flow matrix only has 978 transitions (discarded 24 similar events)
[2023-03-15 01:41:28] [INFO ] Invariant cache hit.
[2023-03-15 01:41:29] [INFO ] Implicit Places using invariants in 275 ms returned [354, 355, 356, 357]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 298 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 444/448 places, 1002/1002 transitions.
Applied a total of 0 rules in 4 ms. Remains 444 /444 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 769 ms. Remains : 444/448 places, 1002/1002 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s372 1) (GEQ s373 1) (GEQ s370 1) (GEQ s371 1)), p1:(OR (AND (GEQ s247 1) (GEQ s251 1)) (AND (GEQ s247 1) (GEQ s252 1)) (AND (GEQ s247 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 256 steps with 2 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T04-LTLFireability-15 finished in 904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1) U (!p2||X(p3))))))'
Found a Lengthening insensitive property : PolyORBLF-COL-S06J04T04-LTLFireability-09
Stuttering acceptance computed with spot in 192 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Support contains 39 out of 448 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 448/448 places, 1002/1002 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 448 transition count 982
Reduce places removed 20 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 28 rules applied. Total rules applied 48 place count 428 transition count 974
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 56 place count 420 transition count 974
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 56 place count 420 transition count 922
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 160 place count 368 transition count 922
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 232 place count 332 transition count 886
Applied a total of 232 rules in 33 ms. Remains 332 /448 variables (removed 116) and now considering 886/1002 (removed 116) transitions.
[2023-03-15 01:41:29] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 332 cols
[2023-03-15 01:41:29] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-15 01:41:30] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
[2023-03-15 01:41:30] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
[2023-03-15 01:41:30] [INFO ] Invariant cache hit.
[2023-03-15 01:41:30] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-15 01:41:30] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
[2023-03-15 01:41:30] [INFO ] Invariant cache hit.
[2023-03-15 01:41:30] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 01:41:34] [INFO ] Implicit Places using invariants and state equation in 3956 ms returned []
Implicit Place search using SMT with State Equation took 4213 ms to find 0 implicit places.
[2023-03-15 01:41:34] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
[2023-03-15 01:41:34] [INFO ] Invariant cache hit.
[2023-03-15 01:41:34] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 332/448 places, 886/1002 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5079 ms. Remains : 332/448 places, 886/1002 transitions.
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s184 1) (GEQ s188 1)) (AND (GEQ s184 1) (GEQ s185 1)) (AND (GEQ s184 1) (GEQ s186 1)) (AND (GEQ s184 1) (GEQ s187 1))), p1:(OR (GEQ s330 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1008 reset in 343 ms.
Product exploration explored 100000 steps with 1033 reset in 355 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 p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p1) p0 (NOT p3)))), (X (NOT (OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3))))), (X (X (NOT p3))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (OR (AND p2 p1) (AND p2 p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 984 ms. Reduced automaton from 5 states, 19 edges and 4 AP (stutter sensitive) to 5 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Finished random walk after 102 steps, including 2 resets, run visited all 11 properties in 6 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p1) p0 (NOT p3)))), (X (NOT (OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3))))), (X (X (NOT p3))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (OR (AND p2 p1) (AND p2 p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F p3), (F (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (AND (NOT p0) (NOT p1) p2)), (F (OR (AND p0 p2) (AND p1 p2))), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p3))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 19 factoid took 1266 ms. Reduced automaton from 5 states, 19 edges and 4 AP (stutter sensitive) to 5 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Stuttering acceptance computed with spot in 189 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Support contains 39 out of 332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 332/332 places, 886/886 transitions.
Applied a total of 0 rules in 5 ms. Remains 332 /332 variables (removed 0) and now considering 886/886 (removed 0) transitions.
[2023-03-15 01:41:38] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
[2023-03-15 01:41:38] [INFO ] Invariant cache hit.
[2023-03-15 01:41:38] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
[2023-03-15 01:41:38] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
[2023-03-15 01:41:38] [INFO ] Invariant cache hit.
[2023-03-15 01:41:38] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-15 01:41:38] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
[2023-03-15 01:41:38] [INFO ] Invariant cache hit.
[2023-03-15 01:41:39] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 01:41:42] [INFO ] Implicit Places using invariants and state equation in 3195 ms returned []
Implicit Place search using SMT with State Equation took 3457 ms to find 0 implicit places.
[2023-03-15 01:41:42] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
[2023-03-15 01:41:42] [INFO ] Invariant cache hit.
[2023-03-15 01:41:42] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4134 ms. Remains : 332/332 places, 886/886 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) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p3))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 972 ms. Reduced automaton from 5 states, 19 edges and 4 AP (stutter sensitive) to 5 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Finished random walk after 556 steps, including 8 resets, run visited all 11 properties in 30 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p3))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p3) p2)), (F p3), (F (OR (AND p0 (NOT p3) p2) (AND p1 (NOT p3) p2))), (F (AND p0 (NOT p1) (NOT p3) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (OR (AND p0 p2) (AND p1 p2))), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p3))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 19 factoid took 1098 ms. Reduced automaton from 5 states, 19 edges and 4 AP (stutter sensitive) to 5 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Stuttering acceptance computed with spot in 181 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Stuttering acceptance computed with spot in 211 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Product exploration explored 100000 steps with 920 reset in 507 ms.
Stack based approach found an accepted trace after 28016 steps with 224 reset with depth 370 and stack size 370 in 145 ms.
Treatment of property PolyORBLF-COL-S06J04T04-LTLFireability-09 finished in 16649 ms.
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((!p0 U p1))||G(p2))))'
[2023-03-15 01:41:46] [INFO ] Flatten gal took : 89 ms
[2023-03-15 01:41:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-15 01:41:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 448 places, 1002 transitions and 5242 arcs took 5 ms.
Total runtime 92656 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBLF-COL-S06J04T04
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

BK_STOP 1678844647688

--------------------
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 LTLFireability -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/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 PolyORBLF-COL-S06J04T04-LTLFireability-14
lola: time limit : 1800 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
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 2/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 144082 m, 28816 m/sec, 248498 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 3/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 289361 m, 29055 m/sec, 501081 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1800 5/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 428175 m, 27762 m/sec, 754736 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1800 6/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 565427 m, 27450 m/sec, 1008276 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1800 7/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 709759 m, 28866 m/sec, 1255087 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1800 9/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 867110 m, 31470 m/sec, 1476313 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1800 10/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 1020908 m, 30759 m/sec, 1696544 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1800 12/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 1174188 m, 30656 m/sec, 1917851 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1800 13/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 1326630 m, 30488 m/sec, 2137943 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1800 14/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 1476934 m, 30060 m/sec, 2357606 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1800 16/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 1627231 m, 30059 m/sec, 2576284 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1800 17/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 1775653 m, 29684 m/sec, 2796354 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/1800 18/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 1926245 m, 30118 m/sec, 3021544 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/1800 20/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 2070735 m, 28898 m/sec, 3244592 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/1800 21/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 2211440 m, 28141 m/sec, 3491174 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/1800 22/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 2349474 m, 27606 m/sec, 3735530 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 85/1800 24/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 2485256 m, 27156 m/sec, 3985188 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 90/1800 25/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 2617791 m, 26507 m/sec, 4233765 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 95/1800 26/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 2757082 m, 27858 m/sec, 4473026 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 100/1800 28/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 2910113 m, 30606 m/sec, 4691805 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 105/1800 29/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 3058909 m, 29759 m/sec, 4912650 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 110/1800 30/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 3209503 m, 30118 m/sec, 5131882 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 115/1800 32/32 PolyORBLF-COL-S06J04T04-LTLFireability-14 3357697 m, 29638 m/sec, 5351058 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for PolyORBLF-COL-S06J04T04-LTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 PolyORBLF-COL-S06J04T04-LTLFireability-09
lola: time limit : 3480 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
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3480 9/32 PolyORBLF-COL-S06J04T04-LTLFireability-09 887977 m, 177595 m/sec, 1096010 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3480 17/32 PolyORBLF-COL-S06J04T04-LTLFireability-09 1715844 m, 165573 m/sec, 2227142 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3480 25/32 PolyORBLF-COL-S06J04T04-LTLFireability-09 2523826 m, 161596 m/sec, 3386507 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for PolyORBLF-COL-S06J04T04-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S06J04T04-LTLFireability-09: LTL unknown AGGR
PolyORBLF-COL-S06J04T04-LTLFireability-14: LTL unknown AGGR


Time elapsed: 140 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="PolyORBLF-COL-S06J04T04"
export BK_EXAMINATION="LTLFireability"
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 PolyORBLF-COL-S06J04T04, examination is LTLFireability"
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-167873947900444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J04T04.tgz
mv PolyORBLF-COL-S06J04T04 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;