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.r521-tall-167987246100059.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 ltsminxred
Input is Anderson-PT-11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246100059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 11K Mar 23 15:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 31 16:48 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 Anderson-PT-11-LTLCardinality-00
FORMULA_NAME Anderson-PT-11-LTLCardinality-01
FORMULA_NAME Anderson-PT-11-LTLCardinality-02
FORMULA_NAME Anderson-PT-11-LTLCardinality-03
FORMULA_NAME Anderson-PT-11-LTLCardinality-04
FORMULA_NAME Anderson-PT-11-LTLCardinality-05
FORMULA_NAME Anderson-PT-11-LTLCardinality-06
FORMULA_NAME Anderson-PT-11-LTLCardinality-07
FORMULA_NAME Anderson-PT-11-LTLCardinality-08
FORMULA_NAME Anderson-PT-11-LTLCardinality-09
FORMULA_NAME Anderson-PT-11-LTLCardinality-10
FORMULA_NAME Anderson-PT-11-LTLCardinality-11
FORMULA_NAME Anderson-PT-11-LTLCardinality-12
FORMULA_NAME Anderson-PT-11-LTLCardinality-13
FORMULA_NAME Anderson-PT-11-LTLCardinality-14
FORMULA_NAME Anderson-PT-11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680867778602

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-11
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 11:43:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 11:43:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 11:43:01] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2023-04-07 11:43:01] [INFO ] Transformed 749 places.
[2023-04-07 11:43:01] [INFO ] Transformed 3245 transitions.
[2023-04-07 11:43:01] [INFO ] Found NUPN structural information;
[2023-04-07 11:43:01] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 401 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Anderson-PT-11-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 749 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 749/749 places, 3245/3245 transitions.
Discarding 202 places :
Symmetric choice reduction at 0 with 202 rule applications. Total rules 202 place count 547 transition count 963
Iterating global reduction 0 with 202 rules applied. Total rules applied 404 place count 547 transition count 963
Applied a total of 404 rules in 210 ms. Remains 547 /749 variables (removed 202) and now considering 963/3245 (removed 2282) transitions.
// Phase 1: matrix 963 rows 547 cols
[2023-04-07 11:43:01] [INFO ] Computed 25 invariants in 82 ms
[2023-04-07 11:43:02] [INFO ] Implicit Places using invariants in 1057 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1112 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 546/749 places, 963/3245 transitions.
Applied a total of 0 rules in 12 ms. Remains 546 /546 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1335 ms. Remains : 546/749 places, 963/3245 transitions.
Support contains 39 out of 546 places after structural reductions.
[2023-04-07 11:43:03] [INFO ] Flatten gal took : 178 ms
[2023-04-07 11:43:03] [INFO ] Flatten gal took : 61 ms
[2023-04-07 11:43:03] [INFO ] Input system was already deterministic with 963 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 23) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 963 rows 546 cols
[2023-04-07 11:43:04] [INFO ] Computed 24 invariants in 24 ms
[2023-04-07 11:43:04] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 11:43:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 100 ms returned sat
[2023-04-07 11:43:04] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 18 ms returned sat
[2023-04-07 11:43:05] [INFO ] After 953ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 11:43:05] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:43:06] [INFO ] After 370ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 11:43:06] [INFO ] After 740ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 256 ms.
[2023-04-07 11:43:06] [INFO ] After 2337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 9 ms.
Support contains 7 out of 546 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 546/546 places, 963/963 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 546 transition count 843
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 426 transition count 843
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 240 place count 426 transition count 738
Deduced a syphon composed of 105 places in 0 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 450 place count 321 transition count 738
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 463 place count 308 transition count 625
Iterating global reduction 2 with 13 rules applied. Total rules applied 476 place count 308 transition count 625
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 484 place count 304 transition count 621
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 485 place count 304 transition count 620
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 486 place count 303 transition count 620
Applied a total of 486 rules in 102 ms. Remains 303 /546 variables (removed 243) and now considering 620/963 (removed 343) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 303/546 places, 620/963 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 752684 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :{1=1, 2=1, 3=1}
Probabilistic random walk after 752684 steps, saw 566536 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 620 rows 303 cols
[2023-04-07 11:43:10] [INFO ] Computed 24 invariants in 7 ms
[2023-04-07 11:43:10] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:43:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 11:43:10] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 11 ms returned sat
[2023-04-07 11:43:10] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:43:10] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:43:10] [INFO ] After 99ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 11:43:10] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-04-07 11:43:10] [INFO ] After 410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 620/620 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 303 transition count 619
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 302 transition count 619
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 299 transition count 616
Applied a total of 8 rules in 56 ms. Remains 299 /303 variables (removed 4) and now considering 616/620 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 299/303 places, 616/620 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1113367 steps, run timeout after 3001 ms. (steps per millisecond=370 ) properties seen :{}
Probabilistic random walk after 1113367 steps, saw 827919 distinct states, run finished after 3006 ms. (steps per millisecond=370 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 616 rows 299 cols
[2023-04-07 11:43:13] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 11:43:13] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:43:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 11:43:13] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 7 ms returned sat
[2023-04-07 11:43:14] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:43:14] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:43:14] [INFO ] After 63ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 11:43:14] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-07 11:43:14] [INFO ] After 415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 616/616 transitions.
Applied a total of 0 rules in 17 ms. Remains 299 /299 variables (removed 0) and now considering 616/616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 299/299 places, 616/616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 616/616 transitions.
Applied a total of 0 rules in 13 ms. Remains 299 /299 variables (removed 0) and now considering 616/616 (removed 0) transitions.
[2023-04-07 11:43:14] [INFO ] Invariant cache hit.
[2023-04-07 11:43:14] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-04-07 11:43:14] [INFO ] Invariant cache hit.
[2023-04-07 11:43:14] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:43:15] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
[2023-04-07 11:43:15] [INFO ] Redundant transitions in 33 ms returned []
[2023-04-07 11:43:15] [INFO ] Invariant cache hit.
[2023-04-07 11:43:15] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1610 ms. Remains : 299/299 places, 616/616 transitions.
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 121 Pre rules applied. Total rules applied 0 place count 299 transition count 495
Deduced a syphon composed of 121 places in 1 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 0 with 242 rules applied. Total rules applied 242 place count 178 transition count 495
Applied a total of 242 rules in 15 ms. Remains 178 /299 variables (removed 121) and now considering 495/616 (removed 121) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 495 rows 178 cols
[2023-04-07 11:43:15] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 11:43:15] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:43:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 27 ms returned sat
[2023-04-07 11:43:16] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 10 ms returned sat
[2023-04-07 11:43:16] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:43:16] [INFO ] After 279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-04-07 11:43:16] [INFO ] After 454ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0) U p1))&&F(p2)))'
Support contains 6 out of 546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 546/546 places, 963/963 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 546 transition count 845
Reduce places removed 118 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 119 rules applied. Total rules applied 237 place count 428 transition count 844
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 238 place count 427 transition count 844
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 107 Pre rules applied. Total rules applied 238 place count 427 transition count 737
Deduced a syphon composed of 107 places in 1 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 452 place count 320 transition count 737
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 468 place count 304 transition count 621
Iterating global reduction 3 with 16 rules applied. Total rules applied 484 place count 304 transition count 621
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 486 place count 303 transition count 620
Applied a total of 486 rules in 45 ms. Remains 303 /546 variables (removed 243) and now considering 620/963 (removed 343) transitions.
// Phase 1: matrix 620 rows 303 cols
[2023-04-07 11:43:16] [INFO ] Computed 24 invariants in 4 ms
[2023-04-07 11:43:17] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-04-07 11:43:17] [INFO ] Invariant cache hit.
[2023-04-07 11:43:17] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:43:18] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
[2023-04-07 11:43:18] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-07 11:43:18] [INFO ] Invariant cache hit.
[2023-04-07 11:43:18] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 303/546 places, 620/963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1701 ms. Remains : 303/546 places, 620/963 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s170 0) (EQ s301 1)), p0:(OR (EQ s154 0) (EQ s41 1)), p2:(AND (EQ s228 0) (EQ s166 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 55 reset in 309 ms.
Stack based approach found an accepted trace after 145 steps with 0 reset with depth 146 and stack size 146 in 1 ms.
FORMULA Anderson-PT-11-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLCardinality-00 finished in 2405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0)) U !p1))))'
Support contains 4 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 963/963 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 532 transition count 889
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 532 transition count 889
Applied a total of 28 rules in 22 ms. Remains 532 /546 variables (removed 14) and now considering 889/963 (removed 74) transitions.
// Phase 1: matrix 889 rows 532 cols
[2023-04-07 11:43:19] [INFO ] Computed 24 invariants in 20 ms
[2023-04-07 11:43:19] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-04-07 11:43:19] [INFO ] Invariant cache hit.
[2023-04-07 11:43:20] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:43:21] [INFO ] Implicit Places using invariants and state equation in 1741 ms returned []
Implicit Place search using SMT with State Equation took 2166 ms to find 0 implicit places.
[2023-04-07 11:43:21] [INFO ] Invariant cache hit.
[2023-04-07 11:43:21] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/546 places, 889/963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2862 ms. Remains : 532/546 places, 889/963 transitions.
Stuttering acceptance computed with spot in 188 ms :[p1, p1, p1, (NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s152 0) (EQ s45 1)), p0:(OR (EQ s41 0) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 161 ms.
Stack based approach found an accepted trace after 7712 steps with 0 reset with depth 7713 and stack size 5114 in 17 ms.
FORMULA Anderson-PT-11-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLCardinality-01 finished in 3259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F((p0||X(p1)))&&X(p2))))))'
Support contains 5 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 963/963 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 531 transition count 848
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 531 transition count 848
Applied a total of 30 rules in 22 ms. Remains 531 /546 variables (removed 15) and now considering 848/963 (removed 115) transitions.
// Phase 1: matrix 848 rows 531 cols
[2023-04-07 11:43:22] [INFO ] Computed 24 invariants in 6 ms
[2023-04-07 11:43:22] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-04-07 11:43:22] [INFO ] Invariant cache hit.
[2023-04-07 11:43:22] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:43:24] [INFO ] Implicit Places using invariants and state equation in 1568 ms returned []
Implicit Place search using SMT with State Equation took 1889 ms to find 0 implicit places.
[2023-04-07 11:43:24] [INFO ] Invariant cache hit.
[2023-04-07 11:43:24] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 531/546 places, 848/963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2595 ms. Remains : 531/546 places, 848/963 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s7 0) (EQ s112 1)), p1:(AND (EQ s357 0) (EQ s67 1)), p2:(EQ s34 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 32 reset in 170 ms.
Stack based approach found an accepted trace after 109 steps with 1 reset with depth 78 and stack size 78 in 0 ms.
FORMULA Anderson-PT-11-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLCardinality-03 finished in 3007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Support contains 3 out of 546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 546/546 places, 963/963 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 546 transition count 844
Reduce places removed 119 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 120 rules applied. Total rules applied 239 place count 427 transition count 843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 240 place count 426 transition count 843
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 240 place count 426 transition count 734
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 458 place count 317 transition count 734
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 475 place count 300 transition count 597
Iterating global reduction 3 with 17 rules applied. Total rules applied 492 place count 300 transition count 597
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 494 place count 299 transition count 596
Applied a total of 494 rules in 43 ms. Remains 299 /546 variables (removed 247) and now considering 596/963 (removed 367) transitions.
// Phase 1: matrix 596 rows 299 cols
[2023-04-07 11:43:25] [INFO ] Computed 24 invariants in 6 ms
[2023-04-07 11:43:25] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-04-07 11:43:25] [INFO ] Invariant cache hit.
[2023-04-07 11:43:25] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:43:26] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
[2023-04-07 11:43:26] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-07 11:43:26] [INFO ] Invariant cache hit.
[2023-04-07 11:43:26] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 299/546 places, 596/963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1459 ms. Remains : 299/546 places, 596/963 transitions.
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p1)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s291 1), p0:(OR (EQ s298 0) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 5204 steps with 7 reset in 13 ms.
FORMULA Anderson-PT-11-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-11-LTLCardinality-04 finished in 1553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U !p1)))'
Support contains 4 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 963/963 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 530 transition count 827
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 530 transition count 827
Applied a total of 32 rules in 18 ms. Remains 530 /546 variables (removed 16) and now considering 827/963 (removed 136) transitions.
// Phase 1: matrix 827 rows 530 cols
[2023-04-07 11:43:26] [INFO ] Computed 24 invariants in 12 ms
[2023-04-07 11:43:27] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-04-07 11:43:27] [INFO ] Invariant cache hit.
[2023-04-07 11:43:27] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:43:28] [INFO ] Implicit Places using invariants and state equation in 1744 ms returned []
Implicit Place search using SMT with State Equation took 2098 ms to find 0 implicit places.
[2023-04-07 11:43:28] [INFO ] Invariant cache hit.
[2023-04-07 11:43:29] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 530/546 places, 827/963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2765 ms. Remains : 530/546 places, 827/963 transitions.
Stuttering acceptance computed with spot in 78 ms :[p1, p1, true]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s246 0) (EQ s170 1)), p0:(OR (EQ s88 0) (EQ s89 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, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 631 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-11-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-11-LTLCardinality-05 finished in 2864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p1))||F(p2)||p0)))'
Support contains 3 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 963/963 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 530 transition count 827
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 530 transition count 827
Applied a total of 32 rules in 20 ms. Remains 530 /546 variables (removed 16) and now considering 827/963 (removed 136) transitions.
// Phase 1: matrix 827 rows 530 cols
[2023-04-07 11:43:29] [INFO ] Computed 24 invariants in 9 ms
[2023-04-07 11:43:30] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-04-07 11:43:30] [INFO ] Invariant cache hit.
[2023-04-07 11:43:30] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:43:31] [INFO ] Implicit Places using invariants and state equation in 1387 ms returned []
Implicit Place search using SMT with State Equation took 1727 ms to find 0 implicit places.
[2023-04-07 11:43:31] [INFO ] Invariant cache hit.
[2023-04-07 11:43:32] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 530/546 places, 827/963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2320 ms. Remains : 530/546 places, 827/963 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-06 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 p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s29 0) (EQ s129 1) (EQ s134 1)), p2:(EQ s134 1), p1:(OR (EQ s29 0) (EQ s129 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, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 546 ms.
Product exploration explored 100000 steps with 50000 reset in 537 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 p2) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 32 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-11-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-11-LTLCardinality-06 finished in 3569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 963/963 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 529 transition count 826
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 529 transition count 826
Applied a total of 34 rules in 24 ms. Remains 529 /546 variables (removed 17) and now considering 826/963 (removed 137) transitions.
// Phase 1: matrix 826 rows 529 cols
[2023-04-07 11:43:33] [INFO ] Computed 24 invariants in 10 ms
[2023-04-07 11:43:33] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-04-07 11:43:33] [INFO ] Invariant cache hit.
[2023-04-07 11:43:33] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:43:35] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
[2023-04-07 11:43:35] [INFO ] Invariant cache hit.
[2023-04-07 11:43:35] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 529/546 places, 826/963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2611 ms. Remains : 529/546 places, 826/963 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s143 0) (NEQ s278 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-11-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-11-LTLCardinality-08 finished in 2735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 2 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 963/963 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 528 transition count 825
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 528 transition count 825
Applied a total of 36 rules in 22 ms. Remains 528 /546 variables (removed 18) and now considering 825/963 (removed 138) transitions.
// Phase 1: matrix 825 rows 528 cols
[2023-04-07 11:43:36] [INFO ] Computed 24 invariants in 9 ms
[2023-04-07 11:43:36] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-04-07 11:43:36] [INFO ] Invariant cache hit.
[2023-04-07 11:43:36] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:43:37] [INFO ] Implicit Places using invariants and state equation in 1578 ms returned []
Implicit Place search using SMT with State Equation took 1885 ms to find 0 implicit places.
[2023-04-07 11:43:37] [INFO ] Invariant cache hit.
[2023-04-07 11:43:38] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 528/546 places, 825/963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2580 ms. Remains : 528/546 places, 825/963 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s13 0), p1:(EQ s304 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 503 ms.
Product exploration explored 100000 steps with 50000 reset in 501 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 (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 34 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-11-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-11-LTLCardinality-10 finished in 3763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0&&X(p1)) U !p2)))'
Support contains 6 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 963/963 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 530 transition count 827
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 530 transition count 827
Applied a total of 32 rules in 23 ms. Remains 530 /546 variables (removed 16) and now considering 827/963 (removed 136) transitions.
// Phase 1: matrix 827 rows 530 cols
[2023-04-07 11:43:39] [INFO ] Computed 24 invariants in 5 ms
[2023-04-07 11:43:40] [INFO ] Implicit Places using invariants in 523 ms returned []
[2023-04-07 11:43:40] [INFO ] Invariant cache hit.
[2023-04-07 11:43:40] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:43:41] [INFO ] Implicit Places using invariants and state equation in 1518 ms returned []
Implicit Place search using SMT with State Equation took 2044 ms to find 0 implicit places.
[2023-04-07 11:43:41] [INFO ] Invariant cache hit.
[2023-04-07 11:43:42] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 530/546 places, 827/963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2710 ms. Remains : 530/546 places, 827/963 transitions.
Stuttering acceptance computed with spot in 195 ms :[p2, true, (OR (NOT p1) p2)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) p0), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p2 (NOT p0)) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s180 0) (EQ s136 1)), p0:(OR (EQ s282 0) (EQ s295 1)), p1:(OR (EQ s214 0) (EQ s114 1))], 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]]
Entered a terminal (fully accepting) state of product in 2910 steps with 0 reset in 10 ms.
FORMULA Anderson-PT-11-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-11-LTLCardinality-11 finished in 2947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (p1||G(!p0)))))'
Support contains 4 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 963/963 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 530 transition count 847
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 530 transition count 847
Applied a total of 32 rules in 21 ms. Remains 530 /546 variables (removed 16) and now considering 847/963 (removed 116) transitions.
// Phase 1: matrix 847 rows 530 cols
[2023-04-07 11:43:42] [INFO ] Computed 24 invariants in 7 ms
[2023-04-07 11:43:43] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-04-07 11:43:43] [INFO ] Invariant cache hit.
[2023-04-07 11:43:43] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:43:44] [INFO ] Implicit Places using invariants and state equation in 1526 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
[2023-04-07 11:43:44] [INFO ] Invariant cache hit.
[2023-04-07 11:43:45] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 530/546 places, 847/963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2745 ms. Remains : 530/546 places, 847/963 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NOT (OR (EQ s43 0) (EQ s53 1))) (NOT (OR (EQ s262 0) (EQ s236 1)))), p0:(OR (EQ s262 0) (EQ s236 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-11-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-11-LTLCardinality-14 finished in 2845 ms.
All properties solved by simple procedures.
Total runtime 44719 ms.
ITS solved all properties within timeout

BK_STOP 1680867826651

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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