Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r021-smll-171620128200218.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Anderson-PT-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620128200218
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 667K May 18 16:42 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-08-LTLFireability-00
FORMULA_NAME Anderson-PT-08-LTLFireability-01
FORMULA_NAME Anderson-PT-08-LTLFireability-02
FORMULA_NAME Anderson-PT-08-LTLFireability-03
FORMULA_NAME Anderson-PT-08-LTLFireability-04
FORMULA_NAME Anderson-PT-08-LTLFireability-05
FORMULA_NAME Anderson-PT-08-LTLFireability-06
FORMULA_NAME Anderson-PT-08-LTLFireability-07
FORMULA_NAME Anderson-PT-08-LTLFireability-08
FORMULA_NAME Anderson-PT-08-LTLFireability-09
FORMULA_NAME Anderson-PT-08-LTLFireability-10
FORMULA_NAME Anderson-PT-08-LTLFireability-11
FORMULA_NAME Anderson-PT-08-LTLFireability-12
FORMULA_NAME Anderson-PT-08-LTLFireability-13
FORMULA_NAME Anderson-PT-08-LTLFireability-14
FORMULA_NAME Anderson-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716521115642

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 03:25:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 03:25:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:25:18] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2024-05-24 03:25:18] [INFO ] Transformed 401 places.
[2024-05-24 03:25:18] [INFO ] Transformed 1328 transitions.
[2024-05-24 03:25:18] [INFO ] Found NUPN structural information;
[2024-05-24 03:25:18] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 313 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Anderson-PT-08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 91 place count 310 transition count 733
Iterating global reduction 0 with 91 rules applied. Total rules applied 182 place count 310 transition count 733
Applied a total of 182 rules in 109 ms. Remains 310 /401 variables (removed 91) and now considering 733/1328 (removed 595) transitions.
// Phase 1: matrix 733 rows 310 cols
[2024-05-24 03:25:18] [INFO ] Computed 19 invariants in 49 ms
[2024-05-24 03:25:19] [INFO ] Implicit Places using invariants in 832 ms returned []
[2024-05-24 03:25:19] [INFO ] Invariant cache hit.
[2024-05-24 03:25:20] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-24 03:25:20] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 2180 ms to find 0 implicit places.
[2024-05-24 03:25:20] [INFO ] Invariant cache hit.
[2024-05-24 03:25:21] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 310/401 places, 733/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2988 ms. Remains : 310/401 places, 733/1328 transitions.
Support contains 37 out of 310 places after structural reductions.
[2024-05-24 03:25:22] [INFO ] Flatten gal took : 130 ms
[2024-05-24 03:25:22] [INFO ] Flatten gal took : 71 ms
[2024-05-24 03:25:22] [INFO ] Input system was already deterministic with 733 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 824 ms. (steps per millisecond=12 ) properties (out of 25) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-24 03:25:23] [INFO ] Invariant cache hit.
[2024-05-24 03:25:23] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2024-05-24 03:25:23] [INFO ] [Real]Absence check using 9 positive and 10 generalized place invariants in 15 ms returned sat
[2024-05-24 03:25:24] [INFO ] After 631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-24 03:25:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-24 03:25:24] [INFO ] [Nat]Absence check using 9 positive and 10 generalized place invariants in 13 ms returned sat
[2024-05-24 03:25:25] [INFO ] After 1097ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2024-05-24 03:25:25] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-24 03:25:26] [INFO ] After 888ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :1 sat :10
[2024-05-24 03:25:27] [INFO ] After 1827ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 761 ms.
[2024-05-24 03:25:28] [INFO ] After 3966ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 119 ms.
Support contains 21 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 733/733 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 310 transition count 677
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 254 transition count 677
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 122 place count 244 transition count 541
Iterating global reduction 0 with 10 rules applied. Total rules applied 132 place count 244 transition count 541
Applied a total of 132 rules in 67 ms. Remains 244 /310 variables (removed 66) and now considering 541/733 (removed 192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 244/310 places, 541/733 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) 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
Running SMT prover for 4 properties.
// Phase 1: matrix 541 rows 244 cols
[2024-05-24 03:25:29] [INFO ] Computed 19 invariants in 11 ms
[2024-05-24 03:25:29] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-24 03:25:29] [INFO ] [Real]Absence check using 9 positive and 10 generalized place invariants in 13 ms returned sat
[2024-05-24 03:25:29] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 03:25:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-24 03:25:29] [INFO ] [Nat]Absence check using 9 positive and 10 generalized place invariants in 14 ms returned sat
[2024-05-24 03:25:29] [INFO ] After 562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 03:25:29] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-24 03:25:30] [INFO ] After 369ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 03:25:30] [INFO ] Deduced a trap composed of 80 places in 168 ms of which 2 ms to minimize.
[2024-05-24 03:25:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2024-05-24 03:25:30] [INFO ] After 899ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 259 ms.
[2024-05-24 03:25:31] [INFO ] After 1857ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 26 ms.
Support contains 9 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 541/541 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 237 transition count 436
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 237 transition count 436
Applied a total of 14 rules in 31 ms. Remains 237 /244 variables (removed 7) and now considering 436/541 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 237/244 places, 436/541 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 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 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 436 rows 237 cols
[2024-05-24 03:25:31] [INFO ] Computed 19 invariants in 11 ms
[2024-05-24 03:25:31] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 03:25:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-05-24 03:25:31] [INFO ] [Nat]Absence check using 10 positive and 9 generalized place invariants in 29 ms returned sat
[2024-05-24 03:25:32] [INFO ] After 465ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 03:25:32] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-24 03:25:32] [INFO ] After 408ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 03:25:32] [INFO ] After 544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 143 ms.
[2024-05-24 03:25:32] [INFO ] After 1301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 436/436 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 235 transition count 406
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 235 transition count 406
Applied a total of 4 rules in 27 ms. Remains 235 /237 variables (removed 2) and now considering 406/436 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 235/237 places, 406/436 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Finished probabilistic random walk after 110305 steps, run visited all 2 properties in 741 ms. (steps per millisecond=148 )
Probabilistic random walk after 110305 steps, saw 75506 distinct states, run finished after 741 ms. (steps per millisecond=148 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA Anderson-PT-08-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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))||G(p1)) U G(!p2)))'
Support contains 6 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 310 transition count 677
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 254 transition count 677
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 130 place count 236 transition count 421
Iterating global reduction 0 with 18 rules applied. Total rules applied 148 place count 236 transition count 421
Applied a total of 148 rules in 56 ms. Remains 236 /310 variables (removed 74) and now considering 421/733 (removed 312) transitions.
// Phase 1: matrix 421 rows 236 cols
[2024-05-24 03:25:34] [INFO ] Computed 19 invariants in 6 ms
[2024-05-24 03:25:34] [INFO ] Implicit Places using invariants in 360 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 364 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/310 places, 421/733 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 235 transition count 360
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 174 transition count 360
Applied a total of 122 rules in 17 ms. Remains 174 /235 variables (removed 61) and now considering 360/421 (removed 61) transitions.
// Phase 1: matrix 360 rows 174 cols
[2024-05-24 03:25:34] [INFO ] Computed 18 invariants in 4 ms
[2024-05-24 03:25:34] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-24 03:25:34] [INFO ] Invariant cache hit.
[2024-05-24 03:25:34] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-24 03:25:35] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 174/310 places, 360/733 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1206 ms. Remains : 174/310 places, 360/733 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 447 ms :[p2, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) p2 p1)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1)), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s19 1) (EQ s28 1)), p0:(AND (EQ s11 1) (EQ s34 1)), p1:(AND (EQ s14 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 33414 reset in 539 ms.
Product exploration explored 100000 steps with 33350 reset in 440 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 p0) (NOT p1)), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1))), (X (OR (NOT p2) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1)))), (X (X (OR (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 306 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 5 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[p2, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) p2 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 03:25:37] [INFO ] Invariant cache hit.
[2024-05-24 03:25:37] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:25:37] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2024-05-24 03:25:37] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1))), (X (OR (NOT p2) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1)))), (X (X (OR (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (G (NOT (AND p2 p1))), (G (NOT (AND (NOT p0) p2 p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (F p0), (F p2), (F (AND p2 (NOT p1))), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 25 factoid took 1203 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 174 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 360/360 transitions.
Applied a total of 0 rules in 11 ms. Remains 174 /174 variables (removed 0) and now considering 360/360 (removed 0) transitions.
[2024-05-24 03:25:39] [INFO ] Invariant cache hit.
[2024-05-24 03:25:39] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-24 03:25:39] [INFO ] Invariant cache hit.
[2024-05-24 03:25:39] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-24 03:25:40] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
[2024-05-24 03:25:40] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-24 03:25:40] [INFO ] Invariant cache hit.
[2024-05-24 03:25:40] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1209 ms. Remains : 174/174 places, 360/360 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 p2) (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 107 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :2
Finished Best-First random walk after 4891 steps, including 1 resets, run visited all 2 properties in 17 ms. (steps per millisecond=287 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F p0), (F (AND (NOT p0) p2))]
Knowledge based reduction with 9 factoid took 235 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1 reset in 191 ms.
Stack based approach found an accepted trace after 23022 steps with 0 reset with depth 23023 and stack size 17360 in 127 ms.
FORMULA Anderson-PT-08-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-00 finished in 7915 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(G(p0)))'
Support contains 5 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 292 transition count 477
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 292 transition count 477
Applied a total of 36 rules in 11 ms. Remains 292 /310 variables (removed 18) and now considering 477/733 (removed 256) transitions.
// Phase 1: matrix 477 rows 292 cols
[2024-05-24 03:25:41] [INFO ] Computed 19 invariants in 6 ms
[2024-05-24 03:25:42] [INFO ] Implicit Places using invariants in 353 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 373 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 291/310 places, 477/733 transitions.
Applied a total of 0 rules in 6 ms. Remains 291 /291 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 391 ms. Remains : 291/310 places, 477/733 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s10 1) (EQ s30 1) (EQ s33 1) (OR (EQ s20 0) (EQ s28 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLFireability-01 finished in 497 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' '!((F(((p1 U !p2)&&p0))&&F(p2)&&X(p3)))'
Support contains 6 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 292 transition count 477
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 292 transition count 477
Applied a total of 36 rules in 9 ms. Remains 292 /310 variables (removed 18) and now considering 477/733 (removed 256) transitions.
// Phase 1: matrix 477 rows 292 cols
[2024-05-24 03:25:42] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 03:25:42] [INFO ] Implicit Places using invariants in 347 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 349 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 291/310 places, 477/733 transitions.
Applied a total of 0 rules in 4 ms. Remains 291 /291 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 363 ms. Remains : 291/310 places, 477/733 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (OR (NOT p0) p2), (NOT p2), (NOT p3), p2, true]
Running random walk in product with property : Anderson-PT-08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 4}], [{ cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s31 1)), p2:(AND (EQ s13 1) (EQ s31 1)), p1:(AND (EQ s14 1) (EQ s30 1)), p3:(OR (EQ s17 0) (EQ s25 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 229 ms.
Stack based approach found an accepted trace after 71 steps with 1 reset with depth 70 and stack size 70 in 1 ms.
FORMULA Anderson-PT-08-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-03 finished in 849 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(X(X(F(p0))))))'
Support contains 2 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 290 transition count 447
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 290 transition count 447
Applied a total of 40 rules in 9 ms. Remains 290 /310 variables (removed 20) and now considering 447/733 (removed 286) transitions.
// Phase 1: matrix 447 rows 290 cols
[2024-05-24 03:25:43] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 03:25:43] [INFO ] Implicit Places using invariants in 395 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 406 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 289/310 places, 447/733 transitions.
Applied a total of 0 rules in 6 ms. Remains 289 /289 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 422 ms. Remains : 289/310 places, 447/733 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s8 1) (EQ s27 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 147 ms.
Stack based approach found an accepted trace after 53 steps with 0 reset with depth 54 and stack size 54 in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-04 finished in 774 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((F(p0)&&F(p1))))'
Support contains 4 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 310 transition count 677
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 254 transition count 677
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 132 place count 234 transition count 391
Iterating global reduction 0 with 20 rules applied. Total rules applied 152 place count 234 transition count 391
Applied a total of 152 rules in 28 ms. Remains 234 /310 variables (removed 76) and now considering 391/733 (removed 342) transitions.
// Phase 1: matrix 391 rows 234 cols
[2024-05-24 03:25:44] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 03:25:44] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-24 03:25:44] [INFO ] Invariant cache hit.
[2024-05-24 03:25:44] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-24 03:25:45] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
[2024-05-24 03:25:45] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-24 03:25:45] [INFO ] Invariant cache hit.
[2024-05-24 03:25:45] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 234/310 places, 391/733 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1683 ms. Remains : 234/310 places, 391/733 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s205 1)), p1:(AND (OR (EQ s0 0) (EQ s205 0)) (EQ s23 1) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 191 ms.
Stack based approach found an accepted trace after 89 steps with 0 reset with depth 90 and stack size 90 in 1 ms.
FORMULA Anderson-PT-08-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-05 finished in 2007 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)||F(((!p1&&F((!p1&&G(!p2))))||G((F(!p1)&&F(G(!p2))))))))))'
Support contains 4 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 290 transition count 447
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 290 transition count 447
Applied a total of 40 rules in 9 ms. Remains 290 /310 variables (removed 20) and now considering 447/733 (removed 286) transitions.
// Phase 1: matrix 447 rows 290 cols
[2024-05-24 03:25:46] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 03:25:46] [INFO ] Implicit Places using invariants in 411 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 419 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 289/310 places, 447/733 transitions.
Applied a total of 0 rules in 4 ms. Remains 289 /289 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 433 ms. Remains : 289/310 places, 447/733 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2), p2, p2, p1, (AND (NOT p0) p2)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(OR p1 p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={0} source=6 dest: 6}], [{ cond=(AND p0 p2), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s194 0)), p1:(AND (EQ s14 1) (EQ s25 1)), p2:(AND (EQ s6 1) (EQ s194 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 146 ms.
Stack based approach found an accepted trace after 1983 steps with 0 reset with depth 1984 and stack size 1324 in 5 ms.
FORMULA Anderson-PT-08-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-06 finished in 945 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((G((F(p1)||p0))&&X((!p2 U (p3||G(!p2)))))))'
Support contains 6 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 292 transition count 477
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 292 transition count 477
Applied a total of 36 rules in 10 ms. Remains 292 /310 variables (removed 18) and now considering 477/733 (removed 256) transitions.
// Phase 1: matrix 477 rows 292 cols
[2024-05-24 03:25:47] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 03:25:47] [INFO ] Implicit Places using invariants in 351 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 360 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 291/310 places, 477/733 transitions.
Applied a total of 0 rules in 4 ms. Remains 291 /291 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 375 ms. Remains : 291/310 places, 477/733 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p3) p2), true]
Running random walk in product with property : Anderson-PT-08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (NEQ s15 1) (NEQ s34 1)), p1:(OR (NEQ s21 1) (NEQ s29 1)), p3:(AND (NOT (AND (EQ s13 1) (EQ s26 1))) (NOT (AND (EQ s15 1) (EQ s34 1)))), p2:(AND (E...], 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]]
Product exploration explored 100000 steps with 0 reset in 143 ms.
Product exploration explored 100000 steps with 3 reset in 192 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 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), true, (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 151 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) 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 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 477 rows 291 cols
[2024-05-24 03:25:48] [INFO ] Computed 18 invariants in 3 ms
[2024-05-24 03:25:48] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-24 03:25:48] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 20 ms returned sat
[2024-05-24 03:25:48] [INFO ] After 101ms 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 p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), true, (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 21 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-08-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-08-LTLFireability-07 finished in 1495 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||(p1&&X(F(p1)))||G(F(p1))))))'
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 291 transition count 448
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 291 transition count 448
Applied a total of 38 rules in 9 ms. Remains 291 /310 variables (removed 19) and now considering 448/733 (removed 285) transitions.
// Phase 1: matrix 448 rows 291 cols
[2024-05-24 03:25:48] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 03:25:48] [INFO ] Implicit Places using invariants in 372 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 374 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 290/310 places, 448/733 transitions.
Applied a total of 0 rules in 4 ms. Remains 290 /290 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 388 ms. Remains : 290/310 places, 448/733 transitions.
Stuttering acceptance computed with spot in 106 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-08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s28 1)), p1:(NEQ s41 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 33333 reset in 268 ms.
Product exploration explored 100000 steps with 33333 reset in 290 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 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-08-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-08-LTLFireability-12 finished in 1092 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(G((F(p1)&&p0))))'
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 291 transition count 462
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 291 transition count 462
Applied a total of 38 rules in 9 ms. Remains 291 /310 variables (removed 19) and now considering 462/733 (removed 271) transitions.
// Phase 1: matrix 462 rows 291 cols
[2024-05-24 03:25:49] [INFO ] Computed 19 invariants in 5 ms
[2024-05-24 03:25:49] [INFO ] Implicit Places using invariants in 396 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 397 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 290/310 places, 462/733 transitions.
Applied a total of 0 rules in 4 ms. Remains 290 /290 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 410 ms. Remains : 290/310 places, 462/733 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s25 1)), p1:(AND (EQ s21 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLFireability-13 finished in 554 ms.
All properties solved by simple procedures.
Total runtime 31978 ms.

BK_STOP 1716521151287

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Anderson-PT-08, 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 r021-smll-171620128200218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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