About the Execution of 2023-gold for CO4-PT-19
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
516.207 | 14512.00 | 28873.00 | 287.00 | FTFFFFTFFTTTFFTT | 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-171734910200092.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CO4-PT-19, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910200092
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 332K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CO4-PT-19-LTLCardinality-00
FORMULA_NAME CO4-PT-19-LTLCardinality-01
FORMULA_NAME CO4-PT-19-LTLCardinality-02
FORMULA_NAME CO4-PT-19-LTLCardinality-03
FORMULA_NAME CO4-PT-19-LTLCardinality-04
FORMULA_NAME CO4-PT-19-LTLCardinality-05
FORMULA_NAME CO4-PT-19-LTLCardinality-06
FORMULA_NAME CO4-PT-19-LTLCardinality-07
FORMULA_NAME CO4-PT-19-LTLCardinality-08
FORMULA_NAME CO4-PT-19-LTLCardinality-09
FORMULA_NAME CO4-PT-19-LTLCardinality-10
FORMULA_NAME CO4-PT-19-LTLCardinality-11
FORMULA_NAME CO4-PT-19-LTLCardinality-12
FORMULA_NAME CO4-PT-19-LTLCardinality-13
FORMULA_NAME CO4-PT-19-LTLCardinality-14
FORMULA_NAME CO4-PT-19-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717368895540
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-19
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:54:57] [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:54:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:54:57] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-06-02 22:54:57] [INFO ] Transformed 1174 places.
[2024-06-02 22:54:57] [INFO ] Transformed 1447 transitions.
[2024-06-02 22:54:57] [INFO ] Found NUPN structural information;
[2024-06-02 22:54:57] [INFO ] Parsed PT model containing 1174 places and 1447 transitions and 3662 arcs in 203 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 201 places in 16 ms
Reduce places removed 201 places and 274 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA CO4-PT-19-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 973 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 973/973 places, 1173/1173 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 948 transition count 1165
Discarding 164 places :
Symmetric choice reduction at 1 with 164 rule applications. Total rules 197 place count 784 transition count 999
Iterating global reduction 1 with 164 rules applied. Total rules applied 361 place count 784 transition count 999
Discarding 144 places :
Symmetric choice reduction at 1 with 144 rule applications. Total rules 505 place count 640 transition count 851
Iterating global reduction 1 with 144 rules applied. Total rules applied 649 place count 640 transition count 851
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 657 place count 640 transition count 843
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 725 place count 572 transition count 769
Iterating global reduction 2 with 68 rules applied. Total rules applied 793 place count 572 transition count 769
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 796 place count 572 transition count 766
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 840 place count 528 transition count 722
Iterating global reduction 3 with 44 rules applied. Total rules applied 884 place count 528 transition count 722
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 892 place count 528 transition count 714
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 911 place count 509 transition count 695
Iterating global reduction 4 with 19 rules applied. Total rules applied 930 place count 509 transition count 695
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 932 place count 509 transition count 693
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 938 place count 503 transition count 687
Iterating global reduction 5 with 6 rules applied. Total rules applied 944 place count 503 transition count 687
Applied a total of 944 rules in 254 ms. Remains 503 /973 variables (removed 470) and now considering 687/1173 (removed 486) transitions.
// Phase 1: matrix 687 rows 503 cols
[2024-06-02 22:54:58] [INFO ] Computed 7 invariants in 26 ms
[2024-06-02 22:54:58] [INFO ] Implicit Places using invariants in 302 ms returned [6, 439]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 329 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 501/973 places, 687/1173 transitions.
Applied a total of 0 rules in 16 ms. Remains 501 /501 variables (removed 0) and now considering 687/687 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 602 ms. Remains : 501/973 places, 687/1173 transitions.
Support contains 10 out of 501 places after structural reductions.
[2024-06-02 22:54:58] [INFO ] Flatten gal took : 70 ms
[2024-06-02 22:54:58] [INFO ] Flatten gal took : 34 ms
[2024-06-02 22:54:58] [INFO ] Input system was already deterministic with 687 transitions.
Incomplete random walk after 10000 steps, including 209 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 687 rows 501 cols
[2024-06-02 22:54:59] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 22:54:59] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:54:59] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 22:54:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 22:54:59] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 22:54:59] [INFO ] After 472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 110 ms.
[2024-06-02 22:55:00] [INFO ] After 715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 10 ms.
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 687/687 transitions.
Graph (trivial) has 540 edges and 501 vertex of which 3 / 501 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 973 edges and 499 vertex of which 482 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 482 transition count 427
Reduce places removed 222 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 224 rules applied. Total rules applied 469 place count 260 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 470 place count 259 transition count 425
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 470 place count 259 transition count 377
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 566 place count 211 transition count 377
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 571 place count 206 transition count 372
Iterating global reduction 3 with 5 rules applied. Total rules applied 576 place count 206 transition count 372
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 579 place count 206 transition count 369
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 579 place count 206 transition count 368
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 581 place count 205 transition count 368
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 582 place count 204 transition count 367
Iterating global reduction 4 with 1 rules applied. Total rules applied 583 place count 204 transition count 367
Performed 77 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 737 place count 127 transition count 267
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 748 place count 127 transition count 256
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 756 place count 119 transition count 243
Iterating global reduction 5 with 8 rules applied. Total rules applied 764 place count 119 transition count 243
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 770 place count 116 transition count 240
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 771 place count 116 transition count 239
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 772 place count 115 transition count 237
Iterating global reduction 6 with 1 rules applied. Total rules applied 773 place count 115 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 774 place count 115 transition count 236
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 7 with 76 rules applied. Total rules applied 850 place count 77 transition count 276
Drop transitions removed 38 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 7 with 57 rules applied. Total rules applied 907 place count 77 transition count 219
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 934 place count 50 transition count 138
Iterating global reduction 8 with 27 rules applied. Total rules applied 961 place count 50 transition count 138
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 979 place count 50 transition count 120
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 986 place count 43 transition count 88
Iterating global reduction 9 with 7 rules applied. Total rules applied 993 place count 43 transition count 88
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 998 place count 43 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 1000 place count 42 transition count 92
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1003 place count 42 transition count 89
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 11 with 11 rules applied. Total rules applied 1014 place count 42 transition count 78
Free-agglomeration rule applied 9 times.
Iterating global reduction 11 with 9 rules applied. Total rules applied 1023 place count 42 transition count 69
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1035 place count 33 transition count 66
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 1038 place count 33 transition count 66
Graph (complete) has 120 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 1 rules applied. Total rules applied 1039 place count 32 transition count 66
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 1042 place count 32 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1043 place count 31 transition count 62
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t371.t375.t560.t593 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 27 vertex of which 3 / 27 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 14 with 5 rules applied. Total rules applied 1048 place count 25 transition count 58
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 27 edges and 20 vertex of which 13 / 20 are part of one of the 2 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 15 with 13 rules applied. Total rules applied 1061 place count 9 transition count 51
Drop transitions removed 22 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 16 with 40 rules applied. Total rules applied 1101 place count 9 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 1103 place count 8 transition count 11
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 1105 place count 8 transition count 9
Applied a total of 1105 rules in 91 ms. Remains 8 /501 variables (removed 493) and now considering 9/687 (removed 678) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 8/501 places, 9/687 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 18 stabilizing places and 21 stable transitions
Graph (complete) has 976 edges and 501 vertex of which 496 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.12 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 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 687/687 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 496 transition count 682
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 496 transition count 682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 496 transition count 681
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 493 transition count 678
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 493 transition count 678
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 490 transition count 675
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 490 transition count 675
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 490 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 489 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 489 transition count 673
Applied a total of 26 rules in 73 ms. Remains 489 /501 variables (removed 12) and now considering 673/687 (removed 14) transitions.
// Phase 1: matrix 673 rows 489 cols
[2024-06-02 22:55:00] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 22:55:00] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-02 22:55:00] [INFO ] Invariant cache hit.
[2024-06-02 22:55:00] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2024-06-02 22:55:00] [INFO ] Invariant cache hit.
[2024-06-02 22:55:01] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 489/501 places, 673/687 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 796 ms. Remains : 489/501 places, 673/687 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 216 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-19-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s212 0) (EQ s176 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CO4-PT-19-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLCardinality-00 finished in 1064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 687/687 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 496 transition count 682
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 496 transition count 682
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 494 transition count 680
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 494 transition count 680
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 492 transition count 678
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 492 transition count 678
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 490 transition count 676
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 490 transition count 676
Applied a total of 22 rules in 72 ms. Remains 490 /501 variables (removed 11) and now considering 676/687 (removed 11) transitions.
// Phase 1: matrix 676 rows 490 cols
[2024-06-02 22:55:01] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 22:55:01] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-02 22:55:01] [INFO ] Invariant cache hit.
[2024-06-02 22:55:01] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-06-02 22:55:01] [INFO ] Invariant cache hit.
[2024-06-02 22:55:02] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 490/501 places, 676/687 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 709 ms. Remains : 490/501 places, 676/687 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CO4-PT-19-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (EQ s433 0) (EQ s201 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 342 ms.
Product exploration explored 100000 steps with 33333 reset in 284 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 965 edges and 490 vertex of which 485 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 22 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-19-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-19-LTLCardinality-09 finished in 1509 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 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 687/687 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 494 transition count 680
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 494 transition count 680
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 494 transition count 679
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 491 transition count 676
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 491 transition count 676
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 488 transition count 673
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 488 transition count 673
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 488 transition count 672
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 486 transition count 670
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 486 transition count 670
Applied a total of 32 rules in 40 ms. Remains 486 /501 variables (removed 15) and now considering 670/687 (removed 17) transitions.
// Phase 1: matrix 670 rows 486 cols
[2024-06-02 22:55:02] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 22:55:03] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-02 22:55:03] [INFO ] Invariant cache hit.
[2024-06-02 22:55:03] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2024-06-02 22:55:03] [INFO ] Invariant cache hit.
[2024-06-02 22:55:03] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 486/501 places, 670/687 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 689 ms. Remains : 486/501 places, 670/687 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-19-LTLCardinality-11 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 s383 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 241 ms.
Product exploration explored 100000 steps with 33333 reset in 230 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 959 edges and 486 vertex of which 481 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 32 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-19-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-19-LTLCardinality-11 finished in 1349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 687/687 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 495 transition count 681
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 495 transition count 681
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 495 transition count 680
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 492 transition count 677
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 492 transition count 677
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 489 transition count 674
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 489 transition count 674
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 489 transition count 673
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 487 transition count 671
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 487 transition count 671
Applied a total of 30 rules in 44 ms. Remains 487 /501 variables (removed 14) and now considering 671/687 (removed 16) transitions.
// Phase 1: matrix 671 rows 487 cols
[2024-06-02 22:55:04] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 22:55:04] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 22:55:04] [INFO ] Invariant cache hit.
[2024-06-02 22:55:04] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2024-06-02 22:55:04] [INFO ] Invariant cache hit.
[2024-06-02 22:55:04] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 487/501 places, 671/687 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 712 ms. Remains : 487/501 places, 671/687 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CO4-PT-19-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(NEQ s428 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CO4-PT-19-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLCardinality-12 finished in 861 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((G(F(!p0)) U p1))))'
Support contains 4 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 687/687 transitions.
Graph (trivial) has 536 edges and 501 vertex of which 3 / 501 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 974 edges and 499 vertex of which 494 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 212 place count 493 transition count 468
Reduce places removed 210 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 283 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 425 place count 282 transition count 466
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 425 place count 282 transition count 417
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 523 place count 233 transition count 417
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 524 place count 232 transition count 416
Iterating global reduction 3 with 1 rules applied. Total rules applied 525 place count 232 transition count 416
Performed 86 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 697 place count 146 transition count 303
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 709 place count 146 transition count 291
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 717 place count 138 transition count 278
Iterating global reduction 4 with 8 rules applied. Total rules applied 725 place count 138 transition count 278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 727 place count 137 transition count 277
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 728 place count 136 transition count 275
Iterating global reduction 4 with 1 rules applied. Total rules applied 729 place count 136 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 730 place count 136 transition count 274
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 808 place count 97 transition count 316
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 827 place count 97 transition count 297
Discarding 25 places :
Symmetric choice reduction at 6 with 25 rule applications. Total rules 852 place count 72 transition count 197
Iterating global reduction 6 with 25 rules applied. Total rules applied 877 place count 72 transition count 197
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 894 place count 72 transition count 180
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 899 place count 67 transition count 154
Iterating global reduction 7 with 5 rules applied. Total rules applied 904 place count 67 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 908 place count 67 transition count 150
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 912 place count 65 transition count 174
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 8 with 38 rules applied. Total rules applied 950 place count 65 transition count 136
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 952 place count 63 transition count 134
Applied a total of 952 rules in 86 ms. Remains 63 /501 variables (removed 438) and now considering 134/687 (removed 553) transitions.
[2024-06-02 22:55:05] [INFO ] Flow matrix only has 109 transitions (discarded 25 similar events)
// Phase 1: matrix 109 rows 63 cols
[2024-06-02 22:55:05] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:55:05] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 22:55:05] [INFO ] Flow matrix only has 109 transitions (discarded 25 similar events)
[2024-06-02 22:55:05] [INFO ] Invariant cache hit.
[2024-06-02 22:55:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:55:05] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-06-02 22:55:05] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:55:05] [INFO ] Flow matrix only has 109 transitions (discarded 25 similar events)
[2024-06-02 22:55:05] [INFO ] Invariant cache hit.
[2024-06-02 22:55:05] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/501 places, 134/687 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 261 ms. Remains : 63/501 places, 134/687 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : CO4-PT-19-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s36 0) (EQ s5 1)), p0:(OR (EQ s16 0) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 288 reset in 92 ms.
Product exploration explored 100000 steps with 130 reset in 80 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p1), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 103 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Finished random walk after 1154 steps, including 91 resets, run visited all 3 properties in 29 ms. (steps per millisecond=39 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p1), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 188 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-06-02 22:55:06] [INFO ] Flow matrix only has 109 transitions (discarded 25 similar events)
[2024-06-02 22:55:06] [INFO ] Invariant cache hit.
[2024-06-02 22:55:06] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 22:55:06] [INFO ] Flow matrix only has 109 transitions (discarded 25 similar events)
[2024-06-02 22:55:06] [INFO ] Invariant cache hit.
[2024-06-02 22:55:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:55:06] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-06-02 22:55:06] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:55:06] [INFO ] Flow matrix only has 109 transitions (discarded 25 similar events)
[2024-06-02 22:55:06] [INFO ] Invariant cache hit.
[2024-06-02 22:55:06] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 63/63 places, 134/134 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 95 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Finished random walk after 350 steps, including 29 resets, run visited all 3 properties in 15 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 176 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 163 reset in 52 ms.
Product exploration explored 100000 steps with 18 reset in 67 ms.
Built C files in :
/tmp/ltsmin12543965434015197304
[2024-06-02 22:55:07] [INFO ] Computing symmetric may disable matrix : 134 transitions.
[2024-06-02 22:55:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:55:07] [INFO ] Computing symmetric may enable matrix : 134 transitions.
[2024-06-02 22:55:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:55:07] [INFO ] Computing Do-Not-Accords matrix : 134 transitions.
[2024-06-02 22:55:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:55:07] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12543965434015197304
Running compilation step : cd /tmp/ltsmin12543965434015197304;'/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 355 ms.
Running link step : cd /tmp/ltsmin12543965434015197304;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin12543965434015197304;'/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/stateBased5843079406304445300.hoa' '--buchi-type=spotba'
LTSmin run took 765 ms.
FORMULA CO4-PT-19-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-19-LTLCardinality-13 finished in 4003 ms.
All properties solved by simple procedures.
Total runtime 11728 ms.
BK_STOP 1717368910052
--------------------
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-19"
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-19, 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-171734910200092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-19.tgz
mv CO4-PT-19 execution
cd execution
if [ "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 '
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 ;