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.r571-tall-171734910200078.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 CO4-PT-16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910200078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 8.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 260K Jun 2 16:33 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 CO4-PT-16-LTLFireability-00
FORMULA_NAME CO4-PT-16-LTLFireability-01
FORMULA_NAME CO4-PT-16-LTLFireability-02
FORMULA_NAME CO4-PT-16-LTLFireability-03
FORMULA_NAME CO4-PT-16-LTLFireability-04
FORMULA_NAME CO4-PT-16-LTLFireability-05
FORMULA_NAME CO4-PT-16-LTLFireability-06
FORMULA_NAME CO4-PT-16-LTLFireability-07
FORMULA_NAME CO4-PT-16-LTLFireability-08
FORMULA_NAME CO4-PT-16-LTLFireability-09
FORMULA_NAME CO4-PT-16-LTLFireability-10
FORMULA_NAME CO4-PT-16-LTLFireability-11
FORMULA_NAME CO4-PT-16-LTLFireability-12
FORMULA_NAME CO4-PT-16-LTLFireability-13
FORMULA_NAME CO4-PT-16-LTLFireability-14
FORMULA_NAME CO4-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717368772155

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=CO4-PT-16
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:52:53] [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-06-02 22:52:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:52:54] [INFO ] Load time of PNML (sax parser for PT used): 301 ms
[2024-06-02 22:52:54] [INFO ] Transformed 837 places.
[2024-06-02 22:52:54] [INFO ] Transformed 1122 transitions.
[2024-06-02 22:52:54] [INFO ] Found NUPN structural information;
[2024-06-02 22:52:54] [INFO ] Parsed PT model containing 837 places and 1122 transitions and 3052 arcs in 376 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 116 places in 10 ms
Reduce places removed 116 places and 180 transitions.
FORMULA CO4-PT-16-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 721/721 places, 942/942 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 704 transition count 939
Discarding 160 places :
Symmetric choice reduction at 1 with 160 rule applications. Total rules 180 place count 544 transition count 777
Iterating global reduction 1 with 160 rules applied. Total rules applied 340 place count 544 transition count 777
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 346 place count 544 transition count 771
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 431 place count 459 transition count 669
Iterating global reduction 2 with 85 rules applied. Total rules applied 516 place count 459 transition count 669
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 519 place count 459 transition count 666
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 537 place count 441 transition count 639
Iterating global reduction 3 with 18 rules applied. Total rules applied 555 place count 441 transition count 639
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 557 place count 441 transition count 637
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 566 place count 432 transition count 628
Iterating global reduction 4 with 9 rules applied. Total rules applied 575 place count 432 transition count 628
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 581 place count 426 transition count 622
Iterating global reduction 4 with 6 rules applied. Total rules applied 587 place count 426 transition count 622
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 593 place count 426 transition count 616
Applied a total of 593 rules in 143 ms. Remains 426 /721 variables (removed 295) and now considering 616/942 (removed 326) transitions.
// Phase 1: matrix 616 rows 426 cols
[2024-06-02 22:52:54] [INFO ] Computed 7 invariants in 22 ms
[2024-06-02 22:52:54] [INFO ] Implicit Places using invariants in 266 ms returned [5, 361]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 291 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 424/721 places, 616/942 transitions.
Applied a total of 0 rules in 11 ms. Remains 424 /424 variables (removed 0) and now considering 616/616 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 446 ms. Remains : 424/721 places, 616/942 transitions.
Support contains 31 out of 424 places after structural reductions.
[2024-06-02 22:52:54] [INFO ] Flatten gal took : 73 ms
[2024-06-02 22:52:54] [INFO ] Flatten gal took : 33 ms
[2024-06-02 22:52:55] [INFO ] Input system was already deterministic with 616 transitions.
Incomplete random walk after 10000 steps, including 223 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 25) seen :6
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 616 rows 424 cols
[2024-06-02 22:52:55] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 22:52:55] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-02 22:52:56] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-06-02 22:52:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 22:52:56] [INFO ] After 588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-06-02 22:52:57] [INFO ] After 1315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 426 ms.
[2024-06-02 22:52:58] [INFO ] After 2077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 17 properties in 109 ms.
Support contains 5 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 445 edges and 424 vertex of which 2 / 424 are part of one of the 1 SCC in 7 ms
Free SCC test removed 1 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 917 edges and 423 vertex of which 418 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 154 rules applied. Total rules applied 156 place count 418 transition count 448
Reduce places removed 151 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 155 rules applied. Total rules applied 311 place count 267 transition count 444
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 317 place count 266 transition count 439
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 322 place count 261 transition count 439
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 322 place count 261 transition count 394
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 412 place count 216 transition count 394
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 419 place count 209 transition count 386
Iterating global reduction 4 with 7 rules applied. Total rules applied 426 place count 209 transition count 386
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 429 place count 209 transition count 383
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 429 place count 209 transition count 380
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 435 place count 206 transition count 380
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 438 place count 203 transition count 374
Iterating global reduction 5 with 3 rules applied. Total rules applied 441 place count 203 transition count 374
Performed 58 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 5 with 116 rules applied. Total rules applied 557 place count 145 transition count 303
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 17 rules applied. Total rules applied 574 place count 145 transition count 286
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 580 place count 142 transition count 283
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 583 place count 139 transition count 277
Iterating global reduction 7 with 3 rules applied. Total rules applied 586 place count 139 transition count 277
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 592 place count 136 transition count 274
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 593 place count 136 transition count 273
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 594 place count 135 transition count 271
Iterating global reduction 8 with 1 rules applied. Total rules applied 595 place count 135 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 596 place count 135 transition count 270
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 9 with 78 rules applied. Total rules applied 674 place count 96 transition count 309
Drop transitions removed 16 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 9 with 35 rules applied. Total rules applied 709 place count 96 transition count 274
Discarding 26 places :
Symmetric choice reduction at 10 with 26 rule applications. Total rules 735 place count 70 transition count 181
Iterating global reduction 10 with 26 rules applied. Total rules applied 761 place count 70 transition count 181
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 778 place count 70 transition count 164
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 784 place count 64 transition count 135
Iterating global reduction 11 with 6 rules applied. Total rules applied 790 place count 64 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 794 place count 64 transition count 131
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 799 place count 64 transition count 126
Free-agglomeration rule applied 15 times.
Iterating global reduction 12 with 15 rules applied. Total rules applied 814 place count 64 transition count 111
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 831 place count 49 transition count 109
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 13 with 6 rules applied. Total rules applied 837 place count 49 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 838 place count 48 transition count 108
Applied a total of 838 rules in 153 ms. Remains 48 /424 variables (removed 376) and now considering 108/616 (removed 508) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 48/424 places, 108/616 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Finished probabilistic random walk after 23574 steps, run visited all 2 properties in 84 ms. (steps per millisecond=280 )
Probabilistic random walk after 23574 steps, saw 4776 distinct states, run finished after 84 ms. (steps per millisecond=280 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 919 edges and 424 vertex of which 420 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 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(G(p0))||G(p1))))'
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 415 transition count 606
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 415 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 415 transition count 604
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 413 transition count 601
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 413 transition count 601
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 412 transition count 600
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 412 transition count 600
Applied a total of 26 rules in 27 ms. Remains 412 /424 variables (removed 12) and now considering 600/616 (removed 16) transitions.
// Phase 1: matrix 600 rows 412 cols
[2024-06-02 22:52:59] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:52:59] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-02 22:52:59] [INFO ] Invariant cache hit.
[2024-06-02 22:52:59] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2024-06-02 22:52:59] [INFO ] Invariant cache hit.
[2024-06-02 22:52:59] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 412/424 places, 600/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 835 ms. Remains : 412/424 places, 600/616 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 191 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-16-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(EQ s78 1), p0:(AND (EQ s119 1) (EQ s160 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]]
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 2 ms.
FORMULA CO4-PT-16-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-00 finished in 1085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 415 transition count 606
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 415 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 415 transition count 604
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 413 transition count 600
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 413 transition count 600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 412 transition count 599
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 412 transition count 599
Applied a total of 26 rules in 28 ms. Remains 412 /424 variables (removed 12) and now considering 599/616 (removed 17) transitions.
// Phase 1: matrix 599 rows 412 cols
[2024-06-02 22:53:00] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 22:53:00] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-02 22:53:00] [INFO ] Invariant cache hit.
[2024-06-02 22:53:00] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-06-02 22:53:00] [INFO ] Invariant cache hit.
[2024-06-02 22:53:00] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 412/424 places, 599/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 691 ms. Remains : 412/424 places, 599/616 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s315 0), p0:(EQ s304 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 334 ms.
Product exploration explored 100000 steps with 50000 reset in 291 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 895 edges and 412 vertex of which 409 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-16-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-16-LTLFireability-01 finished in 1599 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))'
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 457 edges and 424 vertex of which 2 / 424 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 918 edges and 423 vertex of which 419 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 155 place count 418 transition count 456
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 157 rules applied. Total rules applied 312 place count 265 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 313 place count 264 transition count 452
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 313 place count 264 transition count 405
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 407 place count 217 transition count 405
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 411 place count 213 transition count 400
Iterating global reduction 3 with 4 rules applied. Total rules applied 415 place count 213 transition count 400
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 415 place count 213 transition count 397
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 421 place count 210 transition count 397
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 424 place count 207 transition count 391
Iterating global reduction 3 with 3 rules applied. Total rules applied 427 place count 207 transition count 391
Performed 61 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 549 place count 146 transition count 315
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 18 rules applied. Total rules applied 567 place count 146 transition count 297
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 573 place count 143 transition count 294
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 576 place count 140 transition count 288
Iterating global reduction 5 with 3 rules applied. Total rules applied 579 place count 140 transition count 288
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 587 place count 136 transition count 284
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 588 place count 135 transition count 282
Iterating global reduction 5 with 1 rules applied. Total rules applied 589 place count 135 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 590 place count 135 transition count 281
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 672 place count 94 transition count 326
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 693 place count 94 transition count 305
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 720 place count 67 transition count 197
Iterating global reduction 7 with 27 rules applied. Total rules applied 747 place count 67 transition count 197
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 765 place count 67 transition count 179
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 772 place count 60 transition count 141
Iterating global reduction 8 with 7 rules applied. Total rules applied 779 place count 60 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 784 place count 60 transition count 136
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 796 place count 60 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 798 place count 58 transition count 122
Applied a total of 798 rules in 75 ms. Remains 58 /424 variables (removed 366) and now considering 122/616 (removed 494) transitions.
[2024-06-02 22:53:01] [INFO ] Flow matrix only has 105 transitions (discarded 17 similar events)
// Phase 1: matrix 105 rows 58 cols
[2024-06-02 22:53:01] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 22:53:01] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-02 22:53:01] [INFO ] Flow matrix only has 105 transitions (discarded 17 similar events)
[2024-06-02 22:53:01] [INFO ] Invariant cache hit.
[2024-06-02 22:53:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:53:01] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-06-02 22:53:01] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:53:01] [INFO ] Flow matrix only has 105 transitions (discarded 17 similar events)
[2024-06-02 22:53:01] [INFO ] Invariant cache hit.
[2024-06-02 22:53:01] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/424 places, 122/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 227 ms. Remains : 58/424 places, 122/616 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s4 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]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-03 finished in 278 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(F(p0))&&F((!p0 U (p1||G(!p0))))))))'
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 415 transition count 606
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 415 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 415 transition count 604
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 413 transition count 601
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 413 transition count 601
Applied a total of 24 rules in 20 ms. Remains 413 /424 variables (removed 11) and now considering 601/616 (removed 15) transitions.
// Phase 1: matrix 601 rows 413 cols
[2024-06-02 22:53:02] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 22:53:02] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 22:53:02] [INFO ] Invariant cache hit.
[2024-06-02 22:53:02] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-06-02 22:53:02] [INFO ] Invariant cache hit.
[2024-06-02 22:53:02] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 413/424 places, 601/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 516 ms. Remains : 413/424 places, 601/616 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (NEQ s12 1) (NOT (AND (EQ s348 1) (EQ s367 1) (EQ s403 1)))), p0:(AND (EQ s348 1) (EQ s367 1) (EQ s403 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-04 finished in 746 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)&&X(G(X(p1)))) U p2)))'
Support contains 6 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 415 transition count 607
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 415 transition count 607
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 415 transition count 605
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 412 transition count 600
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 412 transition count 600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 411 transition count 599
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 411 transition count 599
Applied a total of 28 rules in 24 ms. Remains 411 /424 variables (removed 13) and now considering 599/616 (removed 17) transitions.
// Phase 1: matrix 599 rows 411 cols
[2024-06-02 22:53:02] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 22:53:02] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 22:53:02] [INFO ] Invariant cache hit.
[2024-06-02 22:53:03] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-06-02 22:53:03] [INFO ] Invariant cache hit.
[2024-06-02 22:53:03] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 411/424 places, 599/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 569 ms. Remains : 411/424 places, 599/616 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CO4-PT-16-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s242 1) (EQ s346 1) (EQ s398 1)), p0:(NEQ s47 1), p1:(OR (EQ s89 1) (EQ s389 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA CO4-PT-16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-05 finished in 757 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((!(X(p0) U p1)&&!(p0 U p2)))))'
Support contains 2 out of 424 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 414 transition count 605
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 414 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 414 transition count 603
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 411 transition count 598
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 411 transition count 598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 410 transition count 597
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 410 transition count 597
Applied a total of 30 rules in 24 ms. Remains 410 /424 variables (removed 14) and now considering 597/616 (removed 19) transitions.
// Phase 1: matrix 597 rows 410 cols
[2024-06-02 22:53:03] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 22:53:03] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 22:53:03] [INFO ] Invariant cache hit.
[2024-06-02 22:53:03] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-06-02 22:53:03] [INFO ] Invariant cache hit.
[2024-06-02 22:53:04] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 410/424 places, 597/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 543 ms. Remains : 410/424 places, 597/616 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (OR p2 p1), (OR p2 p1)]
Running random walk in product with property : CO4-PT-16-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s52 1), p2:(EQ s202 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 119 reset in 102 ms.
Product exploration explored 100000 steps with 274 reset in 186 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 893 edges and 410 vertex of which 407 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 87 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (OR p2 p1)]
Incomplete random walk after 10000 steps, including 222 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1126531 steps, run timeout after 3001 ms. (steps per millisecond=375 ) properties seen :{}
Probabilistic random walk after 1126531 steps, saw 173313 distinct states, run finished after 3004 ms. (steps per millisecond=375 ) properties seen :0
Running SMT prover for 2 properties.
[2024-06-02 22:53:07] [INFO ] Invariant cache hit.
[2024-06-02 22:53:07] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:53:07] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:53:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 22:53:08] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 22:53:08] [INFO ] After 251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-06-02 22:53:08] [INFO ] After 377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 31 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2))))]
False Knowledge obtained : [(F (OR p1 p2)), (F (NOT (AND (NOT p1) (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (OR p1 p2))
Knowledge based reduction with 6 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-16-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-16-LTLFireability-07 finished in 4951 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||G(p1)))&&F(G(p2)))))'
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 445 edges and 424 vertex of which 2 / 424 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 918 edges and 423 vertex of which 419 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 146 place count 418 transition count 465
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 147 rules applied. Total rules applied 293 place count 274 transition count 462
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 8 rules applied. Total rules applied 301 place count 273 transition count 455
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 309 place count 266 transition count 454
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 309 place count 266 transition count 408
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 401 place count 220 transition count 408
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 405 place count 216 transition count 403
Iterating global reduction 4 with 4 rules applied. Total rules applied 409 place count 216 transition count 403
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 409 place count 216 transition count 400
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 415 place count 213 transition count 400
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 418 place count 210 transition count 394
Iterating global reduction 4 with 3 rules applied. Total rules applied 421 place count 210 transition count 394
Performed 61 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 543 place count 149 transition count 319
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 17 rules applied. Total rules applied 560 place count 149 transition count 302
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 565 place count 147 transition count 299
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 567 place count 146 transition count 298
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 570 place count 143 transition count 292
Iterating global reduction 7 with 3 rules applied. Total rules applied 573 place count 143 transition count 292
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 579 place count 140 transition count 289
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 580 place count 139 transition count 287
Iterating global reduction 7 with 1 rules applied. Total rules applied 581 place count 139 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 582 place count 139 transition count 286
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 8 with 82 rules applied. Total rules applied 664 place count 98 transition count 332
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 683 place count 98 transition count 313
Discarding 28 places :
Symmetric choice reduction at 9 with 28 rule applications. Total rules 711 place count 70 transition count 201
Iterating global reduction 9 with 28 rules applied. Total rules applied 739 place count 70 transition count 201
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 756 place count 70 transition count 184
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 763 place count 63 transition count 146
Iterating global reduction 10 with 7 rules applied. Total rules applied 770 place count 63 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 775 place count 63 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 777 place count 62 transition count 158
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 11 with 19 rules applied. Total rules applied 796 place count 62 transition count 139
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 798 place count 62 transition count 139
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 800 place count 60 transition count 137
Applied a total of 800 rules in 70 ms. Remains 60 /424 variables (removed 364) and now considering 137/616 (removed 479) transitions.
[2024-06-02 22:53:08] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
// Phase 1: matrix 123 rows 60 cols
[2024-06-02 22:53:08] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:53:08] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 22:53:08] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
[2024-06-02 22:53:08] [INFO ] Invariant cache hit.
[2024-06-02 22:53:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 22:53:08] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-06-02 22:53:08] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:53:08] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
[2024-06-02 22:53:08] [INFO ] Invariant cache hit.
[2024-06-02 22:53:08] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/424 places, 137/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 60/424 places, 137/616 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : CO4-PT-16-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s28 0), p1:(AND (EQ s7 1) (EQ s20 1)), p2:(EQ s45 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1447 steps with 112 reset in 9 ms.
FORMULA CO4-PT-16-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-08 finished in 363 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||X((p0||F(p1)))))))'
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 416 transition count 607
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 416 transition count 607
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 416 transition count 606
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 413 transition count 601
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 413 transition count 601
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 412 transition count 600
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 412 transition count 600
Applied a total of 25 rules in 23 ms. Remains 412 /424 variables (removed 12) and now considering 600/616 (removed 16) transitions.
// Phase 1: matrix 600 rows 412 cols
[2024-06-02 22:53:08] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 22:53:08] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-02 22:53:08] [INFO ] Invariant cache hit.
[2024-06-02 22:53:09] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-06-02 22:53:09] [INFO ] Invariant cache hit.
[2024-06-02 22:53:09] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 412/424 places, 600/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 573 ms. Remains : 412/424 places, 600/616 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-16-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s269 0), p1:(EQ s67 0)], 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 209 reset in 120 ms.
Product exploration explored 100000 steps with 220 reset in 111 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 896 edges and 412 vertex of which 409 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 223 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 906703 steps, run timeout after 3001 ms. (steps per millisecond=302 ) properties seen :{}
Probabilistic random walk after 906703 steps, saw 143052 distinct states, run finished after 3001 ms. (steps per millisecond=302 ) properties seen :0
Running SMT prover for 3 properties.
[2024-06-02 22:53:13] [INFO ] Invariant cache hit.
[2024-06-02 22:53:13] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 22:53:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:53:13] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 22:53:13] [INFO ] After 293ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-06-02 22:53:13] [INFO ] After 431ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 99 steps, including 1 resets, run visited all 3 properties in 2 ms. (steps per millisecond=49 )
Parikh walk visited 3 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 219 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 412 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 600/600 transitions.
Applied a total of 0 rules in 5 ms. Remains 412 /412 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2024-06-02 22:53:14] [INFO ] Invariant cache hit.
[2024-06-02 22:53:14] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-02 22:53:14] [INFO ] Invariant cache hit.
[2024-06-02 22:53:14] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2024-06-02 22:53:14] [INFO ] Invariant cache hit.
[2024-06-02 22:53:14] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 674 ms. Remains : 412/412 places, 600/600 transitions.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 896 edges and 412 vertex of which 409 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 885455 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :{}
Probabilistic random walk after 885455 steps, saw 140177 distinct states, run finished after 3002 ms. (steps per millisecond=294 ) properties seen :0
Running SMT prover for 3 properties.
[2024-06-02 22:53:18] [INFO ] Invariant cache hit.
[2024-06-02 22:53:18] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 22:53:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:53:18] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 22:53:18] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-06-02 22:53:18] [INFO ] After 436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 102 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 3 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 988 reset in 98 ms.
Product exploration explored 100000 steps with 614 reset in 92 ms.
Built C files in :
/tmp/ltsmin7661309540112348944
[2024-06-02 22:53:19] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7661309540112348944
Running compilation step : cd /tmp/ltsmin7661309540112348944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 944 ms.
Running link step : cd /tmp/ltsmin7661309540112348944;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin7661309540112348944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13044562708658852993.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 412 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 600/600 transitions.
Applied a total of 0 rules in 12 ms. Remains 412 /412 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2024-06-02 22:53:34] [INFO ] Invariant cache hit.
[2024-06-02 22:53:34] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 22:53:34] [INFO ] Invariant cache hit.
[2024-06-02 22:53:35] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-06-02 22:53:35] [INFO ] Invariant cache hit.
[2024-06-02 22:53:35] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 589 ms. Remains : 412/412 places, 600/600 transitions.
Built C files in :
/tmp/ltsmin7931787661072535060
[2024-06-02 22:53:35] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7931787661072535060
Running compilation step : cd /tmp/ltsmin7931787661072535060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 841 ms.
Running link step : cd /tmp/ltsmin7931787661072535060;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7931787661072535060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15947308752633797881.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 22:53:50] [INFO ] Flatten gal took : 29 ms
[2024-06-02 22:53:50] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:53:50] [INFO ] Time to serialize gal into /tmp/LTL347822828035107196.gal : 5 ms
[2024-06-02 22:53:50] [INFO ] Time to serialize properties into /tmp/LTL5555225109447804205.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL347822828035107196.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12218543003835651452.hoa' '-atoms' '/tmp/LTL5555225109447804205.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5555225109447804205.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12218543003835651452.hoa
Detected timeout of ITS tools.
[2024-06-02 22:54:05] [INFO ] Flatten gal took : 29 ms
[2024-06-02 22:54:05] [INFO ] Flatten gal took : 38 ms
[2024-06-02 22:54:05] [INFO ] Time to serialize gal into /tmp/LTL6500394332985220852.gal : 17 ms
[2024-06-02 22:54:05] [INFO ] Time to serialize properties into /tmp/LTL9726825604554760364.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6500394332985220852.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9726825604554760364.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p554==0)")||(X(("(p554==0)")||(F("(p204==0)"))))))))
Formula 0 simplified : GF(!"(p554==0)" & X(!"(p554==0)" & G!"(p204==0)"))
Detected timeout of ITS tools.
[2024-06-02 22:54:20] [INFO ] Flatten gal took : 21 ms
[2024-06-02 22:54:20] [INFO ] Applying decomposition
[2024-06-02 22:54:20] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5162327022516259632.txt' '-o' '/tmp/graph5162327022516259632.bin' '-w' '/tmp/graph5162327022516259632.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5162327022516259632.bin' '-l' '-1' '-v' '-w' '/tmp/graph5162327022516259632.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:54:20] [INFO ] Decomposing Gal with order
[2024-06-02 22:54:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:54:21] [INFO ] Removed a total of 402 redundant transitions.
[2024-06-02 22:54:21] [INFO ] Flatten gal took : 71 ms
[2024-06-02 22:54:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 16 ms.
[2024-06-02 22:54:21] [INFO ] Time to serialize gal into /tmp/LTL2046325125041877387.gal : 9 ms
[2024-06-02 22:54:21] [INFO ] Time to serialize properties into /tmp/LTL4825265118902382785.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2046325125041877387.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4825265118902382785.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i8.i1.i0.u103.p554==0)")||(X(("(i8.i1.i0.u103.p554==0)")||(F("(i4.u31.p204==0)"))))))))
Formula 0 simplified : GF(!"(i8.i1.i0.u103.p554==0)" & X(!"(i8.i1.i0.u103.p554==0)" & G!"(i4.u31.p204==0)"))
Reverse transition relation is NOT exact ! Due to transitions t4, t13, t16, t41, t81, t104, t140, t150, t209, t226, t318, t453, t489, t546, t577, i1.t450, ...932
Computing Next relation with stutter on 685439 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2315699385815790810
[2024-06-02 22:54:36] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2315699385815790810
Running compilation step : cd /tmp/ltsmin2315699385815790810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 796 ms.
Running link step : cd /tmp/ltsmin2315699385815790810;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2315699385815790810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp0==true)||X(((LTLAPp0==true)||<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CO4-PT-16-LTLFireability-09 finished in 102468 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)))'
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 453 edges and 424 vertex of which 2 / 424 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 918 edges and 423 vertex of which 419 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 153 place count 418 transition count 458
Reduce places removed 151 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 155 rules applied. Total rules applied 308 place count 267 transition count 454
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 310 place count 266 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 311 place count 265 transition count 453
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 311 place count 265 transition count 407
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 403 place count 219 transition count 407
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 407 place count 215 transition count 402
Iterating global reduction 4 with 4 rules applied. Total rules applied 411 place count 215 transition count 402
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 411 place count 215 transition count 399
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 417 place count 212 transition count 399
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 420 place count 209 transition count 393
Iterating global reduction 4 with 3 rules applied. Total rules applied 423 place count 209 transition count 393
Performed 62 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 547 place count 147 transition count 316
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 17 rules applied. Total rules applied 564 place count 147 transition count 299
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 570 place count 144 transition count 296
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 573 place count 141 transition count 290
Iterating global reduction 6 with 3 rules applied. Total rules applied 576 place count 141 transition count 290
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 582 place count 138 transition count 287
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 583 place count 137 transition count 285
Iterating global reduction 6 with 1 rules applied. Total rules applied 584 place count 137 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 585 place count 137 transition count 284
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 665 place count 97 transition count 327
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 685 place count 97 transition count 307
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 712 place count 70 transition count 199
Iterating global reduction 8 with 27 rules applied. Total rules applied 739 place count 70 transition count 199
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 757 place count 70 transition count 181
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 763 place count 64 transition count 149
Iterating global reduction 9 with 6 rules applied. Total rules applied 769 place count 64 transition count 149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 773 place count 64 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 775 place count 63 transition count 162
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 10 with 18 rules applied. Total rules applied 793 place count 63 transition count 144
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 795 place count 61 transition count 142
Applied a total of 795 rules in 75 ms. Remains 61 /424 variables (removed 363) and now considering 142/616 (removed 474) transitions.
[2024-06-02 22:54:51] [INFO ] Flow matrix only has 119 transitions (discarded 23 similar events)
// Phase 1: matrix 119 rows 61 cols
[2024-06-02 22:54:51] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:54:51] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 22:54:51] [INFO ] Flow matrix only has 119 transitions (discarded 23 similar events)
[2024-06-02 22:54:51] [INFO ] Invariant cache hit.
[2024-06-02 22:54:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 22:54:51] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-06-02 22:54:51] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:54:51] [INFO ] Flow matrix only has 119 transitions (discarded 23 similar events)
[2024-06-02 22:54:51] [INFO ] Invariant cache hit.
[2024-06-02 22:54:51] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/424 places, 142/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 266 ms. Remains : 61/424 places, 142/616 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s38 1) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-10 finished in 354 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||X(F(p2)))))))'
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 452 edges and 424 vertex of which 2 / 424 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 918 edges and 423 vertex of which 419 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 151 place count 418 transition count 460
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 153 rules applied. Total rules applied 304 place count 269 transition count 456
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 306 place count 268 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 307 place count 267 transition count 455
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 307 place count 267 transition count 408
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 401 place count 220 transition count 408
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 406 place count 215 transition count 402
Iterating global reduction 4 with 5 rules applied. Total rules applied 411 place count 215 transition count 402
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 411 place count 215 transition count 399
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 417 place count 212 transition count 399
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 419 place count 210 transition count 395
Iterating global reduction 4 with 2 rules applied. Total rules applied 421 place count 210 transition count 395
Performed 61 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 543 place count 149 transition count 319
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 17 rules applied. Total rules applied 560 place count 149 transition count 302
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 566 place count 146 transition count 299
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 569 place count 143 transition count 293
Iterating global reduction 6 with 3 rules applied. Total rules applied 572 place count 143 transition count 293
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 578 place count 140 transition count 290
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 660 place count 99 transition count 340
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 681 place count 99 transition count 319
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 709 place count 71 transition count 207
Iterating global reduction 7 with 28 rules applied. Total rules applied 737 place count 71 transition count 207
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 756 place count 71 transition count 188
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 762 place count 65 transition count 156
Iterating global reduction 8 with 6 rules applied. Total rules applied 768 place count 65 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 772 place count 65 transition count 152
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 786 place count 65 transition count 138
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 788 place count 63 transition count 136
Applied a total of 788 rules in 64 ms. Remains 63 /424 variables (removed 361) and now considering 136/616 (removed 480) transitions.
[2024-06-02 22:54:51] [INFO ] Flow matrix only has 118 transitions (discarded 18 similar events)
// Phase 1: matrix 118 rows 63 cols
[2024-06-02 22:54:51] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:54:51] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-02 22:54:51] [INFO ] Flow matrix only has 118 transitions (discarded 18 similar events)
[2024-06-02 22:54:51] [INFO ] Invariant cache hit.
[2024-06-02 22:54:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:54:51] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-06-02 22:54:51] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:54:51] [INFO ] Flow matrix only has 118 transitions (discarded 18 similar events)
[2024-06-02 22:54:51] [INFO ] Invariant cache hit.
[2024-06-02 22:54:51] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/424 places, 136/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 229 ms. Remains : 63/424 places, 136/616 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-16-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=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s25 0), p1:(EQ s25 1), p2:(AND (EQ s5 1) (EQ s36 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]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-11 finished in 352 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 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 414 transition count 605
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 414 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 414 transition count 603
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 411 transition count 598
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 411 transition count 598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 410 transition count 597
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 410 transition count 597
Applied a total of 30 rules in 25 ms. Remains 410 /424 variables (removed 14) and now considering 597/616 (removed 19) transitions.
// Phase 1: matrix 597 rows 410 cols
[2024-06-02 22:54:51] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 22:54:52] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 22:54:52] [INFO ] Invariant cache hit.
[2024-06-02 22:54:52] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-06-02 22:54:52] [INFO ] Invariant cache hit.
[2024-06-02 22:54:52] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 410/424 places, 597/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 570 ms. Remains : 410/424 places, 597/616 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-12 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:(EQ s338 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-12 finished in 675 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)))))'
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 414 transition count 605
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 414 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 414 transition count 603
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 411 transition count 598
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 411 transition count 598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 410 transition count 597
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 410 transition count 597
Applied a total of 30 rules in 34 ms. Remains 410 /424 variables (removed 14) and now considering 597/616 (removed 19) transitions.
[2024-06-02 22:54:52] [INFO ] Invariant cache hit.
[2024-06-02 22:54:52] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 22:54:52] [INFO ] Invariant cache hit.
[2024-06-02 22:54:52] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-06-02 22:54:52] [INFO ] Invariant cache hit.
[2024-06-02 22:54:53] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 410/424 places, 597/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 548 ms. Remains : 410/424 places, 597/616 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s388 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 98 steps with 1 reset in 1 ms.
FORMULA CO4-PT-16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-13 finished in 735 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))'
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 457 edges and 424 vertex of which 2 / 424 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 918 edges and 423 vertex of which 422 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 154 rules applied. Total rules applied 156 place count 421 transition count 459
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 158 rules applied. Total rules applied 314 place count 267 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 315 place count 266 transition count 455
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 315 place count 266 transition count 408
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 409 place count 219 transition count 408
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 413 place count 215 transition count 403
Iterating global reduction 3 with 4 rules applied. Total rules applied 417 place count 215 transition count 403
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 417 place count 215 transition count 400
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 423 place count 212 transition count 400
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 426 place count 209 transition count 394
Iterating global reduction 3 with 3 rules applied. Total rules applied 429 place count 209 transition count 394
Performed 62 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 553 place count 147 transition count 317
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 18 rules applied. Total rules applied 571 place count 147 transition count 299
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 577 place count 144 transition count 296
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 580 place count 141 transition count 290
Iterating global reduction 5 with 3 rules applied. Total rules applied 583 place count 141 transition count 290
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 591 place count 137 transition count 286
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 592 place count 136 transition count 284
Iterating global reduction 5 with 1 rules applied. Total rules applied 593 place count 136 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 594 place count 136 transition count 283
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 676 place count 95 transition count 329
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 696 place count 95 transition count 309
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 724 place count 67 transition count 197
Iterating global reduction 7 with 28 rules applied. Total rules applied 752 place count 67 transition count 197
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 771 place count 67 transition count 178
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 778 place count 60 transition count 140
Iterating global reduction 8 with 7 rules applied. Total rules applied 785 place count 60 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 790 place count 60 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 792 place count 59 transition count 152
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 9 with 20 rules applied. Total rules applied 812 place count 59 transition count 132
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 814 place count 57 transition count 130
Applied a total of 814 rules in 45 ms. Remains 57 /424 variables (removed 367) and now considering 130/616 (removed 486) transitions.
[2024-06-02 22:54:53] [INFO ] Flow matrix only has 102 transitions (discarded 28 similar events)
// Phase 1: matrix 102 rows 57 cols
[2024-06-02 22:54:53] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:54:53] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 22:54:53] [INFO ] Flow matrix only has 102 transitions (discarded 28 similar events)
[2024-06-02 22:54:53] [INFO ] Invariant cache hit.
[2024-06-02 22:54:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:54:53] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-06-02 22:54:53] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:54:53] [INFO ] Flow matrix only has 102 transitions (discarded 28 similar events)
[2024-06-02 22:54:53] [INFO ] Invariant cache hit.
[2024-06-02 22:54:53] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/424 places, 130/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 233 ms. Remains : 57/424 places, 130/616 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s4 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]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-14 finished in 294 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||X((p0||F(p1)))))))'
Found a Lengthening insensitive property : CO4-PT-16-LTLFireability-09
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 455 edges and 424 vertex of which 2 / 424 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 918 edges and 423 vertex of which 419 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 154 place count 418 transition count 457
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 154 rules applied. Total rules applied 308 place count 266 transition count 455
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 308 place count 266 transition count 408
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 402 place count 219 transition count 408
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 405 place count 216 transition count 404
Iterating global reduction 2 with 3 rules applied. Total rules applied 408 place count 216 transition count 404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 408 place count 216 transition count 402
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 412 place count 214 transition count 402
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 414 place count 212 transition count 398
Iterating global reduction 2 with 2 rules applied. Total rules applied 416 place count 212 transition count 398
Performed 63 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 542 place count 149 transition count 320
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 18 rules applied. Total rules applied 560 place count 149 transition count 302
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 566 place count 146 transition count 299
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 569 place count 143 transition count 293
Iterating global reduction 4 with 3 rules applied. Total rules applied 572 place count 143 transition count 293
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 580 place count 139 transition count 289
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 581 place count 138 transition count 287
Iterating global reduction 4 with 1 rules applied. Total rules applied 582 place count 138 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 583 place count 138 transition count 286
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 665 place count 97 transition count 334
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 686 place count 97 transition count 313
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 714 place count 69 transition count 201
Iterating global reduction 6 with 28 rules applied. Total rules applied 742 place count 69 transition count 201
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 761 place count 69 transition count 182
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 767 place count 63 transition count 150
Iterating global reduction 7 with 6 rules applied. Total rules applied 773 place count 63 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 777 place count 63 transition count 146
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 779 place count 61 transition count 144
Applied a total of 779 rules in 52 ms. Remains 61 /424 variables (removed 363) and now considering 144/616 (removed 472) transitions.
[2024-06-02 22:54:53] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
// Phase 1: matrix 126 rows 61 cols
[2024-06-02 22:54:53] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:54:53] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-02 22:54:53] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 22:54:53] [INFO ] Invariant cache hit.
[2024-06-02 22:54:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:54:53] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-06-02 22:54:53] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 22:54:53] [INFO ] Invariant cache hit.
[2024-06-02 22:54:54] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 61/424 places, 144/616 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 219 ms. Remains : 61/424 places, 144/616 transitions.
Running random walk in product with property : CO4-PT-16-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s28 0), p1:(EQ s5 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 143 reset in 29 ms.
Product exploration explored 100000 steps with 196 reset in 35 ms.
Computed a total of 9 stabilizing places and 28 stable transitions
Computed a total of 9 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 825 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:54:54] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 22:54:54] [INFO ] Invariant cache hit.
[2024-06-02 22:54:54] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:54:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:54:54] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:54:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:54:54] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:54:54] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-06-02 22:54:54] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 144/144 transitions.
Graph (complete) has 210 edges and 61 vertex of which 51 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 51 transition count 114
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 47 transition count 106
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 47 transition count 106
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 43 place count 47 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 46 transition count 113
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 46 transition count 110
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 60 place count 46 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 45 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 45 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 45 transition count 95
Free-agglomeration rule applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 74 place count 45 transition count 84
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 17 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 19 rules applied. Total rules applied 93 place count 31 transition count 79
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 97 place count 30 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 107 place count 23 transition count 73
Drop transitions removed 10 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 46 edges and 23 vertex of which 17 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Graph (trivial) has 23 edges and 17 vertex of which 11 / 17 are part of one of the 2 SCC in 0 ms
Free SCC test removed 9 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 25 rules applied. Total rules applied 132 place count 8 transition count 46
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 30 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 35 transitions.
Graph (complete) has 10 edges and 7 vertex of which 6 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 37 rules applied. Total rules applied 169 place count 6 transition count 11
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 171 place count 6 transition count 9
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 174 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 174 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 178 place count 4 transition count 4
Applied a total of 178 rules in 12 ms. Remains 4 /61 variables (removed 57) and now considering 4/144 (removed 140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 4/61 places, 4/144 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-06-02 22:54:54] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 22:54:54] [INFO ] Invariant cache hit.
[2024-06-02 22:54:54] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-02 22:54:54] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 22:54:54] [INFO ] Invariant cache hit.
[2024-06-02 22:54:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:54:55] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-06-02 22:54:55] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 22:54:55] [INFO ] Invariant cache hit.
[2024-06-02 22:54:55] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 61/61 places, 144/144 transitions.
Computed a total of 9 stabilizing places and 28 stable transitions
Computed a total of 9 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 68 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 828 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 22:54:55] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 22:54:55] [INFO ] Invariant cache hit.
[2024-06-02 22:54:55] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:54:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:54:55] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 22:54:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:54:55] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 22:54:55] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-06-02 22:54:55] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 144/144 transitions.
Graph (complete) has 210 edges and 61 vertex of which 51 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 51 transition count 114
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 47 transition count 106
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 47 transition count 106
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 43 place count 47 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 46 transition count 113
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 46 transition count 110
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 60 place count 46 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 45 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 45 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 45 transition count 95
Free-agglomeration rule applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 74 place count 45 transition count 84
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 17 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 19 rules applied. Total rules applied 93 place count 31 transition count 79
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 97 place count 30 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 107 place count 23 transition count 73
Drop transitions removed 10 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 46 edges and 23 vertex of which 17 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Graph (trivial) has 23 edges and 17 vertex of which 11 / 17 are part of one of the 2 SCC in 0 ms
Free SCC test removed 9 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 25 rules applied. Total rules applied 132 place count 8 transition count 46
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 30 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 35 transitions.
Graph (complete) has 10 edges and 7 vertex of which 6 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 37 rules applied. Total rules applied 169 place count 6 transition count 11
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 171 place count 6 transition count 9
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 174 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 174 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 178 place count 4 transition count 4
Applied a total of 178 rules in 11 ms. Remains 4 /61 variables (removed 57) and now considering 4/144 (removed 140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 4/61 places, 4/144 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 674 reset in 46 ms.
Product exploration explored 100000 steps with 164 reset in 36 ms.
Built C files in :
/tmp/ltsmin2031162714627173409
[2024-06-02 22:54:56] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2031162714627173409
Running compilation step : cd /tmp/ltsmin2031162714627173409;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 228 ms.
Running link step : cd /tmp/ltsmin2031162714627173409;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2031162714627173409;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13543776353330085269.hoa' '--buchi-type=spotba'
LTSmin run took 278 ms.
Treatment of property CO4-PT-16-LTLFireability-09 finished in 3137 ms.
FORMULA CO4-PT-16-LTLFireability-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-02 22:54:56] [INFO ] Flatten gal took : 23 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 123142 ms.

BK_STOP 1717368897841

--------------------
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="CO4-PT-16"
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 CO4-PT-16, 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 r571-tall-171734910200078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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