fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r285-smll-171654422100163
Last Updated
July 7, 2024

About the Execution of 2023-gold for Peterson-PT-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
368.775 25216.00 47908.00 508.90 FFFFFFFFFFFFFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r285-smll-171654422100163.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 Peterson-PT-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422100163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 12 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 12 02:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 12 02:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 108K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 511K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 71K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 344K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 143K May 18 16:43 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 Peterson-PT-3-LTLFireability-00
FORMULA_NAME Peterson-PT-3-LTLFireability-01
FORMULA_NAME Peterson-PT-3-LTLFireability-02
FORMULA_NAME Peterson-PT-3-LTLFireability-03
FORMULA_NAME Peterson-PT-3-LTLFireability-04
FORMULA_NAME Peterson-PT-3-LTLFireability-05
FORMULA_NAME Peterson-PT-3-LTLFireability-06
FORMULA_NAME Peterson-PT-3-LTLFireability-07
FORMULA_NAME Peterson-PT-3-LTLFireability-08
FORMULA_NAME Peterson-PT-3-LTLFireability-09
FORMULA_NAME Peterson-PT-3-LTLFireability-10
FORMULA_NAME Peterson-PT-3-LTLFireability-11
FORMULA_NAME Peterson-PT-3-LTLFireability-12
FORMULA_NAME Peterson-PT-3-LTLFireability-13
FORMULA_NAME Peterson-PT-3-LTLFireability-14
FORMULA_NAME Peterson-PT-3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716898922162

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=Peterson-PT-3
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 12:22:05] [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-28 12:22:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 12:22:05] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2024-05-28 12:22:05] [INFO ] Transformed 244 places.
[2024-05-28 12:22:05] [INFO ] Transformed 332 transitions.
[2024-05-28 12:22:05] [INFO ] Found NUPN structural information;
[2024-05-28 12:22:05] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 307 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-PT-3-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 222 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 52 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 12:22:06] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-28 12:22:06] [INFO ] Computed 15 invariants in 30 ms
[2024-05-28 12:22:06] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-05-28 12:22:06] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 12:22:06] [INFO ] Invariant cache hit.
[2024-05-28 12:22:06] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 12:22:06] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
[2024-05-28 12:22:06] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 12:22:06] [INFO ] Invariant cache hit.
[2024-05-28 12:22:07] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1615 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 222 out of 244 places after structural reductions.
[2024-05-28 12:22:08] [INFO ] Flatten gal took : 122 ms
[2024-05-28 12:22:08] [INFO ] Flatten gal took : 65 ms
[2024-05-28 12:22:08] [INFO ] Input system was already deterministic with 332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 599 ms. (steps per millisecond=16 ) properties (out of 27) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :1
Running SMT prover for 5 properties.
[2024-05-28 12:22:09] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 12:22:09] [INFO ] Invariant cache hit.
[2024-05-28 12:22:09] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 12:22:09] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-28 12:22:09] [INFO ] After 232ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2024-05-28 12:22:09] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 12:22:09] [INFO ] After 68ms SMT Verify possible using 57 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-28 12:22:09] [INFO ] After 503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-28 12:22:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-28 12:22:10] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-28 12:22:10] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-28 12:22:10] [INFO ] After 121ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-28 12:22:10] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 7 ms to minimize.
[2024-05-28 12:22:10] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 1 ms to minimize.
[2024-05-28 12:22:10] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 2 ms to minimize.
[2024-05-28 12:22:11] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-05-28 12:22:11] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
[2024-05-28 12:22:11] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:22:11] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 0 ms to minimize.
[2024-05-28 12:22:11] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 1 ms to minimize.
[2024-05-28 12:22:11] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 1 ms to minimize.
[2024-05-28 12:22:11] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2024-05-28 12:22:11] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 0 ms to minimize.
[2024-05-28 12:22:11] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 0 ms to minimize.
[2024-05-28 12:22:12] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 1 ms to minimize.
[2024-05-28 12:22:12] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 1 ms to minimize.
[2024-05-28 12:22:12] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1736 ms
[2024-05-28 12:22:12] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 1 ms to minimize.
[2024-05-28 12:22:12] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 0 ms to minimize.
[2024-05-28 12:22:12] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 1 ms to minimize.
[2024-05-28 12:22:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 328 ms
[2024-05-28 12:22:12] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-05-28 12:22:12] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2024-05-28 12:22:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
[2024-05-28 12:22:12] [INFO ] After 2584ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 114 ms.
[2024-05-28 12:22:13] [INFO ] After 3078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 93 ms.
Support contains 16 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 244 transition count 246
Reduce places removed 86 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 89 rules applied. Total rules applied 175 place count 158 transition count 243
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 178 place count 155 transition count 243
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 178 place count 155 transition count 198
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 268 place count 110 transition count 198
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 282 place count 103 transition count 191
Applied a total of 282 rules in 42 ms. Remains 103 /244 variables (removed 141) and now considering 191/332 (removed 141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 103/244 places, 191/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Finished probabilistic random walk after 179533 steps, run visited all 5 properties in 720 ms. (steps per millisecond=249 )
Probabilistic random walk after 179533 steps, saw 36088 distinct states, run finished after 722 ms. (steps per millisecond=248 ) properties seen :5
Parikh walk visited 0 properties in 0 ms.
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)))))'
Support contains 16 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 244 transition count 238
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 188 place count 150 transition count 238
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 188 place count 150 transition count 196
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 272 place count 108 transition count 196
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 280 place count 104 transition count 192
Applied a total of 280 rules in 46 ms. Remains 104 /244 variables (removed 140) and now considering 192/332 (removed 140) transitions.
[2024-05-28 12:22:14] [INFO ] Flow matrix only has 168 transitions (discarded 24 similar events)
// Phase 1: matrix 168 rows 104 cols
[2024-05-28 12:22:14] [INFO ] Computed 15 invariants in 3 ms
[2024-05-28 12:22:15] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-28 12:22:15] [INFO ] Flow matrix only has 168 transitions (discarded 24 similar events)
[2024-05-28 12:22:15] [INFO ] Invariant cache hit.
[2024-05-28 12:22:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 12:22:15] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-05-28 12:22:15] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-28 12:22:15] [INFO ] Flow matrix only has 168 transitions (discarded 24 similar events)
[2024-05-28 12:22:15] [INFO ] Invariant cache hit.
[2024-05-28 12:22:15] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/244 places, 192/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 763 ms. Remains : 104/244 places, 192/332 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 283 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-3-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s33 1) (EQ s35 1) (EQ s34 1) (EQ s36 1) (EQ s39 1) (EQ s38 1) (EQ s40 1) (EQ s32 1)), p0:(AND (OR (EQ s57 0) (EQ s94 0)) (OR (EQ s58 0) (EQ s95...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9688 reset in 494 ms.
Stack based approach found an accepted trace after 32 steps with 3 reset with depth 8 and stack size 8 in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-00 finished in 1645 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(p0)&&X(X(X(G(p1))))))'
Support contains 76 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 14 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 12:22:16] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-28 12:22:16] [INFO ] Computed 15 invariants in 3 ms
[2024-05-28 12:22:16] [INFO ] Implicit Places using invariants in 128 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 131 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 12 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Peterson-PT-3-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s195 1) (EQ s194 1) (EQ s199 1) (EQ s198 1) (EQ s196 1) (EQ s203 1) (EQ s202 1) (EQ s200 1) (EQ s204 1) (EQ s214 1) (EQ s213 1) (EQ s218 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 1 reset in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-01 finished in 441 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&&(G(p1)||G(p2)))))'
Support contains 56 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 12:22:16] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 12:22:16] [INFO ] Invariant cache hit.
[2024-05-28 12:22:17] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-28 12:22:17] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 12:22:17] [INFO ] Invariant cache hit.
[2024-05-28 12:22:17] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 12:22:17] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
[2024-05-28 12:22:17] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 12:22:17] [INFO ] Invariant cache hit.
[2024-05-28 12:22:17] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1006 ms. Remains : 244/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 248 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p1)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(AND (OR (EQ s110 0) (EQ s230 0)) (OR (EQ s111 0) (EQ s231 0)) (OR (EQ s112 0) (EQ s232 0)) (OR (EQ s113 0) (EQ s233 0))), p1:(AND (EQ s65 0) (EQ s64 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-02 finished in 1276 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 ((X(!p2)||p1) U p3))))'
Support contains 72 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 12:22:18] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 12:22:18] [INFO ] Invariant cache hit.
[2024-05-28 12:22:18] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-28 12:22:18] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 12:22:18] [INFO ] Invariant cache hit.
[2024-05-28 12:22:18] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 12:22:18] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2024-05-28 12:22:18] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 12:22:18] [INFO ] Invariant cache hit.
[2024-05-28 12:22:19] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 996 ms. Remains : 244/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p3) p2), true, (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p3) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p3:(OR (EQ s0 1) (EQ s1 1) (EQ s2 1) (EQ s3 1) (EQ s4 1) (EQ s5 1) (EQ s6 1) (EQ s7 1) (EQ s8 1) (EQ s9 1) (EQ s10 1) (EQ s11 1) (EQ s12 1) (EQ s13 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3801 reset in 537 ms.
Stack based approach found an accepted trace after 136 steps with 5 reset with depth 17 and stack size 17 in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-03 finished in 1793 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(p0)&&(X(G(p1))||G(p2))))'
Support contains 100 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 12:22:20] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 12:22:20] [INFO ] Invariant cache hit.
[2024-05-28 12:22:20] [INFO ] Implicit Places using invariants in 99 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 103 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 16 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (EQ s211 1) (EQ s227 1)) (AND (EQ s216 1) (EQ s228 1)) (AND (EQ s211 1) (EQ s228 1)) (AND (EQ s216 1) (EQ s229 1)) (AND (EQ s211 1) (EQ s226 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-04 finished in 387 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(G(p0))&&G(p1)))))'
Support contains 88 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 12:22:20] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 12:22:20] [INFO ] Invariant cache hit.
[2024-05-28 12:22:20] [INFO ] Implicit Places using invariants in 146 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 149 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-3-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(AND (EQ s65 0) (EQ s64 0) (EQ s67 0) (EQ s66 0) (EQ s69 0) (EQ s68 0) (EQ s71 0) (EQ s70 0) (EQ s73 0) (EQ s72 0) (EQ s75 0) (EQ s74 0) (EQ s77 0) (EQ...], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-05 finished in 356 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&&X(G(p1))))))'
Support contains 64 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 12:22:20] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 12:22:20] [INFO ] Invariant cache hit.
[2024-05-28 12:22:20] [INFO ] Implicit Places using invariants in 121 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 123 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s170 1) (EQ s230 1)) (AND (EQ s146 1) (EQ s206 1)) (AND (EQ s145 1) (EQ s211 1)) (AND (EQ s148 1) (EQ s209 1)) (AND (EQ s171 1) (EQ s208 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 610 ms.
Stack based approach found an accepted trace after 217 steps with 0 reset with depth 218 and stack size 218 in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-06 finished in 878 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(G(!p0)))'
Support contains 40 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 244 transition count 272
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 184 transition count 272
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 120 place count 184 transition count 224
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 216 place count 136 transition count 224
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 240 place count 124 transition count 212
Applied a total of 240 rules in 22 ms. Remains 124 /244 variables (removed 120) and now considering 212/332 (removed 120) transitions.
[2024-05-28 12:22:21] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
// Phase 1: matrix 188 rows 124 cols
[2024-05-28 12:22:21] [INFO ] Computed 15 invariants in 1 ms
[2024-05-28 12:22:21] [INFO ] Implicit Places using invariants in 86 ms returned [117, 118, 119, 120]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 89 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/244 places, 212/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 119 ms. Remains : 120/244 places, 212/332 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : Peterson-PT-3-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s51 1) (EQ s72 1)) (AND (EQ s51 1) (EQ s71 1)) (AND (EQ s51 1) (EQ s70 1)) (AND (EQ s51 1) (EQ s69 1)) (AND (EQ s49 1) (EQ s53 1)) (AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 500 ms.
Stack based approach found an accepted trace after 188 steps with 0 reset with depth 189 and stack size 183 in 2 ms.
FORMULA Peterson-PT-3-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-07 finished in 672 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((p0||X(p0))))'
Support contains 1 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 244 transition count 238
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 95 rules applied. Total rules applied 189 place count 150 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 190 place count 149 transition count 237
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 190 place count 149 transition count 189
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 286 place count 101 transition count 189
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 308 place count 90 transition count 178
Applied a total of 308 rules in 26 ms. Remains 90 /244 variables (removed 154) and now considering 178/332 (removed 154) transitions.
[2024-05-28 12:22:22] [INFO ] Flow matrix only has 154 transitions (discarded 24 similar events)
// Phase 1: matrix 154 rows 90 cols
[2024-05-28 12:22:22] [INFO ] Computed 15 invariants in 1 ms
[2024-05-28 12:22:22] [INFO ] Implicit Places using invariants in 124 ms returned [83, 84, 85, 86]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 128 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/244 places, 178/332 transitions.
Applied a total of 0 rules in 9 ms. Remains 86 /86 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 166 ms. Remains : 86/244 places, 178/332 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s49 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][true]]
Product exploration explored 100000 steps with 0 reset in 209 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-09 finished in 443 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 1 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 12:22:22] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-28 12:22:22] [INFO ] Computed 15 invariants in 3 ms
[2024-05-28 12:22:22] [INFO ] Implicit Places using invariants in 208 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 210 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 219 ms. Remains : 240/244 places, 332/332 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 : Peterson-PT-3-LTLFireability-10 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:(EQ s219 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 0 reset in 206 ms.
Stack based approach found an accepted trace after 75 steps with 0 reset with depth 76 and stack size 76 in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-10 finished in 638 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(G(p1)))))'
Support contains 3 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 244 transition count 239
Reduce places removed 93 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 94 rules applied. Total rules applied 187 place count 151 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 188 place count 150 transition count 238
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 188 place count 150 transition count 191
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 282 place count 103 transition count 191
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 306 place count 91 transition count 179
Applied a total of 306 rules in 21 ms. Remains 91 /244 variables (removed 153) and now considering 179/332 (removed 153) transitions.
[2024-05-28 12:22:23] [INFO ] Flow matrix only has 155 transitions (discarded 24 similar events)
// Phase 1: matrix 155 rows 91 cols
[2024-05-28 12:22:23] [INFO ] Computed 15 invariants in 2 ms
[2024-05-28 12:22:23] [INFO ] Implicit Places using invariants in 100 ms returned [83, 84, 85, 86]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 103 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/244 places, 179/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 129 ms. Remains : 87/244 places, 179/332 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-11 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (EQ s48 0) (EQ s86 0)) (EQ s69 0)), p1:(OR (EQ s48 0) (EQ s86 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 141 ms.
Stack based approach found an accepted trace after 66 steps with 0 reset with depth 67 and stack size 58 in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-11 finished in 419 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((p0 U G((p1||G(p2)))))))'
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 12:22:23] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-28 12:22:23] [INFO ] Computed 15 invariants in 7 ms
[2024-05-28 12:22:24] [INFO ] Implicit Places using invariants in 226 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 228 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 234 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-PT-3-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=2 dest: 6}], [{ cond=true, acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2) p0), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s157 1), p0:(AND (EQ s111 1) (EQ s149 1)), p2:(EQ s201 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 52 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-12 finished in 592 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((G(F(p0))||(F(p0)&&X(p1)))))'
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 12:22:24] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 12:22:24] [INFO ] Invariant cache hit.
[2024-05-28 12:22:24] [INFO ] Implicit Places using invariants in 211 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 213 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 219 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-3-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s53 1), p1:(NEQ s56 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 544 ms.
Product exploration explored 100000 steps with 50000 reset in 358 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), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 24 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-3-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-3-LTLFireability-13 finished in 1307 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)&&F(p1))))'
Support contains 3 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 12:22:25] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 12:22:25] [INFO ] Invariant cache hit.
[2024-05-28 12:22:25] [INFO ] Implicit Places using invariants in 231 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 233 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 238 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-3-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s115 0) (EQ s235 0)), p1:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 134 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-15 finished in 450 ms.
All properties solved by simple procedures.
Total runtime 20930 ms.

BK_STOP 1716898947378

--------------------
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="Peterson-PT-3"
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 Peterson-PT-3, 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 r285-smll-171654422100163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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