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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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 332K 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-19-LTLFireability-00
FORMULA_NAME CO4-PT-19-LTLFireability-01
FORMULA_NAME CO4-PT-19-LTLFireability-02
FORMULA_NAME CO4-PT-19-LTLFireability-03
FORMULA_NAME CO4-PT-19-LTLFireability-04
FORMULA_NAME CO4-PT-19-LTLFireability-05
FORMULA_NAME CO4-PT-19-LTLFireability-06
FORMULA_NAME CO4-PT-19-LTLFireability-07
FORMULA_NAME CO4-PT-19-LTLFireability-08
FORMULA_NAME CO4-PT-19-LTLFireability-09
FORMULA_NAME CO4-PT-19-LTLFireability-10
FORMULA_NAME CO4-PT-19-LTLFireability-11
FORMULA_NAME CO4-PT-19-LTLFireability-12
FORMULA_NAME CO4-PT-19-LTLFireability-13
FORMULA_NAME CO4-PT-19-LTLFireability-14
FORMULA_NAME CO4-PT-19-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717368907960

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-19
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:55:09] [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:55:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:55:09] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-06-02 22:55:09] [INFO ] Transformed 1174 places.
[2024-06-02 22:55:09] [INFO ] Transformed 1447 transitions.
[2024-06-02 22:55:09] [INFO ] Found NUPN structural information;
[2024-06-02 22:55:09] [INFO ] Parsed PT model containing 1174 places and 1447 transitions and 3662 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 201 places in 15 ms
Reduce places removed 201 places and 274 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-19-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 973 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 973/973 places, 1173/1173 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 948 transition count 1165
Discarding 161 places :
Symmetric choice reduction at 1 with 161 rule applications. Total rules 194 place count 787 transition count 1002
Iterating global reduction 1 with 161 rules applied. Total rules applied 355 place count 787 transition count 1002
Discarding 132 places :
Symmetric choice reduction at 1 with 132 rule applications. Total rules 487 place count 655 transition count 866
Iterating global reduction 1 with 132 rules applied. Total rules applied 619 place count 655 transition count 866
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 626 place count 655 transition count 859
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 690 place count 591 transition count 791
Iterating global reduction 2 with 64 rules applied. Total rules applied 754 place count 591 transition count 791
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 756 place count 591 transition count 789
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 797 place count 550 transition count 748
Iterating global reduction 3 with 41 rules applied. Total rules applied 838 place count 550 transition count 748
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 844 place count 550 transition count 742
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 863 place count 531 transition count 723
Iterating global reduction 4 with 19 rules applied. Total rules applied 882 place count 531 transition count 723
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 884 place count 531 transition count 721
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 890 place count 525 transition count 715
Iterating global reduction 5 with 6 rules applied. Total rules applied 896 place count 525 transition count 715
Applied a total of 896 rules in 327 ms. Remains 525 /973 variables (removed 448) and now considering 715/1173 (removed 458) transitions.
// Phase 1: matrix 715 rows 525 cols
[2024-06-02 22:55:10] [INFO ] Computed 7 invariants in 23 ms
[2024-06-02 22:55:10] [INFO ] Implicit Places using invariants in 332 ms returned [6, 456]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 359 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 523/973 places, 715/1173 transitions.
Applied a total of 0 rules in 14 ms. Remains 523 /523 variables (removed 0) and now considering 715/715 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 701 ms. Remains : 523/973 places, 715/1173 transitions.
Support contains 32 out of 523 places after structural reductions.
[2024-06-02 22:55:10] [INFO ] Flatten gal took : 67 ms
[2024-06-02 22:55:10] [INFO ] Flatten gal took : 32 ms
[2024-06-02 22:55:10] [INFO ] Input system was already deterministic with 715 transitions.
Support contains 31 out of 523 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 203 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 26) seen :9
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) 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 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 715 rows 523 cols
[2024-06-02 22:55:11] [INFO ] Computed 5 invariants in 12 ms
[2024-06-02 22:55:11] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-06-02 22:55:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:55:12] [INFO ] After 648ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2024-06-02 22:55:13] [INFO ] After 1331ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 448 ms.
[2024-06-02 22:55:13] [INFO ] After 2145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 10 properties in 88 ms.
Support contains 8 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 715/715 transitions.
Graph (trivial) has 548 edges and 523 vertex of which 3 / 523 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1014 edges and 521 vertex of which 504 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 240 rules applied. Total rules applied 242 place count 504 transition count 458
Reduce places removed 219 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 221 rules applied. Total rules applied 463 place count 285 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 465 place count 283 transition count 456
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 465 place count 283 transition count 413
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 551 place count 240 transition count 413
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 558 place count 233 transition count 406
Iterating global reduction 3 with 7 rules applied. Total rules applied 565 place count 233 transition count 406
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 567 place count 233 transition count 404
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 567 place count 233 transition count 400
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 575 place count 229 transition count 400
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 578 place count 226 transition count 395
Iterating global reduction 4 with 3 rules applied. Total rules applied 581 place count 226 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 2 rules applied. Total rules applied 583 place count 226 transition count 393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 584 place count 225 transition count 393
Performed 86 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 6 with 172 rules applied. Total rules applied 756 place count 139 transition count 285
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 769 place count 139 transition count 272
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 778 place count 130 transition count 258
Iterating global reduction 7 with 9 rules applied. Total rules applied 787 place count 130 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 788 place count 130 transition count 257
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 789 place count 129 transition count 256
Iterating global reduction 8 with 1 rules applied. Total rules applied 790 place count 129 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 791 place count 129 transition count 255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 795 place count 127 transition count 253
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 796 place count 127 transition count 252
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 797 place count 126 transition count 250
Iterating global reduction 10 with 1 rules applied. Total rules applied 798 place count 126 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 799 place count 126 transition count 249
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 11 with 76 rules applied. Total rules applied 875 place count 88 transition count 286
Drop transitions removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 11 with 36 rules applied. Total rules applied 911 place count 88 transition count 250
Discarding 26 places :
Symmetric choice reduction at 12 with 26 rule applications. Total rules 937 place count 62 transition count 157
Iterating global reduction 12 with 26 rules applied. Total rules applied 963 place count 62 transition count 157
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 980 place count 62 transition count 140
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 985 place count 57 transition count 117
Iterating global reduction 13 with 5 rules applied. Total rules applied 990 place count 57 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 994 place count 57 transition count 113
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 995 place count 57 transition count 112
Free-agglomeration rule applied 11 times.
Iterating global reduction 14 with 11 rules applied. Total rules applied 1006 place count 57 transition count 101
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 13 rules applied. Total rules applied 1019 place count 46 transition count 99
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1021 place count 46 transition count 97
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 1024 place count 46 transition count 97
Graph (complete) has 166 edges and 46 vertex of which 45 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 15 with 1 rules applied. Total rules applied 1025 place count 45 transition count 97
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 1028 place count 45 transition count 94
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1029 place count 44 transition count 93
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t386.t390.t581.t617.t383 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 23 edges and 40 vertex of which 3 / 40 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 17 with 5 rules applied. Total rules applied 1034 place count 38 transition count 89
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 23 edges and 34 vertex of which 6 / 34 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 18 with 12 rules applied. Total rules applied 1046 place count 29 transition count 82
Drop transitions removed 10 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 19 with 18 rules applied. Total rules applied 1064 place count 29 transition count 64
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 1065 place count 28 transition count 60
Iterating global reduction 20 with 1 rules applied. Total rules applied 1066 place count 28 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 1067 place count 28 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 1069 place count 27 transition count 61
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 1071 place count 27 transition count 59
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 22 with 11 rules applied. Total rules applied 1082 place count 27 transition count 48
Discarding 2 places :
Symmetric choice reduction at 22 with 2 rule applications. Total rules 1084 place count 25 transition count 44
Iterating global reduction 22 with 2 rules applied. Total rules applied 1086 place count 25 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 1088 place count 25 transition count 42
Free-agglomeration rule applied 3 times.
Iterating global reduction 23 with 3 rules applied. Total rules applied 1091 place count 25 transition count 39
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 23 with 3 rules applied. Total rules applied 1094 place count 22 transition count 39
Applied a total of 1094 rules in 107 ms. Remains 22 /523 variables (removed 501) and now considering 39/715 (removed 676) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 22/523 places, 39/715 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :6
Finished Best-First random walk after 133 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=66 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 1017 edges and 523 vertex of which 518 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.11 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((X((p1||X(p2)))&&p0)))'
Support contains 3 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 508 transition count 700
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 508 transition count 700
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 500 transition count 691
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 500 transition count 691
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 500 transition count 688
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 495 transition count 682
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 495 transition count 682
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 491 transition count 678
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 491 transition count 678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 491 transition count 676
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 490 transition count 675
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 490 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 489 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 489 transition count 674
Applied a total of 73 rules in 44 ms. Remains 489 /523 variables (removed 34) and now considering 674/715 (removed 41) transitions.
// Phase 1: matrix 674 rows 489 cols
[2024-06-02 22:55:14] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 22:55:14] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-06-02 22:55:14] [INFO ] Invariant cache hit.
[2024-06-02 22:55:15] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2024-06-02 22:55:15] [INFO ] Invariant cache hit.
[2024-06-02 22:55:15] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 489/523 places, 674/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 942 ms. Remains : 489/523 places, 674/715 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 275 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-19-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s442 0) (EQ s437 0)), p1:(EQ s6 1), p2:(EQ s437 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 12529 reset in 406 ms.
Product exploration explored 100000 steps with 12529 reset in 284 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 968 edges and 489 vertex of which 484 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Detected a total of 17/489 stabilizing places and 20/674 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 168 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 204 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-06-02 22:55:17] [INFO ] Invariant cache hit.
[2024-06-02 22:55:17] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 22:55:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:55:17] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 22:55:17] [INFO ] Deduced a trap composed of 188 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:55:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2024-06-02 22:55:17] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 3 ms to minimize.
[2024-06-02 22:55:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2024-06-02 22:55:17] [INFO ] After 686ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 105 ms.
[2024-06-02 22:55:18] [INFO ] After 905ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 674/674 transitions.
Graph (trivial) has 523 edges and 489 vertex of which 3 / 489 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 965 edges and 487 vertex of which 470 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 231 rules applied. Total rules applied 233 place count 470 transition count 426
Reduce places removed 210 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 212 rules applied. Total rules applied 445 place count 260 transition count 424
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 446 place count 259 transition count 424
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 446 place count 259 transition count 376
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 542 place count 211 transition count 376
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 544 place count 209 transition count 374
Iterating global reduction 3 with 2 rules applied. Total rules applied 546 place count 209 transition count 374
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 548 place count 209 transition count 372
Performed 77 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 702 place count 132 transition count 273
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 713 place count 132 transition count 262
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 721 place count 124 transition count 249
Iterating global reduction 5 with 8 rules applied. Total rules applied 729 place count 124 transition count 249
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 5 with 6 rules applied. Total rules applied 735 place count 121 transition count 246
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 736 place count 121 transition count 245
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 737 place count 120 transition count 243
Iterating global reduction 6 with 1 rules applied. Total rules applied 738 place count 120 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 739 place count 120 transition count 242
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 817 place count 81 transition count 283
Drop transitions removed 39 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 7 with 59 rules applied. Total rules applied 876 place count 81 transition count 224
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 904 place count 53 transition count 140
Iterating global reduction 8 with 28 rules applied. Total rules applied 932 place count 53 transition count 140
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 951 place count 53 transition count 121
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 958 place count 46 transition count 89
Iterating global reduction 9 with 7 rules applied. Total rules applied 965 place count 46 transition count 89
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 970 place count 46 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 974 place count 44 transition count 107
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 980 place count 44 transition count 101
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 11 with 13 rules applied. Total rules applied 993 place count 44 transition count 88
Free-agglomeration rule applied 9 times.
Iterating global reduction 11 with 9 rules applied. Total rules applied 1002 place count 44 transition count 79
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1014 place count 35 transition count 76
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 1017 place count 35 transition count 76
Graph (complete) has 123 edges and 35 vertex of which 34 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 12 with 1 rules applied. Total rules applied 1018 place count 34 transition count 76
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 1021 place count 34 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1022 place count 33 transition count 72
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t100.t105.t656.t97.t616.t96 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 14 with 4 rules applied. Total rules applied 1026 place count 30 transition count 68
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 16 edges and 26 vertex of which 6 / 26 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 15 with 6 rules applied. Total rules applied 1032 place count 21 transition count 67
Drop transitions removed 21 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 47 edges and 21 vertex of which 12 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Iterating post reduction 16 with 33 rules applied. Total rules applied 1065 place count 12 transition count 29
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 17 with 12 rules applied. Total rules applied 1077 place count 12 transition count 17
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1078 place count 11 transition count 16
Iterating global reduction 18 with 1 rules applied. Total rules applied 1079 place count 11 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1080 place count 11 transition count 15
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 19 with 3 rules applied. Total rules applied 1083 place count 11 transition count 12
Free-agglomeration rule applied 2 times.
Iterating global reduction 19 with 2 rules applied. Total rules applied 1085 place count 11 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 1087 place count 9 transition count 10
Applied a total of 1087 rules in 55 ms. Remains 9 /489 variables (removed 480) and now considering 10/674 (removed 664) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 9/489 places, 10/674 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 5 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 12 factoid took 526 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
[2024-06-02 22:55:18] [INFO ] Invariant cache hit.
[2024-06-02 22:55:19] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:55:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:19] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-06-02 22:55:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:55:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:55:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:19] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-06-02 22:55:19] [INFO ] Computed and/alt/rep : 655/1178/655 causal constraints (skipped 18 transitions) in 34 ms.
[2024-06-02 22:55:24] [INFO ] Added : 605 causal constraints over 121 iterations in 4985 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 674/674 transitions.
Applied a total of 0 rules in 17 ms. Remains 489 /489 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2024-06-02 22:55:24] [INFO ] Invariant cache hit.
[2024-06-02 22:55:24] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 22:55:24] [INFO ] Invariant cache hit.
[2024-06-02 22:55:25] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2024-06-02 22:55:25] [INFO ] Invariant cache hit.
[2024-06-02 22:55:25] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 673 ms. Remains : 489/489 places, 674/674 transitions.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 968 edges and 489 vertex of which 484 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Detected a total of 17/489 stabilizing places and 20/674 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p0 (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 163 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 206 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-06-02 22:55:25] [INFO ] Invariant cache hit.
[2024-06-02 22:55:26] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 22:55:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:55:26] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 22:55:26] [INFO ] Deduced a trap composed of 188 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:55:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2024-06-02 22:55:26] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 0 ms to minimize.
[2024-06-02 22:55:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2024-06-02 22:55:26] [INFO ] After 644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 114 ms.
[2024-06-02 22:55:26] [INFO ] After 877ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 674/674 transitions.
Graph (trivial) has 523 edges and 489 vertex of which 3 / 489 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 965 edges and 487 vertex of which 470 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 231 rules applied. Total rules applied 233 place count 470 transition count 426
Reduce places removed 210 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 212 rules applied. Total rules applied 445 place count 260 transition count 424
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 446 place count 259 transition count 424
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 446 place count 259 transition count 376
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 542 place count 211 transition count 376
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 544 place count 209 transition count 374
Iterating global reduction 3 with 2 rules applied. Total rules applied 546 place count 209 transition count 374
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 548 place count 209 transition count 372
Performed 77 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 702 place count 132 transition count 273
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 713 place count 132 transition count 262
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 721 place count 124 transition count 249
Iterating global reduction 5 with 8 rules applied. Total rules applied 729 place count 124 transition count 249
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 5 with 6 rules applied. Total rules applied 735 place count 121 transition count 246
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 736 place count 121 transition count 245
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 737 place count 120 transition count 243
Iterating global reduction 6 with 1 rules applied. Total rules applied 738 place count 120 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 739 place count 120 transition count 242
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 817 place count 81 transition count 283
Drop transitions removed 39 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 7 with 59 rules applied. Total rules applied 876 place count 81 transition count 224
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 904 place count 53 transition count 140
Iterating global reduction 8 with 28 rules applied. Total rules applied 932 place count 53 transition count 140
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 951 place count 53 transition count 121
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 958 place count 46 transition count 89
Iterating global reduction 9 with 7 rules applied. Total rules applied 965 place count 46 transition count 89
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 970 place count 46 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 974 place count 44 transition count 107
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 980 place count 44 transition count 101
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 11 with 13 rules applied. Total rules applied 993 place count 44 transition count 88
Free-agglomeration rule applied 9 times.
Iterating global reduction 11 with 9 rules applied. Total rules applied 1002 place count 44 transition count 79
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1014 place count 35 transition count 76
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 1017 place count 35 transition count 76
Graph (complete) has 123 edges and 35 vertex of which 34 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 12 with 1 rules applied. Total rules applied 1018 place count 34 transition count 76
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 1021 place count 34 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1022 place count 33 transition count 72
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t100.t105.t656.t97.t616.t96 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 14 with 4 rules applied. Total rules applied 1026 place count 30 transition count 68
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 16 edges and 26 vertex of which 6 / 26 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 15 with 6 rules applied. Total rules applied 1032 place count 21 transition count 67
Drop transitions removed 21 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 47 edges and 21 vertex of which 12 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Iterating post reduction 16 with 33 rules applied. Total rules applied 1065 place count 12 transition count 29
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 17 with 12 rules applied. Total rules applied 1077 place count 12 transition count 17
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1078 place count 11 transition count 16
Iterating global reduction 18 with 1 rules applied. Total rules applied 1079 place count 11 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1080 place count 11 transition count 15
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 19 with 3 rules applied. Total rules applied 1083 place count 11 transition count 12
Free-agglomeration rule applied 2 times.
Iterating global reduction 19 with 2 rules applied. Total rules applied 1085 place count 11 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 1087 place count 9 transition count 10
Applied a total of 1087 rules in 52 ms. Remains 9 /489 variables (removed 480) and now considering 10/674 (removed 664) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 9/489 places, 10/674 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 5 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p0 (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 12 factoid took 530 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
[2024-06-02 22:55:27] [INFO ] Invariant cache hit.
[2024-06-02 22:55:28] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:55:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:28] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-06-02 22:55:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:55:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:55:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:28] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-06-02 22:55:28] [INFO ] Computed and/alt/rep : 655/1178/655 causal constraints (skipped 18 transitions) in 36 ms.
[2024-06-02 22:55:33] [INFO ] Added : 605 causal constraints over 121 iterations in 4893 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 12568 reset in 196 ms.
Product exploration explored 100000 steps with 12489 reset in 199 ms.
Built C files in :
/tmp/ltsmin17645569330330236970
[2024-06-02 22:55:34] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17645569330330236970
Running compilation step : cd /tmp/ltsmin17645569330330236970;'/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 1009 ms.
Running link step : cd /tmp/ltsmin17645569330330236970;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17645569330330236970;'/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/stateBased15048763058225967338.hoa' '--buchi-type=spotba'
LTSmin run took 316 ms.
FORMULA CO4-PT-19-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-19-LTLFireability-00 finished in 21246 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&&((p2&&F(p3))||p1)))))'
Support contains 6 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 508 transition count 700
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 508 transition count 700
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 499 transition count 690
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 499 transition count 690
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 499 transition count 687
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 493 transition count 680
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 493 transition count 680
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 493 transition count 679
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 489 transition count 675
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 489 transition count 675
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 489 transition count 673
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 488 transition count 672
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 488 transition count 672
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 487 transition count 671
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 487 transition count 671
Applied a total of 78 rules in 49 ms. Remains 487 /523 variables (removed 36) and now considering 671/715 (removed 44) transitions.
// Phase 1: matrix 671 rows 487 cols
[2024-06-02 22:55:35] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 22:55:35] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-02 22:55:35] [INFO ] Invariant cache hit.
[2024-06-02 22:55:36] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-06-02 22:55:36] [INFO ] Invariant cache hit.
[2024-06-02 22:55:36] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 487/523 places, 671/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 652 ms. Remains : 487/523 places, 671/715 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p3)]
Running random walk in product with property : CO4-PT-19-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s441 0), p1:(OR (EQ s426 0) (EQ s443 0) (EQ s481 0)), p2:(EQ s340 0), p3:(EQ s258 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11123 steps with 228 reset in 27 ms.
FORMULA CO4-PT-19-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-01 finished in 843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U G(p1)) U X((!p1||X(X(p2))))))'
Support contains 3 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 510 transition count 702
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 510 transition count 702
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 503 transition count 694
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 503 transition count 694
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 503 transition count 691
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 498 transition count 686
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 498 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 498 transition count 685
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 494 transition count 681
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 494 transition count 681
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 494 transition count 679
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 493 transition count 678
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 493 transition count 678
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 492 transition count 677
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 492 transition count 677
Applied a total of 68 rules in 52 ms. Remains 492 /523 variables (removed 31) and now considering 677/715 (removed 38) transitions.
// Phase 1: matrix 677 rows 492 cols
[2024-06-02 22:55:36] [INFO ] Computed 5 invariants in 9 ms
[2024-06-02 22:55:36] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-06-02 22:55:36] [INFO ] Invariant cache hit.
[2024-06-02 22:55:36] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-06-02 22:55:36] [INFO ] Invariant cache hit.
[2024-06-02 22:55:37] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 492/523 places, 677/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 701 ms. Remains : 492/523 places, 677/715 transitions.
Stuttering acceptance computed with spot in 700 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p2)), false, (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (NOT p2), true, (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-19-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(OR p1 p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 10}, { cond=p0, acceptance={} source=7 dest: 11}, { cond=(AND p1 p0), acceptance={} source=7 dest: 12}, { cond=(AND p1 p0), acceptance={} source=7 dest: 14}, { cond=p1, acceptance={} source=7 dest: 15}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 5}, { cond=(AND p1 p0), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 16}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=11 dest: 17}, { cond=(NOT p2), acceptance={} source=11 dest: 18}, { cond=(AND p1 (NOT p2)), acceptance={} source=11 dest: 19}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=12 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=12 dest: 16}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=13 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=13 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=14 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=14 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=14 dest: 10}, { cond=(AND p0 (NOT p2)), acceptance={} source=14 dest: 11}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=14 dest: 12}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=15 dest: 13}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=15 dest: 14}, { cond=(AND p1 (NOT p2)), acceptance={0} source=15 dest: 15}], [{ cond=(NOT p1), acceptance={} source=16 dest: 6}, { cond=p1, acceptance={} source=16 dest: 16}], [{ cond=(NOT p0), acceptance={} source=17 dest: 6}], [{ cond=(NOT p1), acceptance={} source=18 dest: 17}, { cond=p1, acceptance={} source=18 dest: 18}, { cond=(NOT p1), acceptance={0} source=18 dest: 18}, { cond=p1, acceptance={} source=18 dest: 19}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=19 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=19 dest: 16}]], initial=0, aps=[p1:(EQ s206 1), p0:(EQ s328 1), p2:(EQ s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 320 ms.
Product exploration explored 100000 steps with 50000 reset in 310 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 971 edges and 492 vertex of which 487 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 15 ms. Reduced automaton from 20 states, 45 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-19-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-19-LTLFireability-02 finished in 2077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||G(p1)))'
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 508 transition count 700
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 508 transition count 700
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 500 transition count 691
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 500 transition count 691
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 500 transition count 689
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 494 transition count 682
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 494 transition count 682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 494 transition count 681
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 490 transition count 677
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 490 transition count 677
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 490 transition count 675
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 489 transition count 674
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 489 transition count 674
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 488 transition count 673
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 488 transition count 673
Applied a total of 75 rules in 51 ms. Remains 488 /523 variables (removed 35) and now considering 673/715 (removed 42) transitions.
// Phase 1: matrix 673 rows 488 cols
[2024-06-02 22:55:38] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:55:38] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 22:55:38] [INFO ] Invariant cache hit.
[2024-06-02 22:55:38] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-06-02 22:55:38] [INFO ] Invariant cache hit.
[2024-06-02 22:55:39] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 488/523 places, 673/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 627 ms. Remains : 488/523 places, 673/715 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-19-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s456 1), p1:(EQ s354 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 181 reset in 82 ms.
Product exploration explored 100000 steps with 217 reset in 183 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 962 edges and 488 vertex of which 483 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 208 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Finished probabilistic random walk after 414202 steps, run visited all 3 properties in 1467 ms. (steps per millisecond=282 )
Probabilistic random walk after 414202 steps, saw 86235 distinct states, run finished after 1467 ms. (steps per millisecond=282 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 673/673 transitions.
Applied a total of 0 rules in 6 ms. Remains 488 /488 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2024-06-02 22:55:42] [INFO ] Invariant cache hit.
[2024-06-02 22:55:42] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 22:55:42] [INFO ] Invariant cache hit.
[2024-06-02 22:55:42] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-06-02 22:55:42] [INFO ] Invariant cache hit.
[2024-06-02 22:55:42] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 557 ms. Remains : 488/488 places, 673/673 transitions.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 962 edges and 488 vertex of which 483 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 207 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 35 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:55:42] [INFO ] Invariant cache hit.
[2024-06-02 22:55:42] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:55:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:55:43] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:55:43] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-06-02 22:55:43] [INFO ] After 300ms 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 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 673/673 transitions.
Graph (trivial) has 526 edges and 488 vertex of which 3 / 488 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 959 edges and 486 vertex of which 469 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 231 rules applied. Total rules applied 233 place count 469 transition count 425
Reduce places removed 210 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 212 rules applied. Total rules applied 445 place count 259 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 446 place count 258 transition count 423
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 446 place count 258 transition count 374
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 544 place count 209 transition count 374
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 547 place count 206 transition count 371
Iterating global reduction 3 with 3 rules applied. Total rules applied 550 place count 206 transition count 371
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 553 place count 206 transition count 368
Performed 78 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 709 place count 128 transition count 267
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 720 place count 128 transition count 256
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 728 place count 120 transition count 243
Iterating global reduction 5 with 8 rules applied. Total rules applied 736 place count 120 transition count 243
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 5 with 6 rules applied. Total rules applied 742 place count 117 transition count 240
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 743 place count 117 transition count 239
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 744 place count 116 transition count 237
Iterating global reduction 6 with 1 rules applied. Total rules applied 745 place count 116 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 746 place count 116 transition count 236
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 824 place count 77 transition count 276
Drop transitions removed 39 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 7 with 59 rules applied. Total rules applied 883 place count 77 transition count 217
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 911 place count 49 transition count 133
Iterating global reduction 8 with 28 rules applied. Total rules applied 939 place count 49 transition count 133
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 958 place count 49 transition count 114
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 964 place count 43 transition count 87
Iterating global reduction 9 with 6 rules applied. Total rules applied 970 place count 43 transition count 87
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 975 place count 43 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 979 place count 41 transition count 107
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 986 place count 41 transition count 100
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 11 with 13 rules applied. Total rules applied 999 place count 41 transition count 87
Free-agglomeration rule applied 8 times.
Iterating global reduction 11 with 8 rules applied. Total rules applied 1007 place count 41 transition count 79
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 1017 place count 33 transition count 77
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 1020 place count 33 transition count 77
Graph (complete) has 121 edges and 33 vertex of which 32 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 12 with 1 rules applied. Total rules applied 1021 place count 32 transition count 77
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 1024 place count 32 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1025 place count 31 transition count 73
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t386.t390.t581.t617 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 17 edges and 27 vertex of which 3 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 14 with 5 rules applied. Total rules applied 1030 place count 25 transition count 69
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 24 edges and 20 vertex of which 12 / 20 are part of one of the 2 SCC in 0 ms
Free SCC test removed 10 places
Iterating post reduction 15 with 13 rules applied. Total rules applied 1043 place count 10 transition count 62
Drop transitions removed 42 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 13 edges and 10 vertex of which 8 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 16 with 50 rules applied. Total rules applied 1093 place count 8 transition count 12
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 1096 place count 8 transition count 9
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 17 with 1 rules applied. Total rules applied 1097 place count 8 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1098 place count 7 transition count 8
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 1099 place count 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 1100 place count 6 transition count 7
Applied a total of 1100 rules in 43 ms. Remains 6 /488 variables (removed 482) and now considering 7/673 (removed 666) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 6/488 places, 7/673 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 425 reset in 86 ms.
Product exploration explored 100000 steps with 852 reset in 108 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 673/673 transitions.
Graph (trivial) has 526 edges and 488 vertex of which 3 / 488 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 960 edges and 486 vertex of which 481 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 201 rules applied. Total rules applied 203 place count 481 transition count 665
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 204 place count 481 transition count 664
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 204 place count 481 transition count 667
Deduced a syphon composed of 206 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 209 place count 481 transition count 667
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 268 place count 422 transition count 608
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 2 with 59 rules applied. Total rules applied 327 place count 422 transition count 608
Performed 107 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 2 with 107 rules applied. Total rules applied 434 place count 422 transition count 664
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 451 place count 422 transition count 647
Discarding 96 places :
Symmetric choice reduction at 3 with 96 rule applications. Total rules 547 place count 326 transition count 546
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 96 rules applied. Total rules applied 643 place count 326 transition count 546
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 644 place count 325 transition count 545
Deduced a syphon composed of 165 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 645 place count 325 transition count 545
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 646 place count 325 transition count 545
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 647 place count 325 transition count 544
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 649 place count 323 transition count 542
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 651 place count 323 transition count 542
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 652 place count 323 transition count 542
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 654 place count 321 transition count 539
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 656 place count 321 transition count 539
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 658 place count 319 transition count 536
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 660 place count 319 transition count 536
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 661 place count 319 transition count 535
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 662 place count 318 transition count 534
Deduced a syphon composed of 162 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 663 place count 318 transition count 534
Performed 62 Post agglomeration using F-continuation condition with reduction of 29 identical transitions.
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 5 with 62 rules applied. Total rules applied 725 place count 318 transition count 839
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 5 with 60 rules applied. Total rules applied 785 place count 318 transition count 779
Discarding 105 places :
Symmetric choice reduction at 6 with 105 rule applications. Total rules 890 place count 213 transition count 492
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 6 with 105 rules applied. Total rules applied 995 place count 213 transition count 492
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 6 with 35 rules applied. Total rules applied 1030 place count 213 transition count 457
Discarding 66 places :
Symmetric choice reduction at 7 with 66 rule applications. Total rules 1096 place count 147 transition count 329
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 7 with 66 rules applied. Total rules applied 1162 place count 147 transition count 329
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1170 place count 147 transition count 321
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1181 place count 136 transition count 300
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 8 with 11 rules applied. Total rules applied 1192 place count 136 transition count 300
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1195 place count 136 transition count 353
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1205 place count 136 transition count 343
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1210 place count 131 transition count 321
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 9 with 5 rules applied. Total rules applied 1215 place count 131 transition count 321
Deduced a syphon composed of 74 places in 0 ms
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 9 with 49 rules applied. Total rules applied 1264 place count 131 transition count 272
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1265 place count 130 transition count 271
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1266 place count 130 transition count 271
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1267 place count 130 transition count 292
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1269 place count 128 transition count 276
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1271 place count 128 transition count 276
Deduced a syphon composed of 72 places in 0 ms
Applied a total of 1271 rules in 157 ms. Remains 128 /488 variables (removed 360) and now considering 276/673 (removed 397) transitions.
[2024-06-02 22:55:44] [INFO ] Redundant transitions in 29 ms returned []
[2024-06-02 22:55:44] [INFO ] Flow matrix only has 264 transitions (discarded 12 similar events)
// Phase 1: matrix 264 rows 128 cols
[2024-06-02 22:55:44] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:55:44] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/488 places, 276/673 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 527 ms. Remains : 128/488 places, 276/673 transitions.
Built C files in :
/tmp/ltsmin11977793111984522160
[2024-06-02 22:55:44] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11977793111984522160
Running compilation step : cd /tmp/ltsmin11977793111984522160;'/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 882 ms.
Running link step : cd /tmp/ltsmin11977793111984522160;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11977793111984522160;'/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/stateBased400411822557980218.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 673/673 transitions.
Applied a total of 0 rules in 17 ms. Remains 488 /488 variables (removed 0) and now considering 673/673 (removed 0) transitions.
// Phase 1: matrix 673 rows 488 cols
[2024-06-02 22:55:59] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 22:56:00] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 22:56:00] [INFO ] Invariant cache hit.
[2024-06-02 22:56:00] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-06-02 22:56:00] [INFO ] Invariant cache hit.
[2024-06-02 22:56:00] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 585 ms. Remains : 488/488 places, 673/673 transitions.
Built C files in :
/tmp/ltsmin1631311113391398161
[2024-06-02 22:56:00] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1631311113391398161
Running compilation step : cd /tmp/ltsmin1631311113391398161;'/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 911 ms.
Running link step : cd /tmp/ltsmin1631311113391398161;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1631311113391398161;'/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/stateBased6705390035439282318.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 22:56:15] [INFO ] Flatten gal took : 29 ms
[2024-06-02 22:56:15] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:56:15] [INFO ] Time to serialize gal into /tmp/LTL8689431062113365200.gal : 7 ms
[2024-06-02 22:56:15] [INFO ] Time to serialize properties into /tmp/LTL499443880441654258.prop : 1 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/LTL8689431062113365200.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8421291920846416827.hoa' '-atoms' '/tmp/LTL499443880441654258.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...316
Loading property file /tmp/LTL499443880441654258.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8421291920846416827.hoa
Detected timeout of ITS tools.
[2024-06-02 22:56:30] [INFO ] Flatten gal took : 23 ms
[2024-06-02 22:56:30] [INFO ] Flatten gal took : 22 ms
[2024-06-02 22:56:30] [INFO ] Time to serialize gal into /tmp/LTL12503106084790767174.gal : 3 ms
[2024-06-02 22:56:30] [INFO ] Time to serialize properties into /tmp/LTL13936312327838851436.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/LTL12503106084790767174.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13936312327838851436.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...277
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("(p1077==1)"))))||(G("(p848==0)"))))
Formula 0 simplified : XXG!"(p1077==1)" & F!"(p848==0)"
Detected timeout of ITS tools.
[2024-06-02 22:56:45] [INFO ] Flatten gal took : 21 ms
[2024-06-02 22:56:45] [INFO ] Applying decomposition
[2024-06-02 22:56:45] [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/graph17177815163410866643.txt' '-o' '/tmp/graph17177815163410866643.bin' '-w' '/tmp/graph17177815163410866643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17177815163410866643.bin' '-l' '-1' '-v' '-w' '/tmp/graph17177815163410866643.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:56:46] [INFO ] Decomposing Gal with order
[2024-06-02 22:56:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:56:46] [INFO ] Removed a total of 407 redundant transitions.
[2024-06-02 22:56:46] [INFO ] Flatten gal took : 66 ms
[2024-06-02 22:56:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 10 ms.
[2024-06-02 22:56:46] [INFO ] Time to serialize gal into /tmp/LTL9357986672265732581.gal : 10 ms
[2024-06-02 22:56:46] [INFO ] Time to serialize properties into /tmp/LTL7134500356382026771.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/LTL9357986672265732581.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7134500356382026771.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 : !(((X(X(F("(i12.u182.p1077==1)"))))||(G("(i16.u144.p848==0)"))))
Formula 0 simplified : XXG!"(i12.u182.p1077==1)" & F!"(i16.u144.p848==0)"
Reverse transition relation is NOT exact ! Due to transitions t26, t89, t98, t99, t145, t180, t193, t280, t321, t333, t370, t385, t429, t464, t476, t551, t...1032
Computing Next relation with stutter on 618239 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
464 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.70417,177072,1,0,295489,1830,7596,907699,388,8201,621740
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CO4-PT-19-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CO4-PT-19-LTLFireability-03 finished in 73390 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 U p1))))'
Support contains 6 out of 523 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Graph (trivial) has 554 edges and 523 vertex of which 3 / 523 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1015 edges and 521 vertex of which 516 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 218 place count 515 transition count 490
Reduce places removed 216 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 217 rules applied. Total rules applied 435 place count 299 transition count 489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 436 place count 298 transition count 489
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 436 place count 298 transition count 445
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 524 place count 254 transition count 445
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 529 place count 249 transition count 440
Iterating global reduction 3 with 5 rules applied. Total rules applied 534 place count 249 transition count 440
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 534 place count 249 transition count 436
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 542 place count 245 transition count 436
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 545 place count 242 transition count 431
Iterating global reduction 3 with 3 rules applied. Total rules applied 548 place count 242 transition count 431
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 2 rules applied. Total rules applied 550 place count 242 transition count 429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 551 place count 241 transition count 429
Performed 91 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 5 with 182 rules applied. Total rules applied 733 place count 150 transition count 310
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 747 place count 150 transition count 296
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 756 place count 141 transition count 282
Iterating global reduction 6 with 9 rules applied. Total rules applied 765 place count 141 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 766 place count 141 transition count 281
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 768 place count 140 transition count 280
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 769 place count 139 transition count 278
Iterating global reduction 7 with 1 rules applied. Total rules applied 770 place count 139 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 771 place count 139 transition count 277
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 8 with 80 rules applied. Total rules applied 851 place count 99 transition count 318
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 871 place count 99 transition count 298
Discarding 28 places :
Symmetric choice reduction at 9 with 28 rule applications. Total rules 899 place count 71 transition count 186
Iterating global reduction 9 with 28 rules applied. Total rules applied 927 place count 71 transition count 186
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 944 place count 71 transition count 169
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 950 place count 65 transition count 137
Iterating global reduction 10 with 6 rules applied. Total rules applied 956 place count 65 transition count 137
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 961 place count 65 transition count 132
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 969 place count 61 transition count 177
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 11 with 44 rules applied. Total rules applied 1013 place count 61 transition count 133
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1014 place count 61 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1015 place count 60 transition count 132
Applied a total of 1015 rules in 57 ms. Remains 60 /523 variables (removed 463) and now considering 132/715 (removed 583) transitions.
[2024-06-02 22:56:52] [INFO ] Flow matrix only has 101 transitions (discarded 31 similar events)
// Phase 1: matrix 101 rows 60 cols
[2024-06-02 22:56:52] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:56:52] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 22:56:52] [INFO ] Flow matrix only has 101 transitions (discarded 31 similar events)
[2024-06-02 22:56:52] [INFO ] Invariant cache hit.
[2024-06-02 22:56:52] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 22:56:52] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-06-02 22:56:52] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:56:52] [INFO ] Flow matrix only has 101 transitions (discarded 31 similar events)
[2024-06-02 22:56:52] [INFO ] Invariant cache hit.
[2024-06-02 22:56:52] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/523 places, 132/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 253 ms. Remains : 60/523 places, 132/715 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CO4-PT-19-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s5 1) (EQ s26 1)), p0:(OR (EQ s31 1) (AND (EQ s39 1) (EQ s49 1) (EQ s55 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA CO4-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-04 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' '!(G((F(p0)&&(p1||F(p2)||X(F(p3))))))'
Support contains 4 out of 523 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Graph (trivial) has 559 edges and 523 vertex of which 3 / 523 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1015 edges and 521 vertex of which 516 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 220 place count 515 transition count 488
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 438 place count 297 transition count 488
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 438 place count 297 transition count 444
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 526 place count 253 transition count 444
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 531 place count 248 transition count 439
Iterating global reduction 2 with 5 rules applied. Total rules applied 536 place count 248 transition count 439
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 536 place count 248 transition count 435
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 544 place count 244 transition count 435
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 547 place count 241 transition count 430
Iterating global reduction 2 with 3 rules applied. Total rules applied 550 place count 241 transition count 430
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 2 rules applied. Total rules applied 552 place count 241 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 553 place count 240 transition count 428
Performed 93 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 4 with 186 rules applied. Total rules applied 739 place count 147 transition count 307
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 752 place count 147 transition count 294
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 760 place count 139 transition count 282
Iterating global reduction 5 with 8 rules applied. Total rules applied 768 place count 139 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 769 place count 139 transition count 281
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 771 place count 138 transition count 280
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 772 place count 137 transition count 278
Iterating global reduction 6 with 1 rules applied. Total rules applied 773 place count 137 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 774 place count 137 transition count 277
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 7 with 82 rules applied. Total rules applied 856 place count 96 transition count 325
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 876 place count 96 transition count 305
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 904 place count 68 transition count 193
Iterating global reduction 8 with 28 rules applied. Total rules applied 932 place count 68 transition count 193
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 950 place count 68 transition count 175
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 957 place count 61 transition count 137
Iterating global reduction 9 with 7 rules applied. Total rules applied 964 place count 61 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 968 place count 61 transition count 133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 972 place count 59 transition count 150
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 10 with 31 rules applied. Total rules applied 1003 place count 59 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
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 1005 place count 58 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1007 place count 56 transition count 125
Applied a total of 1007 rules in 57 ms. Remains 56 /523 variables (removed 467) and now considering 125/715 (removed 590) transitions.
[2024-06-02 22:56:52] [INFO ] Flow matrix only has 113 transitions (discarded 12 similar events)
// Phase 1: matrix 113 rows 56 cols
[2024-06-02 22:56:52] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:56:52] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 22:56:52] [INFO ] Flow matrix only has 113 transitions (discarded 12 similar events)
[2024-06-02 22:56:52] [INFO ] Invariant cache hit.
[2024-06-02 22:56:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 22:56:52] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-06-02 22:56:52] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:56:52] [INFO ] Flow matrix only has 113 transitions (discarded 12 similar events)
[2024-06-02 22:56:52] [INFO ] Invariant cache hit.
[2024-06-02 22:56:52] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/523 places, 125/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 218 ms. Remains : 56/523 places, 125/715 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : CO4-PT-19-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s38 1), p1:(EQ s43 1), p2:(EQ s18 0), p3:(EQ s26 0)], 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 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-19-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-05 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&G(p1)))))'
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Graph (trivial) has 559 edges and 523 vertex of which 3 / 523 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1015 edges and 521 vertex of which 516 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 223 place count 515 transition count 485
Reduce places removed 221 places and 0 transitions.
Iterating post reduction 1 with 221 rules applied. Total rules applied 444 place count 294 transition count 485
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 444 place count 294 transition count 441
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 532 place count 250 transition count 441
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 537 place count 245 transition count 436
Iterating global reduction 2 with 5 rules applied. Total rules applied 542 place count 245 transition count 436
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 542 place count 245 transition count 432
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 550 place count 241 transition count 432
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 553 place count 238 transition count 427
Iterating global reduction 2 with 3 rules applied. Total rules applied 556 place count 238 transition count 427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 2 rules applied. Total rules applied 558 place count 238 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 559 place count 237 transition count 425
Performed 92 Post agglomeration using F-continuation condition with reduction of 25 identical transitions.
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 743 place count 145 transition count 308
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 758 place count 145 transition count 293
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 767 place count 136 transition count 279
Iterating global reduction 5 with 9 rules applied. Total rules applied 776 place count 136 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 777 place count 136 transition count 278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 779 place count 135 transition count 277
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 780 place count 134 transition count 275
Iterating global reduction 6 with 1 rules applied. Total rules applied 781 place count 134 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 782 place count 134 transition count 274
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 7 with 82 rules applied. Total rules applied 864 place count 93 transition count 320
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 885 place count 93 transition count 299
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 913 place count 65 transition count 187
Iterating global reduction 8 with 28 rules applied. Total rules applied 941 place count 65 transition count 187
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 960 place count 65 transition count 168
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 967 place count 58 transition count 130
Iterating global reduction 9 with 7 rules applied. Total rules applied 974 place count 58 transition count 130
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 979 place count 58 transition count 125
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 987 place count 54 transition count 166
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 10 with 40 rules applied. Total rules applied 1027 place count 54 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1029 place count 52 transition count 124
Applied a total of 1029 rules in 54 ms. Remains 52 /523 variables (removed 471) and now considering 124/715 (removed 591) transitions.
[2024-06-02 22:56:52] [INFO ] Flow matrix only has 101 transitions (discarded 23 similar events)
// Phase 1: matrix 101 rows 52 cols
[2024-06-02 22:56:52] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:56:52] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-02 22:56:52] [INFO ] Flow matrix only has 101 transitions (discarded 23 similar events)
[2024-06-02 22:56:52] [INFO ] Invariant cache hit.
[2024-06-02 22:56:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 22:56:52] [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:56:52] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:56:52] [INFO ] Flow matrix only has 101 transitions (discarded 23 similar events)
[2024-06-02 22:56:52] [INFO ] Invariant cache hit.
[2024-06-02 22:56:52] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/523 places, 124/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 223 ms. Remains : 52/523 places, 124/715 transitions.
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-19-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(NEQ s12 1), p1:(NEQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 13 reset in 80 ms.
Product exploration explored 100000 steps with 127 reset in 94 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 107 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 812 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 74 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:56:53] [INFO ] Flow matrix only has 101 transitions (discarded 23 similar events)
[2024-06-02 22:56:53] [INFO ] Invariant cache hit.
[2024-06-02 22:56:53] [INFO ] [Real]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-06-02 22:56:53] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:56:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:56:53] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:56:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 22:56:53] [INFO ] After 5ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:56:53] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-06-02 22:56:53] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 124/124 transitions.
Graph (complete) has 161 edges and 52 vertex of which 42 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 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 42 transition count 100
Reduce places removed 1 places and 0 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 1 with 3 rules applied. Total rules applied 27 place count 41 transition count 98
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 39 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 37 transition count 95
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 37 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 36 place count 37 transition count 93
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 37 transition count 92
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 44 place count 37 transition count 85
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 19 edges and 28 vertex of which 5 / 28 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 4 with 14 rules applied. Total rules applied 58 place count 25 transition count 81
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 65 place count 25 transition count 74
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 66 place count 24 transition count 71
Iterating global reduction 6 with 1 rules applied. Total rules applied 67 place count 24 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 68 place count 24 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 73 place count 21 transition count 68
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 64 edges and 21 vertex of which 20 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 3 rules applied. Total rules applied 76 place count 20 transition count 66
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 79 place count 20 transition count 63
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 97 place count 20 transition count 45
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 99 place count 18 transition count 40
Iterating global reduction 9 with 2 rules applied. Total rules applied 101 place count 18 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 103 place count 18 transition count 38
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 107 place count 18 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 111 place count 14 transition count 34
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 117 place count 14 transition count 28
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 118 place count 14 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 119 place count 14 transition count 27
Applied a total of 119 rules in 14 ms. Remains 14 /52 variables (removed 38) and now considering 27/124 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 14/52 places, 27/124 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished Best-First random walk after 62 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=62 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p1)), (F (AND p1 (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0))), (F (AND (NOT p1) p0))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) (NOT p0)))
Knowledge based reduction with 13 factoid took 144 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-19-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-19-LTLFireability-07 finished in 1274 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 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 508 transition count 700
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 508 transition count 700
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 500 transition count 692
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 500 transition count 692
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 500 transition count 689
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 494 transition count 682
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 494 transition count 682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 494 transition count 681
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 490 transition count 677
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 490 transition count 677
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 490 transition count 675
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 489 transition count 674
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 489 transition count 674
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 488 transition count 673
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 488 transition count 673
Applied a total of 76 rules in 42 ms. Remains 488 /523 variables (removed 35) and now considering 673/715 (removed 42) transitions.
// Phase 1: matrix 673 rows 488 cols
[2024-06-02 22:56:53] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 22:56:54] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 22:56:54] [INFO ] Invariant cache hit.
[2024-06-02 22:56:54] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-06-02 22:56:54] [INFO ] Invariant cache hit.
[2024-06-02 22:56:54] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 488/523 places, 673/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 690 ms. Remains : 488/523 places, 673/715 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-19-LTLFireability-10 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 s106 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-19-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-10 finished in 790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p0)))))'
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 508 transition count 700
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 508 transition count 700
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 499 transition count 690
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 499 transition count 690
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 499 transition count 687
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 493 transition count 680
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 493 transition count 680
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 493 transition count 679
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 489 transition count 675
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 489 transition count 675
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 489 transition count 673
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 488 transition count 672
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 488 transition count 672
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 487 transition count 671
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 487 transition count 671
Applied a total of 78 rules in 48 ms. Remains 487 /523 variables (removed 36) and now considering 671/715 (removed 44) transitions.
// Phase 1: matrix 671 rows 487 cols
[2024-06-02 22:56:54] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 22:56:54] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 22:56:54] [INFO ] Invariant cache hit.
[2024-06-02 22:56:55] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2024-06-02 22:56:55] [INFO ] Invariant cache hit.
[2024-06-02 22:56:55] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 487/523 places, 671/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 664 ms. Remains : 487/523 places, 671/715 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-19-LTLFireability-11 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: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s420 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CO4-PT-19-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-11 finished in 811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U G(p1)))))'
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 509 transition count 701
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 509 transition count 701
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 502 transition count 693
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 502 transition count 693
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 502 transition count 690
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 498 transition count 685
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 498 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 498 transition count 684
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 496 transition count 682
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 496 transition count 682
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 496 transition count 680
Applied a total of 60 rules in 39 ms. Remains 496 /523 variables (removed 27) and now considering 680/715 (removed 35) transitions.
// Phase 1: matrix 680 rows 496 cols
[2024-06-02 22:56:55] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 22:56:55] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 22:56:55] [INFO ] Invariant cache hit.
[2024-06-02 22:56:55] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-06-02 22:56:55] [INFO ] Invariant cache hit.
[2024-06-02 22:56:56] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 496/523 places, 680/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 650 ms. Remains : 496/523 places, 680/715 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CO4-PT-19-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s339 1), p0:(EQ s42 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 56 steps with 2 reset in 0 ms.
FORMULA CO4-PT-19-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-14 finished in 873 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||F(p1)))))'
Support contains 4 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 509 transition count 701
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 509 transition count 701
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 501 transition count 692
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 501 transition count 692
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 501 transition count 690
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 496 transition count 684
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 496 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 496 transition count 683
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 493 transition count 680
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 493 transition count 680
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 493 transition count 679
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 492 transition count 678
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 492 transition count 678
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 491 transition count 677
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 491 transition count 677
Applied a total of 68 rules in 47 ms. Remains 491 /523 variables (removed 32) and now considering 677/715 (removed 38) transitions.
// Phase 1: matrix 677 rows 491 cols
[2024-06-02 22:56:56] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 22:56:56] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 22:56:56] [INFO ] Invariant cache hit.
[2024-06-02 22:56:56] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-06-02 22:56:56] [INFO ] Invariant cache hit.
[2024-06-02 22:56:57] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 491/523 places, 677/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 681 ms. Remains : 491/523 places, 677/715 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-19-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (EQ s482 1) (EQ s309 1) (EQ s175 1)), p0:(EQ s179 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3015 reset in 157 ms.
Stack based approach found an accepted trace after 2538 steps with 75 reset with depth 21 and stack size 21 in 6 ms.
FORMULA CO4-PT-19-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CO4-PT-19-LTLFireability-15 finished in 1020 ms.
All properties solved by simple procedures.
Total runtime 107968 ms.

BK_STOP 1717369018470

--------------------
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-19"
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-19, 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-171734910200093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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