fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r571-tall-171734910200087
Last Updated
July 7, 2024

About the Execution of 2023-gold for CO4-PT-18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1723.819 59858.00 137822.00 595.00 FFTFFFFTTFFTFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r571-tall-171734910200087.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-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910200087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 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 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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 239K 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-18-LTLCardinality-00
FORMULA_NAME CO4-PT-18-LTLCardinality-01
FORMULA_NAME CO4-PT-18-LTLCardinality-02
FORMULA_NAME CO4-PT-18-LTLCardinality-03
FORMULA_NAME CO4-PT-18-LTLCardinality-04
FORMULA_NAME CO4-PT-18-LTLCardinality-05
FORMULA_NAME CO4-PT-18-LTLCardinality-06
FORMULA_NAME CO4-PT-18-LTLCardinality-07
FORMULA_NAME CO4-PT-18-LTLCardinality-08
FORMULA_NAME CO4-PT-18-LTLCardinality-09
FORMULA_NAME CO4-PT-18-LTLCardinality-10
FORMULA_NAME CO4-PT-18-LTLCardinality-11
FORMULA_NAME CO4-PT-18-LTLCardinality-12
FORMULA_NAME CO4-PT-18-LTLCardinality-13
FORMULA_NAME CO4-PT-18-LTLCardinality-14
FORMULA_NAME CO4-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717368826933

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-18
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:53:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:53:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:53:48] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-02 22:53:48] [INFO ] Transformed 979 places.
[2024-06-02 22:53:48] [INFO ] Transformed 1111 transitions.
[2024-06-02 22:53:48] [INFO ] Found NUPN structural information;
[2024-06-02 22:53:48] [INFO ] Parsed PT model containing 979 places and 1111 transitions and 2420 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 157 places in 13 ms
Reduce places removed 157 places and 177 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 822 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 822/822 places, 934/934 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 808 transition count 931
Discarding 128 places :
Symmetric choice reduction at 1 with 128 rule applications. Total rules 145 place count 680 transition count 801
Iterating global reduction 1 with 128 rules applied. Total rules applied 273 place count 680 transition count 801
Discarding 103 places :
Symmetric choice reduction at 1 with 103 rule applications. Total rules 376 place count 577 transition count 698
Iterating global reduction 1 with 103 rules applied. Total rules applied 479 place count 577 transition count 698
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 482 place count 577 transition count 695
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 528 place count 531 transition count 649
Iterating global reduction 2 with 46 rules applied. Total rules applied 574 place count 531 transition count 649
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 608 place count 497 transition count 615
Iterating global reduction 2 with 34 rules applied. Total rules applied 642 place count 497 transition count 615
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 644 place count 497 transition count 613
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 660 place count 481 transition count 597
Iterating global reduction 3 with 16 rules applied. Total rules applied 676 place count 481 transition count 597
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 678 place count 481 transition count 595
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 682 place count 477 transition count 591
Iterating global reduction 4 with 4 rules applied. Total rules applied 686 place count 477 transition count 591
Applied a total of 686 rules in 320 ms. Remains 477 /822 variables (removed 345) and now considering 591/934 (removed 343) transitions.
// Phase 1: matrix 591 rows 477 cols
[2024-06-02 22:53:49] [INFO ] Computed 5 invariants in 26 ms
[2024-06-02 22:53:49] [INFO ] Implicit Places using invariants in 362 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 395 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 476/822 places, 591/934 transitions.
Applied a total of 0 rules in 22 ms. Remains 476 /476 variables (removed 0) and now considering 591/591 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 737 ms. Remains : 476/822 places, 591/934 transitions.
Support contains 39 out of 476 places after structural reductions.
[2024-06-02 22:53:49] [INFO ] Flatten gal took : 60 ms
[2024-06-02 22:53:49] [INFO ] Flatten gal took : 27 ms
[2024-06-02 22:53:49] [INFO ] Input system was already deterministic with 591 transitions.
Incomplete random walk after 10000 steps, including 45 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 591 rows 476 cols
[2024-06-02 22:53:50] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:53:51] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-06-02 22:53:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:53:52] [INFO ] After 605ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :18
[2024-06-02 22:53:52] [INFO ] After 1280ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :18
Attempting to minimize the solution found.
Minimization took 436 ms.
[2024-06-02 22:53:53] [INFO ] After 2107ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :18
Fused 19 Parikh solutions to 18 different solutions.
Finished Parikh walk after 88 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=88 )
Parikh walk visited 17 properties in 81 ms.
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 591/591 transitions.
Graph (trivial) has 505 edges and 476 vertex of which 3 / 476 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 737 edges and 474 vertex of which 458 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 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 237 rules applied. Total rules applied 239 place count 458 transition count 339
Reduce places removed 219 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 221 rules applied. Total rules applied 460 place count 239 transition count 337
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 462 place count 238 transition count 336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 463 place count 237 transition count 336
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 463 place count 237 transition count 291
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 553 place count 192 transition count 291
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 558 place count 187 transition count 286
Iterating global reduction 4 with 5 rules applied. Total rules applied 563 place count 187 transition count 286
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 563 place count 187 transition count 284
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 567 place count 185 transition count 284
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 570 place count 182 transition count 281
Iterating global reduction 4 with 3 rules applied. Total rules applied 573 place count 182 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 574 place count 182 transition count 280
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 575 place count 181 transition count 279
Iterating global reduction 5 with 1 rules applied. Total rules applied 576 place count 181 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 577 place count 181 transition count 278
Performed 70 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 140 rules applied. Total rules applied 717 place count 111 transition count 192
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 723 place count 111 transition count 186
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 728 place count 106 transition count 181
Iterating global reduction 7 with 5 rules applied. Total rules applied 733 place count 106 transition count 181
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 735 place count 105 transition count 180
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 797 place count 74 transition count 182
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 816 place count 74 transition count 163
Discarding 26 places :
Symmetric choice reduction at 8 with 26 rule applications. Total rules 842 place count 48 transition count 111
Iterating global reduction 8 with 26 rules applied. Total rules applied 868 place count 48 transition count 111
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 886 place count 48 transition count 93
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 892 place count 42 transition count 76
Iterating global reduction 9 with 6 rules applied. Total rules applied 898 place count 42 transition count 76
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 903 place count 42 transition count 71
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 904 place count 42 transition count 70
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 910 place count 42 transition count 64
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 918 place count 36 transition count 62
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 920 place count 36 transition count 62
Graph (complete) has 112 edges and 36 vertex of which 35 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 11 with 1 rules applied. Total rules applied 921 place count 35 transition count 62
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 922 place count 35 transition count 61
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 923 place count 35 transition count 61
Graph (complete) has 109 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 13 with 1 rules applied. Total rules applied 924 place count 34 transition count 61
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 925 place count 34 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 926 place count 34 transition count 60
Graph (complete) has 106 edges and 34 vertex of which 33 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 927 place count 33 transition count 60
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 928 place count 33 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 929 place count 32 transition count 58
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t68.t72.t522.t561 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 21 edges and 28 vertex of which 3 / 28 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 17 with 3 rules applied. Total rules applied 932 place count 26 transition count 56
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 18 with 5 rules applied. Total rules applied 937 place count 26 transition count 51
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 938 place count 25 transition count 49
Iterating global reduction 19 with 1 rules applied. Total rules applied 939 place count 25 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 940 place count 25 transition count 48
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 20 with 7 rules applied. Total rules applied 947 place count 25 transition count 41
Discarding 4 places :
Symmetric choice reduction at 20 with 4 rule applications. Total rules 951 place count 21 transition count 37
Iterating global reduction 20 with 4 rules applied. Total rules applied 955 place count 21 transition count 37
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 959 place count 21 transition count 33
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 960 place count 20 transition count 32
Iterating global reduction 21 with 1 rules applied. Total rules applied 961 place count 20 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 962 place count 20 transition count 31
Free-agglomeration rule applied 3 times.
Iterating global reduction 22 with 3 rules applied. Total rules applied 965 place count 20 transition count 28
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 968 place count 17 transition count 28
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 23 with 3 rules applied. Total rules applied 971 place count 17 transition count 28
Applied a total of 971 rules in 87 ms. Remains 17 /476 variables (removed 459) and now considering 28/591 (removed 563) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 17/476 places, 28/591 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CO4-PT-18-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 740 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.9 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))))'
Support contains 1 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 454 transition count 569
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 454 transition count 569
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 444 transition count 559
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 444 transition count 559
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 66 place count 444 transition count 557
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 440 transition count 553
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 440 transition count 553
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 437 transition count 550
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 437 transition count 550
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 436 transition count 549
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 436 transition count 549
Applied a total of 82 rules in 76 ms. Remains 436 /476 variables (removed 40) and now considering 549/591 (removed 42) transitions.
// Phase 1: matrix 549 rows 436 cols
[2024-06-02 22:53:53] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 22:53:53] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 22:53:53] [INFO ] Invariant cache hit.
[2024-06-02 22:53:53] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-06-02 22:53:53] [INFO ] Invariant cache hit.
[2024-06-02 22:53:54] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 436/476 places, 549/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 616 ms. Remains : 436/476 places, 549/591 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 211 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 2 ms.
FORMULA CO4-PT-18-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLCardinality-04 finished in 879 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 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 457 transition count 572
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 457 transition count 572
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 449 transition count 564
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 449 transition count 564
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 449 transition count 562
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 446 transition count 559
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 446 transition count 559
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 444 transition count 557
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 444 transition count 557
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 443 transition count 556
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 443 transition count 556
Applied a total of 68 rules in 82 ms. Remains 443 /476 variables (removed 33) and now considering 556/591 (removed 35) transitions.
// Phase 1: matrix 556 rows 443 cols
[2024-06-02 22:53:54] [INFO ] Computed 4 invariants in 9 ms
[2024-06-02 22:53:54] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 22:53:54] [INFO ] Invariant cache hit.
[2024-06-02 22:53:54] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-06-02 22:53:54] [INFO ] Invariant cache hit.
[2024-06-02 22:53:54] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 443/476 places, 556/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 552 ms. Remains : 443/476 places, 556/591 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (EQ s54 0) (EQ s223 1)) (OR (EQ s29 0) (EQ s325 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 89 reset in 169 ms.
Product exploration explored 100000 steps with 7 reset in 140 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 700 edges and 443 vertex of which 438 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 60 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1416132 steps, run timeout after 3001 ms. (steps per millisecond=471 ) properties seen :{}
Probabilistic random walk after 1416132 steps, saw 270723 distinct states, run finished after 3005 ms. (steps per millisecond=471 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:53:58] [INFO ] Invariant cache hit.
[2024-06-02 22:53:58] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:53:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:53:58] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:53:58] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-06-02 22:53:58] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 46 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLCardinality-06 finished in 4661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((G(p2)||p1))))'
Support contains 6 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 460 transition count 575
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 460 transition count 575
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 453 transition count 568
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 453 transition count 568
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 453 transition count 567
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 449 transition count 563
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 449 transition count 563
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 446 transition count 560
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 446 transition count 560
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 445 transition count 559
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 445 transition count 559
Applied a total of 63 rules in 42 ms. Remains 445 /476 variables (removed 31) and now considering 559/591 (removed 32) transitions.
// Phase 1: matrix 559 rows 445 cols
[2024-06-02 22:53:59] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 22:53:59] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 22:53:59] [INFO ] Invariant cache hit.
[2024-06-02 22:53:59] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-06-02 22:53:59] [INFO ] Invariant cache hit.
[2024-06-02 22:53:59] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 445/476 places, 559/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 535 ms. Remains : 445/476 places, 559/591 transitions.
Stuttering acceptance computed with spot in 249 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CO4-PT-18-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(AND (EQ s420 0) (EQ s30 1)), p2:(OR (EQ s13 0) (EQ s180 1)), p1:(OR (EQ s410 0) (EQ s170 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 365 ms.
Product exploration explored 100000 steps with 50000 reset in 330 ms.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 706 edges and 445 vertex of which 439 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 16 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), true, (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 21 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLCardinality-07 finished in 1526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 456 transition count 571
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 456 transition count 571
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 446 transition count 561
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 446 transition count 561
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 446 transition count 559
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 441 transition count 554
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 441 transition count 554
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 437 transition count 550
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 437 transition count 550
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 436 transition count 549
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 436 transition count 549
Applied a total of 82 rules in 35 ms. Remains 436 /476 variables (removed 40) and now considering 549/591 (removed 42) transitions.
// Phase 1: matrix 549 rows 436 cols
[2024-06-02 22:54:00] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 22:54:00] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 22:54:00] [INFO ] Invariant cache hit.
[2024-06-02 22:54:00] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-06-02 22:54:00] [INFO ] Invariant cache hit.
[2024-06-02 22:54:01] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 436/476 places, 549/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 521 ms. Remains : 436/476 places, 549/591 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-18-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s203 1), p1:(EQ s378 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 20 reset in 91 ms.
Product exploration explored 100000 steps with 38 reset in 110 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 693 edges and 436 vertex of which 431 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 114 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 860320 steps, run timeout after 3001 ms. (steps per millisecond=286 ) properties seen :{3=1, 4=1}
Probabilistic random walk after 860320 steps, saw 170327 distinct states, run finished after 3001 ms. (steps per millisecond=286 ) properties seen :2
Running SMT prover for 3 properties.
[2024-06-02 22:54:05] [INFO ] Invariant cache hit.
[2024-06-02 22:54:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:54:05] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 22:54:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:54:05] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-06-02 22:54:05] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-06-02 22:54:05] [INFO ] After 336ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 549/549 transitions.
Graph (trivial) has 470 edges and 436 vertex of which 3 / 436 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 690 edges and 434 vertex of which 419 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 212 rules applied. Total rules applied 214 place count 419 transition count 323
Reduce places removed 194 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 196 rules applied. Total rules applied 410 place count 225 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 411 place count 224 transition count 321
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 411 place count 224 transition count 274
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 505 place count 177 transition count 274
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 506 place count 176 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 507 place count 176 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 508 place count 176 transition count 272
Performed 66 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 640 place count 110 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 645 place count 110 transition count 185
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 651 place count 104 transition count 179
Iterating global reduction 5 with 6 rules applied. Total rules applied 657 place count 104 transition count 179
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 663 place count 101 transition count 176
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 667 place count 101 transition count 172
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 671 place count 97 transition count 168
Iterating global reduction 6 with 4 rules applied. Total rules applied 675 place count 97 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 676 place count 97 transition count 167
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 682 place count 94 transition count 164
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 685 place count 94 transition count 161
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 688 place count 91 transition count 158
Iterating global reduction 8 with 3 rules applied. Total rules applied 691 place count 91 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 693 place count 91 transition count 156
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 9 with 56 rules applied. Total rules applied 749 place count 63 transition count 158
Drop transitions removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 9 with 36 rules applied. Total rules applied 785 place count 63 transition count 122
Discarding 25 places :
Symmetric choice reduction at 10 with 25 rule applications. Total rules 810 place count 38 transition count 86
Iterating global reduction 10 with 25 rules applied. Total rules applied 835 place count 38 transition count 86
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 855 place count 38 transition count 66
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 859 place count 34 transition count 55
Iterating global reduction 11 with 4 rules applied. Total rules applied 863 place count 34 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 866 place count 34 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 868 place count 33 transition count 67
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 871 place count 33 transition count 64
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 13 with 13 rules applied. Total rules applied 884 place count 33 transition count 51
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 885 place count 32 transition count 50
Iterating global reduction 13 with 1 rules applied. Total rules applied 886 place count 32 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 887 place count 32 transition count 49
Free-agglomeration rule applied 5 times.
Iterating global reduction 14 with 5 rules applied. Total rules applied 892 place count 32 transition count 44
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 899 place count 27 transition count 42
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 901 place count 27 transition count 42
Graph (complete) has 77 edges and 27 vertex of which 26 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 902 place count 26 transition count 42
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 903 place count 26 transition count 41
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 904 place count 26 transition count 40
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 905 place count 26 transition count 40
Graph (complete) has 73 edges and 26 vertex of which 25 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 17 with 1 rules applied. Total rules applied 906 place count 25 transition count 40
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 907 place count 25 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 908 place count 25 transition count 39
Graph (complete) has 70 edges and 25 vertex of which 24 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 19 with 1 rules applied. Total rules applied 909 place count 24 transition count 39
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 910 place count 24 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 911 place count 23 transition count 37
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t68.t72.t522.t561 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 15 edges and 19 vertex of which 3 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 21 with 3 rules applied. Total rules applied 914 place count 17 transition count 35
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t65.t508.t44.t45.t46.t47.t48.t49.t50.t51.t63.t30.t561.t168.t169.t170.t574.t13.t173 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 12 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 22 with 9 rules applied. Total rules applied 923 place count 13 transition count 27
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 5 rules applied. Total rules applied 928 place count 12 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 24 with 2 rules applied. Total rules applied 930 place count 12 transition count 21
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 931 place count 11 transition count 19
Iterating global reduction 24 with 1 rules applied. Total rules applied 932 place count 11 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 933 place count 11 transition count 18
Free-agglomeration rule applied 3 times.
Iterating global reduction 25 with 3 rules applied. Total rules applied 936 place count 11 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 25 with 3 rules applied. Total rules applied 939 place count 8 transition count 15
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 26 with 2 rules applied. Total rules applied 941 place count 8 transition count 13
Applied a total of 941 rules in 59 ms. Remains 8 /436 variables (removed 428) and now considering 13/549 (removed 536) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 8/436 places, 13/549 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 12 factoid took 346 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 549/549 transitions.
Applied a total of 0 rules in 9 ms. Remains 436 /436 variables (removed 0) and now considering 549/549 (removed 0) transitions.
[2024-06-02 22:54:06] [INFO ] Invariant cache hit.
[2024-06-02 22:54:06] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 22:54:06] [INFO ] Invariant cache hit.
[2024-06-02 22:54:06] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-06-02 22:54:06] [INFO ] Invariant cache hit.
[2024-06-02 22:54:06] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 478 ms. Remains : 436/436 places, 549/549 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 693 edges and 436 vertex of which 431 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 109 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 942588 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 942588 steps, saw 185848 distinct states, run finished after 3001 ms. (steps per millisecond=314 ) properties seen :2
Running SMT prover for 2 properties.
[2024-06-02 22:54:10] [INFO ] Invariant cache hit.
[2024-06-02 22:54:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:54:10] [INFO ] After 165ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-06-02 22:54:10] [INFO ] After 205ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:54:10] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:54:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:54:11] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 22:54:11] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-06-02 22:54:11] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 549/549 transitions.
Graph (trivial) has 470 edges and 436 vertex of which 3 / 436 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 690 edges and 434 vertex of which 419 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 212 rules applied. Total rules applied 214 place count 419 transition count 323
Reduce places removed 194 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 196 rules applied. Total rules applied 410 place count 225 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 411 place count 224 transition count 321
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 411 place count 224 transition count 274
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 505 place count 177 transition count 274
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 506 place count 176 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 507 place count 176 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 508 place count 176 transition count 272
Performed 66 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 640 place count 110 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 645 place count 110 transition count 185
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 651 place count 104 transition count 179
Iterating global reduction 5 with 6 rules applied. Total rules applied 657 place count 104 transition count 179
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 663 place count 101 transition count 176
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 667 place count 101 transition count 172
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 671 place count 97 transition count 168
Iterating global reduction 6 with 4 rules applied. Total rules applied 675 place count 97 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 676 place count 97 transition count 167
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 682 place count 94 transition count 164
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 685 place count 94 transition count 161
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 688 place count 91 transition count 158
Iterating global reduction 8 with 3 rules applied. Total rules applied 691 place count 91 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 693 place count 91 transition count 156
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 9 with 56 rules applied. Total rules applied 749 place count 63 transition count 158
Drop transitions removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 9 with 36 rules applied. Total rules applied 785 place count 63 transition count 122
Discarding 25 places :
Symmetric choice reduction at 10 with 25 rule applications. Total rules 810 place count 38 transition count 86
Iterating global reduction 10 with 25 rules applied. Total rules applied 835 place count 38 transition count 86
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 855 place count 38 transition count 66
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 859 place count 34 transition count 55
Iterating global reduction 11 with 4 rules applied. Total rules applied 863 place count 34 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 866 place count 34 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 868 place count 33 transition count 67
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 871 place count 33 transition count 64
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 13 with 13 rules applied. Total rules applied 884 place count 33 transition count 51
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 885 place count 32 transition count 50
Iterating global reduction 13 with 1 rules applied. Total rules applied 886 place count 32 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 887 place count 32 transition count 49
Free-agglomeration rule applied 5 times.
Iterating global reduction 14 with 5 rules applied. Total rules applied 892 place count 32 transition count 44
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 899 place count 27 transition count 42
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 901 place count 27 transition count 42
Graph (complete) has 77 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 902 place count 26 transition count 42
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 903 place count 26 transition count 41
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 904 place count 26 transition count 40
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 905 place count 26 transition count 40
Graph (complete) has 73 edges and 26 vertex of which 25 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 17 with 1 rules applied. Total rules applied 906 place count 25 transition count 40
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 907 place count 25 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 908 place count 25 transition count 39
Graph (complete) has 70 edges and 25 vertex of which 24 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 19 with 1 rules applied. Total rules applied 909 place count 24 transition count 39
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 910 place count 24 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 911 place count 23 transition count 37
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t68.t72.t522.t561 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 15 edges and 19 vertex of which 3 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 21 with 3 rules applied. Total rules applied 914 place count 17 transition count 35
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t65.t508.t44.t45.t46.t47.t48.t49.t50.t51.t63.t30.t561.t168.t169.t170.t574.t13.t173 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 12 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 22 with 9 rules applied. Total rules applied 923 place count 13 transition count 27
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 5 rules applied. Total rules applied 928 place count 12 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 24 with 2 rules applied. Total rules applied 930 place count 12 transition count 21
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 931 place count 11 transition count 19
Iterating global reduction 24 with 1 rules applied. Total rules applied 932 place count 11 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 933 place count 11 transition count 18
Free-agglomeration rule applied 3 times.
Iterating global reduction 25 with 3 rules applied. Total rules applied 936 place count 11 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 25 with 3 rules applied. Total rules applied 939 place count 8 transition count 15
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 26 with 2 rules applied. Total rules applied 941 place count 8 transition count 13
Applied a total of 941 rules in 49 ms. Remains 8 /436 variables (removed 428) and now considering 13/549 (removed 536) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 8/436 places, 13/549 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 206 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 10 reset in 83 ms.
Product exploration explored 100000 steps with 4 reset in 82 ms.
Built C files in :
/tmp/ltsmin7257246455730683013
[2024-06-02 22:54:11] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7257246455730683013
Running compilation step : cd /tmp/ltsmin7257246455730683013;'/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 784 ms.
Running link step : cd /tmp/ltsmin7257246455730683013;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin7257246455730683013;'/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/stateBased10998612552255035032.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 549/549 transitions.
Applied a total of 0 rules in 6 ms. Remains 436 /436 variables (removed 0) and now considering 549/549 (removed 0) transitions.
[2024-06-02 22:54:27] [INFO ] Invariant cache hit.
[2024-06-02 22:54:27] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 22:54:27] [INFO ] Invariant cache hit.
[2024-06-02 22:54:27] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-06-02 22:54:27] [INFO ] Invariant cache hit.
[2024-06-02 22:54:27] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 436/436 places, 549/549 transitions.
Built C files in :
/tmp/ltsmin14792102135867158720
[2024-06-02 22:54:27] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14792102135867158720
Running compilation step : cd /tmp/ltsmin14792102135867158720;'/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 702 ms.
Running link step : cd /tmp/ltsmin14792102135867158720;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14792102135867158720;'/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/stateBased5181001787970237223.hoa' '--buchi-type=spotba'
LTSmin run took 1178 ms.
FORMULA CO4-PT-18-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-18-LTLCardinality-09 finished in 28938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Graph (trivial) has 508 edges and 476 vertex of which 3 / 476 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 738 edges and 474 vertex of which 468 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 215 rules applied. Total rules applied 217 place count 467 transition count 366
Reduce places removed 215 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 217 rules applied. Total rules applied 434 place count 252 transition count 364
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 436 place count 251 transition count 363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 437 place count 250 transition count 363
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 437 place count 250 transition count 317
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 529 place count 204 transition count 317
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 534 place count 199 transition count 312
Iterating global reduction 4 with 5 rules applied. Total rules applied 539 place count 199 transition count 312
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 539 place count 199 transition count 310
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 543 place count 197 transition count 310
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 546 place count 194 transition count 307
Iterating global reduction 4 with 3 rules applied. Total rules applied 549 place count 194 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 550 place count 194 transition count 306
Performed 73 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 696 place count 121 transition count 213
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 703 place count 121 transition count 206
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 709 place count 115 transition count 200
Iterating global reduction 6 with 6 rules applied. Total rules applied 715 place count 115 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 716 place count 115 transition count 199
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 718 place count 114 transition count 198
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 784 place count 81 transition count 200
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 804 place count 81 transition count 180
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 831 place count 54 transition count 126
Iterating global reduction 8 with 27 rules applied. Total rules applied 858 place count 54 transition count 126
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 875 place count 54 transition count 109
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 882 place count 47 transition count 89
Iterating global reduction 9 with 7 rules applied. Total rules applied 889 place count 47 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 894 place count 47 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
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 898 place count 45 transition count 110
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 919 place count 45 transition count 89
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 921 place count 43 transition count 87
Applied a total of 921 rules in 49 ms. Remains 43 /476 variables (removed 433) and now considering 87/591 (removed 504) transitions.
[2024-06-02 22:54:29] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
// Phase 1: matrix 77 rows 43 cols
[2024-06-02 22:54:29] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:54:29] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-02 22:54:29] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 22:54:29] [INFO ] Invariant cache hit.
[2024-06-02 22:54:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:54:29] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-06-02 22:54:29] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:54:29] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 22:54:29] [INFO ] Invariant cache hit.
[2024-06-02 22:54:29] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/476 places, 87/591 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 43/476 places, 87/591 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 78 ms.
Product exploration explored 100000 steps with 24 reset in 72 ms.
Computed a total of 7 stabilizing places and 15 stable transitions
Computed a total of 7 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1061 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9248 steps, run visited all 1 properties in 16 ms. (steps per millisecond=578 )
Probabilistic random walk after 9248 steps, saw 2728 distinct states, run finished after 17 ms. (steps per millisecond=544 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 87/87 transitions.
Applied a total of 0 rules in 5 ms. Remains 43 /43 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-06-02 22:54:30] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 22:54:30] [INFO ] Invariant cache hit.
[2024-06-02 22:54:30] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-02 22:54:30] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 22:54:30] [INFO ] Invariant cache hit.
[2024-06-02 22:54:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:54:30] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-02 22:54:30] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:54:30] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 22:54:30] [INFO ] Invariant cache hit.
[2024-06-02 22:54:30] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 43/43 places, 87/87 transitions.
Computed a total of 7 stabilizing places and 15 stable transitions
Computed a total of 7 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 18 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7 reset in 42 ms.
Product exploration explored 100000 steps with 0 reset in 36 ms.
Built C files in :
/tmp/ltsmin17604568886001345512
[2024-06-02 22:54:30] [INFO ] Computing symmetric may disable matrix : 87 transitions.
[2024-06-02 22:54:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:54:30] [INFO ] Computing symmetric may enable matrix : 87 transitions.
[2024-06-02 22:54:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:54:30] [INFO ] Computing Do-Not-Accords matrix : 87 transitions.
[2024-06-02 22:54:30] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:54:30] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17604568886001345512
Running compilation step : cd /tmp/ltsmin17604568886001345512;'/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 175 ms.
Running link step : cd /tmp/ltsmin17604568886001345512;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17604568886001345512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16951714148429143667.hoa' '--buchi-type=spotba'
LTSmin run took 146 ms.
FORMULA CO4-PT-18-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-18-LTLCardinality-10 finished in 1701 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) U X(X(p1))))||G(p2)))'
Support contains 6 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 455 transition count 570
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 455 transition count 570
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 446 transition count 561
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 446 transition count 561
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 446 transition count 559
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 441 transition count 554
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 441 transition count 554
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 437 transition count 550
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 437 transition count 550
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 436 transition count 549
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 436 transition count 549
Applied a total of 82 rules in 39 ms. Remains 436 /476 variables (removed 40) and now considering 549/591 (removed 42) transitions.
// Phase 1: matrix 549 rows 436 cols
[2024-06-02 22:54:31] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:54:31] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 22:54:31] [INFO ] Invariant cache hit.
[2024-06-02 22:54:31] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-06-02 22:54:31] [INFO ] Invariant cache hit.
[2024-06-02 22:54:31] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 436/476 places, 549/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 524 ms. Remains : 436/476 places, 549/591 transitions.
Stuttering acceptance computed with spot in 625 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-18-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p2 p0), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 9}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 9}, { cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 10}, { cond=(AND p2 p0), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=9 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 12}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=10 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=10 dest: 13}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=11 dest: 9}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=11 dest: 11}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=11 dest: 12}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=11 dest: 13}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=11 dest: 14}], [{ cond=(NOT p0), acceptance={} source=12 dest: 6}, { cond=p0, acceptance={} source=12 dest: 12}], [{ cond=(NOT p2), acceptance={} source=13 dest: 6}, { cond=p2, acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=14 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=14 dest: 12}, { cond=(AND p2 (NOT p0)), acceptance={} source=14 dest: 13}, { cond=(AND p2 p0), acceptance={} source=14 dest: 14}]], initial=0, aps=[p2:(OR (EQ s192 0) (EQ s435 1)), p0:(OR (EQ s192 0) (EQ s435 1) (EQ s355 0) (EQ s408 1)), p1:(OR (EQ s371 0) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 253 ms.
Product exploration explored 100000 steps with 25000 reset in 242 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 695 edges and 436 vertex of which 431 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p0))), true, (X (X p0)), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 123 ms. Reduced automaton from 15 states, 38 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-06-02 22:54:34] [INFO ] Invariant cache hit.
[2024-06-02 22:54:34] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:8
[2024-06-02 22:54:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:54:35] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :3
[2024-06-02 22:54:35] [INFO ] After 283ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :3
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-06-02 22:54:35] [INFO ] After 491ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :3
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 549/549 transitions.
Graph (trivial) has 460 edges and 436 vertex of which 3 / 436 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 692 edges and 434 vertex of which 422 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 189 transitions
Trivial Post-agglo rules discarded 189 transitions
Performed 189 trivial Post agglomeration. Transition count delta: 189
Iterating post reduction 0 with 202 rules applied. Total rules applied 204 place count 422 transition count 335
Reduce places removed 189 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 191 rules applied. Total rules applied 395 place count 233 transition count 333
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 398 place count 232 transition count 331
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 400 place count 230 transition count 331
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 400 place count 230 transition count 284
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 494 place count 183 transition count 284
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 496 place count 181 transition count 282
Iterating global reduction 4 with 2 rules applied. Total rules applied 498 place count 181 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 499 place count 181 transition count 281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 499 place count 181 transition count 280
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 501 place count 180 transition count 280
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 502 place count 179 transition count 279
Iterating global reduction 5 with 1 rules applied. Total rules applied 503 place count 179 transition count 279
Performed 63 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 629 place count 116 transition count 204
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 635 place count 116 transition count 198
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 642 place count 109 transition count 191
Iterating global reduction 6 with 7 rules applied. Total rules applied 649 place count 109 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 650 place count 109 transition count 190
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 7 with 4 rules applied. Total rules applied 654 place count 107 transition count 188
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 716 place count 76 transition count 190
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 735 place count 76 transition count 171
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 763 place count 48 transition count 115
Iterating global reduction 8 with 28 rules applied. Total rules applied 791 place count 48 transition count 115
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 808 place count 48 transition count 98
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 815 place count 41 transition count 78
Iterating global reduction 9 with 7 rules applied. Total rules applied 822 place count 41 transition count 78
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 827 place count 41 transition count 73
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 829 place count 40 transition count 81
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 832 place count 40 transition count 78
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 842 place count 40 transition count 68
Free-agglomeration rule applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 849 place count 40 transition count 61
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 858 place count 33 transition count 59
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 860 place count 33 transition count 57
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 861 place count 33 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 862 place count 32 transition count 56
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 19 edges and 30 vertex of which 3 / 30 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 12 with 3 rules applied. Total rules applied 865 place count 28 transition count 56
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 870 place count 28 transition count 51
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 871 place count 27 transition count 49
Iterating global reduction 14 with 1 rules applied. Total rules applied 872 place count 27 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 873 place count 27 transition count 48
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 15 with 2 rules applied. Total rules applied 875 place count 26 transition count 47
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 876 place count 26 transition count 46
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 16 with 8 rules applied. Total rules applied 884 place count 26 transition count 38
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 888 place count 22 transition count 34
Iterating global reduction 16 with 4 rules applied. Total rules applied 892 place count 22 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 896 place count 22 transition count 30
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 898 place count 20 transition count 28
Iterating global reduction 17 with 2 rules applied. Total rules applied 900 place count 20 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 902 place count 20 transition count 26
Free-agglomeration rule applied 3 times.
Iterating global reduction 18 with 3 rules applied. Total rules applied 905 place count 20 transition count 23
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 908 place count 17 transition count 23
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 910 place count 17 transition count 23
Applied a total of 910 rules in 31 ms. Remains 17 /436 variables (removed 419) and now considering 23/549 (removed 526) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 17/436 places, 23/549 transitions.
Finished random walk after 17 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p0))), true, (X (X p0)), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p0)))), (G (NOT (AND (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p2) p0 (NOT p1)))), (G p0), (G (NOT (AND p2 (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (G (NOT (AND p2 (NOT p0))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p2) p0)), (F (AND p2 p0 (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (AND p2 p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 18 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLCardinality-11 finished in 4036 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&&X(p1)) U p2)&&(p1 U p3)))))'
Support contains 7 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 458 transition count 573
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 458 transition count 573
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 450 transition count 565
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 450 transition count 565
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 450 transition count 564
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 446 transition count 560
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 446 transition count 560
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 443 transition count 557
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 443 transition count 557
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 442 transition count 556
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 442 transition count 556
Applied a total of 69 rules in 35 ms. Remains 442 /476 variables (removed 34) and now considering 556/591 (removed 35) transitions.
// Phase 1: matrix 556 rows 442 cols
[2024-06-02 22:54:35] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 22:54:35] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 22:54:35] [INFO ] Invariant cache hit.
[2024-06-02 22:54:35] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-06-02 22:54:35] [INFO ] Invariant cache hit.
[2024-06-02 22:54:35] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 442/476 places, 556/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 522 ms. Remains : 442/476 places, 556/591 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p2) (NOT p1)), (NOT p3)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 p3) (AND p2 p1) (AND p0 p3) (AND p0 p1)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p2 (NOT p3) p1) (AND p0 (NOT p3) p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s313 0) (EQ s359 1)), p3:(OR (EQ s79 0) (EQ s381 1)), p1:(OR (EQ s126 0) (EQ s41 1)), p0:(NEQ s407 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 124 ms.
Product exploration explored 100000 steps with 10 reset in 130 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 700 edges and 442 vertex of which 437 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p2 p3 p1 p0), (X (NOT (OR (AND p2 (NOT p3) p1) (AND p0 (NOT p3) p1)))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p1))))), (X (OR (AND p2 p3) (AND p2 p1) (AND p0 p3) (AND p0 p1))), (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1)))), (X (X (NOT (OR (AND p2 (NOT p3) p1) (AND p0 (NOT p3) p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p1)))))), true, (X (X (OR (AND p2 p3) (AND p2 p1) (AND p0 p3) (AND p0 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 127 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p2) (NOT p1)), (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-06-02 22:54:37] [INFO ] Invariant cache hit.
[2024-06-02 22:54:37] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-02 22:54:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:54:37] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2024-06-02 22:54:37] [INFO ] After 465ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 129 ms.
[2024-06-02 22:54:37] [INFO ] After 739ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 101 steps, including 2 resets, run visited all 2 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 5 properties in 10 ms.
Support contains 4 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 556/556 transitions.
Graph (trivial) has 470 edges and 442 vertex of which 3 / 442 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 697 edges and 440 vertex of which 425 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 210 rules applied. Total rules applied 212 place count 425 transition count 332
Reduce places removed 193 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 195 rules applied. Total rules applied 407 place count 232 transition count 330
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 410 place count 231 transition count 328
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 412 place count 229 transition count 328
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 412 place count 229 transition count 281
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 506 place count 182 transition count 281
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 507 place count 181 transition count 280
Iterating global reduction 4 with 1 rules applied. Total rules applied 508 place count 181 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 509 place count 181 transition count 279
Performed 66 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 641 place count 115 transition count 198
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 648 place count 115 transition count 191
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 655 place count 108 transition count 184
Iterating global reduction 6 with 7 rules applied. Total rules applied 662 place count 108 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 663 place count 108 transition count 183
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 669 place count 105 transition count 180
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 673 place count 105 transition count 176
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 677 place count 101 transition count 172
Iterating global reduction 8 with 4 rules applied. Total rules applied 681 place count 101 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 682 place count 101 transition count 171
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 9 with 6 rules applied. Total rules applied 688 place count 98 transition count 168
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 691 place count 98 transition count 165
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 694 place count 95 transition count 162
Iterating global reduction 10 with 3 rules applied. Total rules applied 697 place count 95 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 699 place count 95 transition count 160
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 700 place count 94 transition count 159
Iterating global reduction 11 with 1 rules applied. Total rules applied 701 place count 94 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 702 place count 94 transition count 158
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 12 with 56 rules applied. Total rules applied 758 place count 66 transition count 160
Drop transitions removed 16 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 12 with 33 rules applied. Total rules applied 791 place count 66 transition count 127
Discarding 24 places :
Symmetric choice reduction at 13 with 24 rule applications. Total rules 815 place count 42 transition count 92
Iterating global reduction 13 with 24 rules applied. Total rules applied 839 place count 42 transition count 92
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 13 with 16 rules applied. Total rules applied 855 place count 42 transition count 76
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 859 place count 38 transition count 65
Iterating global reduction 14 with 4 rules applied. Total rules applied 863 place count 38 transition count 65
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 866 place count 38 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 868 place count 37 transition count 69
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 871 place count 37 transition count 66
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 16 with 9 rules applied. Total rules applied 880 place count 37 transition count 57
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 881 place count 36 transition count 56
Iterating global reduction 16 with 1 rules applied. Total rules applied 882 place count 36 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 883 place count 36 transition count 55
Free-agglomeration rule applied 5 times.
Iterating global reduction 17 with 5 rules applied. Total rules applied 888 place count 36 transition count 50
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 894 place count 31 transition count 49
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 895 place count 31 transition count 49
Graph (complete) has 82 edges and 31 vertex of which 30 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 18 with 1 rules applied. Total rules applied 896 place count 30 transition count 49
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 897 place count 30 transition count 48
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 898 place count 30 transition count 48
Graph (complete) has 79 edges and 30 vertex of which 29 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 20 with 1 rules applied. Total rules applied 899 place count 29 transition count 48
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 900 place count 29 transition count 47
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 901 place count 29 transition count 47
Graph (complete) has 76 edges and 29 vertex of which 28 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 22 with 1 rules applied. Total rules applied 902 place count 28 transition count 47
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 903 place count 28 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 24 with 1 rules applied. Total rules applied 904 place count 27 transition count 45
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t68.t72.t522.t561 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 23 vertex of which 3 / 23 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 24 with 3 rules applied. Total rules applied 907 place count 21 transition count 43
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t65.t508.t44.t45.t46.t47.t48.t49.t50.t51.t61.t30.t561.t168.t169.t170.t574.t13.t173 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 14 edges and 19 vertex of which 3 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 25 with 9 rules applied. Total rules applied 916 place count 17 transition count 35
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 27 edges and 16 vertex of which 15 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 26 with 13 rules applied. Total rules applied 929 place count 15 transition count 24
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 930 place count 14 transition count 23
Iterating global reduction 27 with 1 rules applied. Total rules applied 931 place count 14 transition count 23
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 932 place count 13 transition count 22
Iterating global reduction 27 with 1 rules applied. Total rules applied 933 place count 13 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 934 place count 13 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 28 with 2 rules applied. Total rules applied 936 place count 13 transition count 19
Free-agglomeration rule applied 5 times.
Iterating global reduction 28 with 5 rules applied. Total rules applied 941 place count 13 transition count 14
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 28 with 5 rules applied. Total rules applied 946 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 29 with 1 rules applied. Total rules applied 947 place count 8 transition count 13
Free-agglomeration rule applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 948 place count 8 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 949 place count 7 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 30 with 1 rules applied. Total rules applied 950 place count 7 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 30 with 1 rules applied. Total rules applied 951 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 953 place count 6 transition count 9
Applied a total of 953 rules in 40 ms. Remains 6 /442 variables (removed 436) and now considering 9/556 (removed 547) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 6/442 places, 9/556 transitions.
Finished random walk after 6674 steps, including 2 resets, run visited all 1 properties in 8 ms. (steps per millisecond=834 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p3 p1 p0), (X (NOT (OR (AND p2 (NOT p3) p1) (AND p0 (NOT p3) p1)))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p1))))), (X (OR (AND p2 p3) (AND p2 p1) (AND p0 p3) (AND p0 p1))), (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1)))), (X (X (NOT (OR (AND p2 (NOT p3) p1) (AND p0 (NOT p3) p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p1)))))), true, (X (X (OR (AND p2 p3) (AND p2 p1) (AND p0 p3) (AND p0 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (NOT p1)))))]
False Knowledge obtained : [(F (OR (AND (NOT p2) (NOT p0)) (NOT p1))), (F (OR (AND p2 (NOT p3) p1) (AND (NOT p3) p1 p0))), (F (AND (NOT p3) (NOT p1))), (F (AND (NOT p2) p1 p0)), (F (NOT (OR (AND p2 p3) (AND p2 p1) (AND p3 p0) (AND p1 p0)))), (F (OR (AND (NOT p2) p3 p0) (AND (NOT p2) p1 p0))), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p1)))), (F (AND (NOT p3) p1))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p3) (NOT p1)))
Knowledge based reduction with 14 factoid took 225 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLCardinality-12 finished in 2925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(p1))))'
Support contains 3 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 456 transition count 571
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 456 transition count 571
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 446 transition count 561
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 446 transition count 561
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 446 transition count 559
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 441 transition count 554
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 441 transition count 554
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 437 transition count 550
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 437 transition count 550
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 436 transition count 549
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 436 transition count 549
Applied a total of 82 rules in 38 ms. Remains 436 /476 variables (removed 40) and now considering 549/591 (removed 42) transitions.
// Phase 1: matrix 549 rows 436 cols
[2024-06-02 22:54:38] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 22:54:38] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 22:54:38] [INFO ] Invariant cache hit.
[2024-06-02 22:54:38] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-06-02 22:54:38] [INFO ] Invariant cache hit.
[2024-06-02 22:54:38] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 436/476 places, 549/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 496 ms. Remains : 436/476 places, 549/591 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : CO4-PT-18-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s349 1), p1:(OR (EQ s390 0) (EQ s216 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33399 reset in 262 ms.
Product exploration explored 100000 steps with 33233 reset in 273 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 693 edges and 436 vertex of which 431 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 95 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 26 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 22:54:39] [INFO ] Invariant cache hit.
[2024-06-02 22:54:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:54:39] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:54:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:54:40] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-06-02 22:54:40] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-06-02 22:54:40] [INFO ] After 266ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 28 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 172 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 549/549 transitions.
Applied a total of 0 rules in 5 ms. Remains 436 /436 variables (removed 0) and now considering 549/549 (removed 0) transitions.
[2024-06-02 22:54:40] [INFO ] Invariant cache hit.
[2024-06-02 22:54:40] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 22:54:40] [INFO ] Invariant cache hit.
[2024-06-02 22:54:40] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2024-06-02 22:54:40] [INFO ] Invariant cache hit.
[2024-06-02 22:54:41] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 459 ms. Remains : 436/436 places, 549/549 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 693 edges and 436 vertex of which 431 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (AND (NOT p0) p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 81 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 22:54:41] [INFO ] Invariant cache hit.
[2024-06-02 22:54:41] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-06-02 22:54:41] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:54:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:54:41] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 22:54:42] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-06-02 22:54:42] [INFO ] After 340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 28 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=14 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (AND (NOT p0) p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 201 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5 reset in 80 ms.
Product exploration explored 100000 steps with 2 reset in 81 ms.
Built C files in :
/tmp/ltsmin10355093835979499467
[2024-06-02 22:54:42] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10355093835979499467
Running compilation step : cd /tmp/ltsmin10355093835979499467;'/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 700 ms.
Running link step : cd /tmp/ltsmin10355093835979499467;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10355093835979499467;'/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/stateBased14852201420628156277.hoa' '--buchi-type=spotba'
LTSmin run took 645 ms.
FORMULA CO4-PT-18-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-18-LTLCardinality-13 finished in 6056 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 X(p1))||X((p1 U p2))))'
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 456 transition count 571
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 456 transition count 571
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 448 transition count 563
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 448 transition count 563
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 448 transition count 561
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 445 transition count 558
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 445 transition count 558
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 442 transition count 555
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 442 transition count 555
Applied a total of 70 rules in 32 ms. Remains 442 /476 variables (removed 34) and now considering 555/591 (removed 36) transitions.
// Phase 1: matrix 555 rows 442 cols
[2024-06-02 22:54:44] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 22:54:44] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 22:54:44] [INFO ] Invariant cache hit.
[2024-06-02 22:54:44] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-06-02 22:54:44] [INFO ] Invariant cache hit.
[2024-06-02 22:54:44] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 442/476 places, 555/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 442/476 places, 555/591 transitions.
Stuttering acceptance computed with spot in 202 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}]], initial=1, aps=[p0:(OR (EQ s417 0) (EQ s352 1)), p1:(EQ s95 1), p2:(AND (OR (EQ s417 0) (EQ s352 1) (EQ s95 1)) (NEQ s208 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 351 ms.
Product exploration explored 100000 steps with 50000 reset in 362 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 699 edges and 442 vertex of which 437 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 16 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLCardinality-14 finished in 1457 ms.
All properties solved by simple procedures.
Total runtime 57279 ms.

BK_STOP 1717368886791

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-18"
export BK_EXAMINATION="LTLCardinality"
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-18, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r571-tall-171734910200087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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