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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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 174K 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-14-LTLCardinality-00
FORMULA_NAME CO4-PT-14-LTLCardinality-01
FORMULA_NAME CO4-PT-14-LTLCardinality-02
FORMULA_NAME CO4-PT-14-LTLCardinality-03
FORMULA_NAME CO4-PT-14-LTLCardinality-04
FORMULA_NAME CO4-PT-14-LTLCardinality-05
FORMULA_NAME CO4-PT-14-LTLCardinality-06
FORMULA_NAME CO4-PT-14-LTLCardinality-07
FORMULA_NAME CO4-PT-14-LTLCardinality-08
FORMULA_NAME CO4-PT-14-LTLCardinality-09
FORMULA_NAME CO4-PT-14-LTLCardinality-10
FORMULA_NAME CO4-PT-14-LTLCardinality-11
FORMULA_NAME CO4-PT-14-LTLCardinality-12
FORMULA_NAME CO4-PT-14-LTLCardinality-13
FORMULA_NAME CO4-PT-14-LTLCardinality-14
FORMULA_NAME CO4-PT-14-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717368728072

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-14
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:52:09] [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:52:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:52:09] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-02 22:52:09] [INFO ] Transformed 680 places.
[2024-06-02 22:52:09] [INFO ] Transformed 812 transitions.
[2024-06-02 22:52:09] [INFO ] Found NUPN structural information;
[2024-06-02 22:52:09] [INFO ] Parsed PT model containing 680 places and 812 transitions and 1822 arcs in 137 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 100 places in 8 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-14-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-14-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 692/692 transitions.
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 569 transition count 691
Discarding 117 places :
Symmetric choice reduction at 1 with 117 rule applications. Total rules 129 place count 452 transition count 574
Iterating global reduction 1 with 117 rules applied. Total rules applied 246 place count 452 transition count 574
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 251 place count 452 transition count 569
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 311 place count 392 transition count 509
Iterating global reduction 2 with 60 rules applied. Total rules applied 371 place count 392 transition count 509
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 381 place count 382 transition count 498
Iterating global reduction 2 with 10 rules applied. Total rules applied 391 place count 382 transition count 498
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 393 place count 382 transition count 496
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 394 place count 381 transition count 495
Iterating global reduction 3 with 1 rules applied. Total rules applied 395 place count 381 transition count 495
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 396 place count 380 transition count 494
Iterating global reduction 3 with 1 rules applied. Total rules applied 397 place count 380 transition count 494
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 398 place count 380 transition count 493
Applied a total of 398 rules in 126 ms. Remains 380 /580 variables (removed 200) and now considering 493/692 (removed 199) transitions.
// Phase 1: matrix 493 rows 380 cols
[2024-06-02 22:52:10] [INFO ] Computed 5 invariants in 22 ms
[2024-06-02 22:52:10] [INFO ] Implicit Places using invariants in 237 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 262 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 379/580 places, 493/692 transitions.
Applied a total of 0 rules in 9 ms. Remains 379 /379 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 397 ms. Remains : 379/580 places, 493/692 transitions.
Support contains 30 out of 379 places after structural reductions.
[2024-06-02 22:52:10] [INFO ] Flatten gal took : 53 ms
[2024-06-02 22:52:10] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:52:10] [INFO ] Input system was already deterministic with 493 transitions.
Support contains 27 out of 379 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 493 rows 379 cols
[2024-06-02 22:52:13] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 22:52:13] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-02 22:52:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:52:13] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-06-02 22:52:13] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 4 ms to minimize.
[2024-06-02 22:52:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-06-02 22:52:14] [INFO ] After 628ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 134 ms.
[2024-06-02 22:52:14] [INFO ] After 939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 5 properties in 36 ms.
Support contains 4 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 493/493 transitions.
Graph (trivial) has 405 edges and 379 vertex of which 2 / 379 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 638 edges and 378 vertex of which 360 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 147 rules applied. Total rules applied 149 place count 360 transition count 329
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 134 rules applied. Total rules applied 283 place count 228 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 284 place count 227 transition count 327
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 284 place count 227 transition count 285
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 368 place count 185 transition count 285
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 376 place count 177 transition count 276
Iterating global reduction 3 with 8 rules applied. Total rules applied 384 place count 177 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 387 place count 177 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 388 place count 176 transition count 273
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 388 place count 176 transition count 271
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 392 place count 174 transition count 271
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 396 place count 170 transition count 267
Iterating global reduction 5 with 4 rules applied. Total rules applied 400 place count 170 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 401 place count 170 transition count 266
Performed 59 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 6 with 118 rules applied. Total rules applied 519 place count 111 transition count 193
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 524 place count 111 transition count 188
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 528 place count 107 transition count 184
Iterating global reduction 7 with 4 rules applied. Total rules applied 532 place count 107 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 533 place count 107 transition count 183
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 8 with 2 rules applied. Total rules applied 535 place count 106 transition count 182
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 8 with 64 rules applied. Total rules applied 599 place count 74 transition count 184
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 618 place count 74 transition count 165
Discarding 28 places :
Symmetric choice reduction at 9 with 28 rule applications. Total rules 646 place count 46 transition count 109
Iterating global reduction 9 with 28 rules applied. Total rules applied 674 place count 46 transition count 109
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 690 place count 46 transition count 93
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 697 place count 39 transition count 73
Iterating global reduction 10 with 7 rules applied. Total rules applied 704 place count 39 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 708 place count 39 transition count 69
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 713 place count 39 transition count 64
Free-agglomeration rule applied 8 times.
Iterating global reduction 11 with 8 rules applied. Total rules applied 721 place count 39 transition count 56
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 730 place count 31 transition count 55
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 733 place count 31 transition count 52
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 735 place count 31 transition count 52
Graph (complete) has 96 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 12 with 1 rules applied. Total rules applied 736 place count 30 transition count 52
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 737 place count 30 transition count 51
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 738 place count 30 transition count 51
Graph (complete) has 93 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 14 with 1 rules applied. Total rules applied 739 place count 29 transition count 51
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 740 place count 29 transition count 50
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 741 place count 29 transition count 50
Graph (complete) has 90 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 16 with 1 rules applied. Total rules applied 742 place count 28 transition count 50
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 743 place count 28 transition count 49
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 745 place count 28 transition count 49
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 746 place count 28 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 747 place count 27 transition count 47
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t57.t437.t54 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 23 vertex of which 2 / 23 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 19 with 3 rules applied. Total rules applied 750 place count 22 transition count 45
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 752 place count 22 transition count 43
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 753 place count 21 transition count 41
Iterating global reduction 21 with 1 rules applied. Total rules applied 754 place count 21 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 755 place count 21 transition count 40
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 22 with 8 rules applied. Total rules applied 763 place count 21 transition count 32
Discarding 4 places :
Symmetric choice reduction at 22 with 4 rule applications. Total rules 767 place count 17 transition count 28
Iterating global reduction 22 with 4 rules applied. Total rules applied 771 place count 17 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 775 place count 17 transition count 24
Discarding 2 places :
Symmetric choice reduction at 23 with 2 rule applications. Total rules 777 place count 15 transition count 22
Iterating global reduction 23 with 2 rules applied. Total rules applied 779 place count 15 transition count 22
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 781 place count 15 transition count 20
Free-agglomeration rule applied 3 times.
Iterating global reduction 24 with 3 rules applied. Total rules applied 784 place count 15 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 24 with 3 rules applied. Total rules applied 787 place count 12 transition count 17
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 25 with 2 rules applied. Total rules applied 789 place count 12 transition count 17
Applied a total of 789 rules in 95 ms. Remains 12 /379 variables (removed 367) and now considering 17/493 (removed 476) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 12/379 places, 17/493 transitions.
Finished random walk after 18 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CO4-PT-14-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 640 edges and 379 vertex of which 376 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&X(X(G(p0)))))'
Support contains 3 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 493/493 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 363 transition count 473
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 363 transition count 473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 363 transition count 472
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 40 place count 356 transition count 465
Iterating global reduction 1 with 7 rules applied. Total rules applied 47 place count 356 transition count 465
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 356 transition count 464
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 355 transition count 463
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 355 transition count 463
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 355 transition count 462
Applied a total of 51 rules in 32 ms. Remains 355 /379 variables (removed 24) and now considering 462/493 (removed 31) transitions.
// Phase 1: matrix 462 rows 355 cols
[2024-06-02 22:52:14] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:52:14] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 22:52:14] [INFO ] Invariant cache hit.
[2024-06-02 22:52:14] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-06-02 22:52:14] [INFO ] Invariant cache hit.
[2024-06-02 22:52:15] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 355/379 places, 462/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 502 ms. Remains : 355/379 places, 462/493 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 318 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(EQ s315 1), p0:(OR (EQ s121 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 171 ms.
Product exploration explored 100000 steps with 12 reset in 127 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 601 edges and 355 vertex of which 352 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Detected a total of 14/355 stabilizing places and 17/462 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 133 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:52:16] [INFO ] Invariant cache hit.
[2024-06-02 22:52:16] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:52:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:52:16] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:52:16] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-06-02 22:52:16] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 36 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND p1 p0))]
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
[2024-06-02 22:52:16] [INFO ] Invariant cache hit.
[2024-06-02 22:52:17] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:52:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:17] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-06-02 22:52:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:52:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:17] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-06-02 22:52:17] [INFO ] Computed and/alt/rep : 449/607/449 causal constraints (skipped 12 transitions) in 30 ms.
[2024-06-02 22:52:18] [INFO ] Added : 229 causal constraints over 46 iterations in 1242 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 462/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 355 /355 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2024-06-02 22:52:18] [INFO ] Invariant cache hit.
[2024-06-02 22:52:18] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 22:52:18] [INFO ] Invariant cache hit.
[2024-06-02 22:52:18] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2024-06-02 22:52:18] [INFO ] Invariant cache hit.
[2024-06-02 22:52:19] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 396 ms. Remains : 355/355 places, 462/462 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 601 edges and 355 vertex of which 352 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Detected a total of 14/355 stabilizing places and 17/462 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 26 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:52:19] [INFO ] Invariant cache hit.
[2024-06-02 22:52:19] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:52:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:52:19] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:52:19] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-06-02 22:52:19] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND p1 p0))]
Knowledge based reduction with 5 factoid took 176 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
[2024-06-02 22:52:20] [INFO ] Invariant cache hit.
[2024-06-02 22:52:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:20] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-06-02 22:52:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:52:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:20] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-06-02 22:52:20] [INFO ] Computed and/alt/rep : 449/607/449 causal constraints (skipped 12 transitions) in 26 ms.
[2024-06-02 22:52:21] [INFO ] Added : 229 causal constraints over 46 iterations in 1192 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 321 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Entered a terminal (fully accepting) state of product in 149 steps with 4 reset in 1 ms.
FORMULA CO4-PT-14-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLCardinality-02 finished in 7702 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(((p1 U p2)&&p0)))'
Support contains 6 out of 379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 379/379 places, 493/493 transitions.
Graph (trivial) has 401 edges and 379 vertex of which 2 / 379 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 639 edges and 378 vertex of which 375 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 133 place count 374 transition count 357
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 134 rules applied. Total rules applied 267 place count 243 transition count 354
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 269 place count 241 transition count 354
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 269 place count 241 transition count 312
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 353 place count 199 transition count 312
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 360 place count 192 transition count 302
Iterating global reduction 3 with 7 rules applied. Total rules applied 367 place count 192 transition count 302
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 369 place count 192 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 369 place count 192 transition count 299
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 371 place count 191 transition count 299
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 373 place count 189 transition count 297
Iterating global reduction 4 with 2 rules applied. Total rules applied 375 place count 189 transition count 297
Performed 62 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 499 place count 127 transition count 222
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 505 place count 127 transition count 216
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 509 place count 123 transition count 212
Iterating global reduction 5 with 4 rules applied. Total rules applied 513 place count 123 transition count 212
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 5 with 2 rules applied. Total rules applied 515 place count 122 transition count 211
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 583 place count 88 transition count 215
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 603 place count 88 transition count 195
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 631 place count 60 transition count 139
Iterating global reduction 6 with 28 rules applied. Total rules applied 659 place count 60 transition count 139
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 676 place count 60 transition count 122
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 682 place count 54 transition count 105
Iterating global reduction 7 with 6 rules applied. Total rules applied 688 place count 54 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 690 place count 54 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 692 place count 53 transition count 112
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 703 place count 53 transition count 101
Partial Post-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 711 place count 53 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 713 place count 51 transition count 99
Applied a total of 713 rules in 63 ms. Remains 51 /379 variables (removed 328) and now considering 99/493 (removed 394) transitions.
[2024-06-02 22:52:22] [INFO ] Flow matrix only has 92 transitions (discarded 7 similar events)
// Phase 1: matrix 92 rows 51 cols
[2024-06-02 22:52:22] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:52:22] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-02 22:52:22] [INFO ] Flow matrix only has 92 transitions (discarded 7 similar events)
[2024-06-02 22:52:22] [INFO ] Invariant cache hit.
[2024-06-02 22:52:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:52:22] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-06-02 22:52:22] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:52:22] [INFO ] Flow matrix only has 92 transitions (discarded 7 similar events)
[2024-06-02 22:52:22] [INFO ] Invariant cache hit.
[2024-06-02 22:52:22] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/379 places, 99/493 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188 ms. Remains : 51/379 places, 99/493 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-14-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p2:(OR (EQ s9 0) (EQ s19 1)), p1:(AND (OR (EQ s9 0) (EQ s19 1)) (OR (EQ s23 0) (EQ s36 1))), p0:(AND (EQ s19 0) (EQ s9 1) (OR (EQ s25 0) (EQ s5 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA CO4-PT-14-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLCardinality-05 finished in 301 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 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 493/493 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 363 transition count 473
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 363 transition count 473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 363 transition count 472
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 357 transition count 466
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 357 transition count 466
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 357 transition count 465
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 356 transition count 464
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 356 transition count 464
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 356 transition count 463
Applied a total of 49 rules in 23 ms. Remains 356 /379 variables (removed 23) and now considering 463/493 (removed 30) transitions.
// Phase 1: matrix 463 rows 356 cols
[2024-06-02 22:52:22] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 22:52:22] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 22:52:22] [INFO ] Invariant cache hit.
[2024-06-02 22:52:22] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2024-06-02 22:52:22] [INFO ] Invariant cache hit.
[2024-06-02 22:52:22] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 356/379 places, 463/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 437 ms. Remains : 356/379 places, 463/493 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLCardinality-07 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:(AND (EQ s216 0) (EQ s325 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CO4-PT-14-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLCardinality-07 finished in 574 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 379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 379/379 places, 493/493 transitions.
Graph (trivial) has 411 edges and 379 vertex of which 2 / 379 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 639 edges and 378 vertex of which 375 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 139 place count 374 transition count 351
Reduce places removed 137 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 237 transition count 349
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 279 place count 236 transition count 349
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 279 place count 236 transition count 307
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 363 place count 194 transition count 307
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 371 place count 186 transition count 295
Iterating global reduction 3 with 8 rules applied. Total rules applied 379 place count 186 transition count 295
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 383 place count 186 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 185 transition count 291
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 384 place count 185 transition count 290
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 386 place count 184 transition count 290
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 387 place count 183 transition count 289
Iterating global reduction 5 with 1 rules applied. Total rules applied 388 place count 183 transition count 289
Performed 63 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 514 place count 120 transition count 211
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 520 place count 120 transition count 205
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 524 place count 116 transition count 201
Iterating global reduction 6 with 4 rules applied. Total rules applied 528 place count 116 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 529 place count 116 transition count 200
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 533 place count 114 transition count 198
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 7 with 68 rules applied. Total rules applied 601 place count 80 transition count 201
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 622 place count 80 transition count 180
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 650 place count 52 transition count 124
Iterating global reduction 8 with 28 rules applied. Total rules applied 678 place count 52 transition count 124
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 697 place count 52 transition count 105
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 704 place count 45 transition count 85
Iterating global reduction 9 with 7 rules applied. Total rules applied 711 place count 45 transition count 85
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 715 place count 45 transition count 81
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 719 place count 45 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 721 place count 43 transition count 75
Applied a total of 721 rules in 38 ms. Remains 43 /379 variables (removed 336) and now considering 75/493 (removed 418) transitions.
[2024-06-02 22:52:23] [INFO ] Flow matrix only has 70 transitions (discarded 5 similar events)
// Phase 1: matrix 70 rows 43 cols
[2024-06-02 22:52:23] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:52:23] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 22:52:23] [INFO ] Flow matrix only has 70 transitions (discarded 5 similar events)
[2024-06-02 22:52:23] [INFO ] Invariant cache hit.
[2024-06-02 22:52:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:52:23] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-06-02 22:52:23] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:52:23] [INFO ] Flow matrix only has 70 transitions (discarded 5 similar events)
[2024-06-02 22:52:23] [INFO ] Invariant cache hit.
[2024-06-02 22:52:23] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/379 places, 75/493 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 43/379 places, 75/493 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s22 0) (NEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA CO4-PT-14-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLCardinality-08 finished in 218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 493/493 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 363 transition count 473
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 363 transition count 473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 363 transition count 472
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 357 transition count 466
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 357 transition count 466
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 357 transition count 465
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 356 transition count 464
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 356 transition count 464
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 356 transition count 463
Applied a total of 49 rules in 29 ms. Remains 356 /379 variables (removed 23) and now considering 463/493 (removed 30) transitions.
// Phase 1: matrix 463 rows 356 cols
[2024-06-02 22:52:23] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:52:23] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 22:52:23] [INFO ] Invariant cache hit.
[2024-06-02 22:52:23] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-06-02 22:52:23] [INFO ] Invariant cache hit.
[2024-06-02 22:52:23] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 356/379 places, 463/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 356/379 places, 463/493 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-14-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (EQ s62 0) (EQ s262 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 280 ms.
Product exploration explored 100000 steps with 25000 reset in 238 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 602 edges and 356 vertex of which 353 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1783472 steps, run timeout after 3001 ms. (steps per millisecond=594 ) properties seen :{}
Probabilistic random walk after 1783472 steps, saw 315611 distinct states, run finished after 3001 ms. (steps per millisecond=594 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:52:27] [INFO ] Invariant cache hit.
[2024-06-02 22:52:27] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:52:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:52:27] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:52:28] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-06-02 22:52:28] [INFO ] After 226ms 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 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 356/356 places, 463/463 transitions.
Applied a total of 0 rules in 6 ms. Remains 356 /356 variables (removed 0) and now considering 463/463 (removed 0) transitions.
[2024-06-02 22:52:28] [INFO ] Invariant cache hit.
[2024-06-02 22:52:28] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 22:52:28] [INFO ] Invariant cache hit.
[2024-06-02 22:52:28] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2024-06-02 22:52:28] [INFO ] Invariant cache hit.
[2024-06-02 22:52:28] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 356/356 places, 463/463 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 602 edges and 356 vertex of which 353 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1823810 steps, run timeout after 3001 ms. (steps per millisecond=607 ) properties seen :{}
Probabilistic random walk after 1823810 steps, saw 321867 distinct states, run finished after 3001 ms. (steps per millisecond=607 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:52:32] [INFO ] Invariant cache hit.
[2024-06-02 22:52:32] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:52:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-02 22:52:32] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:52:32] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-06-02 22:52:32] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 176 ms.
Product exploration explored 100000 steps with 25000 reset in 185 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 356/356 places, 463/463 transitions.
Graph (trivial) has 384 edges and 356 vertex of which 2 / 356 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 601 edges and 355 vertex of which 352 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 352 transition count 459
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 125 place count 352 transition count 458
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 125 place count 352 transition count 501
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 170 place count 352 transition count 501
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 197 place count 325 transition count 474
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 224 place count 325 transition count 474
Performed 42 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 182 places in 0 ms
Iterating global reduction 2 with 42 rules applied. Total rules applied 266 place count 325 transition count 523
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 273 place count 325 transition count 516
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 294 place count 304 transition count 491
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 21 rules applied. Total rules applied 315 place count 304 transition count 491
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 317 place count 302 transition count 488
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 319 place count 302 transition count 488
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 320 place count 302 transition count 487
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 321 place count 301 transition count 486
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 322 place count 301 transition count 486
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 323 place count 301 transition count 486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 324 place count 301 transition count 485
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 326 place count 299 transition count 483
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 328 place count 299 transition count 483
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 329 place count 299 transition count 483
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 330 place count 298 transition count 482
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 331 place count 298 transition count 482
Performed 54 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 5 with 54 rules applied. Total rules applied 385 place count 298 transition count 696
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 433 place count 298 transition count 648
Discarding 110 places :
Symmetric choice reduction at 6 with 110 rule applications. Total rules 543 place count 188 transition count 399
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 6 with 110 rules applied. Total rules applied 653 place count 188 transition count 399
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 6 with 34 rules applied. Total rules applied 687 place count 188 transition count 365
Discarding 67 places :
Symmetric choice reduction at 7 with 67 rule applications. Total rules 754 place count 121 transition count 246
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 7 with 67 rules applied. Total rules applied 821 place count 121 transition count 246
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 828 place count 121 transition count 239
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 840 place count 109 transition count 215
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 8 with 12 rules applied. Total rules applied 852 place count 109 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 853 place count 109 transition count 240
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 860 place count 109 transition count 233
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 863 place count 106 transition count 215
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 866 place count 106 transition count 215
Deduced a syphon composed of 59 places in 0 ms
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 879 place count 106 transition count 202
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 880 place count 105 transition count 201
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 881 place count 105 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 882 place count 105 transition count 222
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 883 place count 104 transition count 214
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 884 place count 104 transition count 214
Deduced a syphon composed of 58 places in 0 ms
Applied a total of 884 rules in 90 ms. Remains 104 /356 variables (removed 252) and now considering 214/463 (removed 249) transitions.
[2024-06-02 22:52:33] [INFO ] Redundant transitions in 8 ms returned []
[2024-06-02 22:52:33] [INFO ] Flow matrix only has 207 transitions (discarded 7 similar events)
// Phase 1: matrix 207 rows 104 cols
[2024-06-02 22:52:33] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:52:34] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/356 places, 214/463 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 507 ms. Remains : 104/356 places, 214/463 transitions.
Built C files in :
/tmp/ltsmin213648119577923423
[2024-06-02 22:52:34] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin213648119577923423
Running compilation step : cd /tmp/ltsmin213648119577923423;'/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 725 ms.
Running link step : cd /tmp/ltsmin213648119577923423;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin213648119577923423;'/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/stateBased9218282520534063443.hoa' '--buchi-type=spotba'
LTSmin run took 376 ms.
FORMULA CO4-PT-14-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-14-LTLCardinality-11 finished in 12108 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 379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 379/379 places, 493/493 transitions.
Graph (trivial) has 409 edges and 379 vertex of which 2 / 379 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 639 edges and 378 vertex of which 376 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 140 place count 375 transition count 351
Reduce places removed 138 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 279 place count 237 transition count 350
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 279 place count 237 transition count 308
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 363 place count 195 transition count 308
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 372 place count 186 transition count 296
Iterating global reduction 2 with 9 rules applied. Total rules applied 381 place count 186 transition count 296
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 385 place count 186 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 386 place count 185 transition count 292
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 386 place count 185 transition count 290
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 390 place count 183 transition count 290
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 393 place count 180 transition count 287
Iterating global reduction 4 with 3 rules applied. Total rules applied 396 place count 180 transition count 287
Performed 64 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 524 place count 116 transition count 207
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 530 place count 116 transition count 201
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 534 place count 112 transition count 197
Iterating global reduction 5 with 4 rules applied. Total rules applied 538 place count 112 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 539 place count 112 transition count 196
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 6 with 4 rules applied. Total rules applied 543 place count 110 transition count 194
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 6 with 62 rules applied. Total rules applied 605 place count 79 transition count 196
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 625 place count 79 transition count 176
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 653 place count 51 transition count 120
Iterating global reduction 7 with 28 rules applied. Total rules applied 681 place count 51 transition count 120
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 700 place count 51 transition count 101
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 707 place count 44 transition count 81
Iterating global reduction 8 with 7 rules applied. Total rules applied 714 place count 44 transition count 81
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 719 place count 44 transition count 76
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 9 with 2 rules applied. Total rules applied 721 place count 43 transition count 91
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 732 place count 43 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 734 place count 41 transition count 78
Applied a total of 734 rules in 37 ms. Remains 41 /379 variables (removed 338) and now considering 78/493 (removed 415) transitions.
[2024-06-02 22:52:35] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
// Phase 1: matrix 71 rows 41 cols
[2024-06-02 22:52:35] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:52:35] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-02 22:52:35] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
[2024-06-02 22:52:35] [INFO ] Invariant cache hit.
[2024-06-02 22:52:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:52:35] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-06-02 22:52:35] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:52:35] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
[2024-06-02 22:52:35] [INFO ] Invariant cache hit.
[2024-06-02 22:52:35] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/379 places, 78/493 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 302 ms. Remains : 41/379 places, 78/493 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s35 0) (NEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-14-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLCardinality-12 finished in 360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 379/379 places, 493/493 transitions.
Graph (trivial) has 411 edges and 379 vertex of which 2 / 379 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 639 edges and 378 vertex of which 375 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 140 place count 374 transition count 350
Reduce places removed 138 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 279 place count 236 transition count 349
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 279 place count 236 transition count 307
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 363 place count 194 transition count 307
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 372 place count 185 transition count 295
Iterating global reduction 2 with 9 rules applied. Total rules applied 381 place count 185 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 384 place count 185 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 385 place count 184 transition count 292
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 385 place count 184 transition count 290
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 389 place count 182 transition count 290
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 392 place count 179 transition count 287
Iterating global reduction 4 with 3 rules applied. Total rules applied 395 place count 179 transition count 287
Performed 63 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 521 place count 116 transition count 208
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 527 place count 116 transition count 202
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 531 place count 112 transition count 198
Iterating global reduction 5 with 4 rules applied. Total rules applied 535 place count 112 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 536 place count 112 transition count 197
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 6 with 4 rules applied. Total rules applied 540 place count 110 transition count 195
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 6 with 66 rules applied. Total rules applied 606 place count 77 transition count 197
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 627 place count 77 transition count 176
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 655 place count 49 transition count 120
Iterating global reduction 7 with 28 rules applied. Total rules applied 683 place count 49 transition count 120
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 702 place count 49 transition count 101
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 709 place count 42 transition count 81
Iterating global reduction 8 with 7 rules applied. Total rules applied 716 place count 42 transition count 81
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 721 place count 42 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 723 place count 41 transition count 93
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 735 place count 41 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 737 place count 39 transition count 79
Applied a total of 737 rules in 54 ms. Remains 39 /379 variables (removed 340) and now considering 79/493 (removed 414) transitions.
[2024-06-02 22:52:35] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
// Phase 1: matrix 69 rows 39 cols
[2024-06-02 22:52:35] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:52:35] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 22:52:35] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2024-06-02 22:52:35] [INFO ] Invariant cache hit.
[2024-06-02 22:52:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:52:36] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-06-02 22:52:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:52:36] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2024-06-02 22:52:36] [INFO ] Invariant cache hit.
[2024-06-02 22:52:36] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/379 places, 79/493 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 ms. Remains : 39/379 places, 79/493 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s33 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 19 reset in 81 ms.
Product exploration explored 100000 steps with 18 reset in 66 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 64 steps, including 7 resets, run visited all 1 properties in 1 ms. (steps per millisecond=64 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 79/79 transitions.
Applied a total of 0 rules in 4 ms. Remains 39 /39 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2024-06-02 22:52:36] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2024-06-02 22:52:36] [INFO ] Invariant cache hit.
[2024-06-02 22:52:36] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-02 22:52:36] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2024-06-02 22:52:36] [INFO ] Invariant cache hit.
[2024-06-02 22:52:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:52:36] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-06-02 22:52:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:52:36] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2024-06-02 22:52:36] [INFO ] Invariant cache hit.
[2024-06-02 22:52:36] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 39/39 places, 79/79 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 236 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 319 steps, including 33 resets, run visited all 1 properties in 2 ms. (steps per millisecond=159 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4 reset in 37 ms.
Product exploration explored 100000 steps with 16 reset in 146 ms.
Built C files in :
/tmp/ltsmin3017020274556298590
[2024-06-02 22:52:37] [INFO ] Computing symmetric may disable matrix : 79 transitions.
[2024-06-02 22:52:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:52:37] [INFO ] Computing symmetric may enable matrix : 79 transitions.
[2024-06-02 22:52:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:52:37] [INFO ] Computing Do-Not-Accords matrix : 79 transitions.
[2024-06-02 22:52:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:52:37] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3017020274556298590
Running compilation step : cd /tmp/ltsmin3017020274556298590;'/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 162 ms.
Running link step : cd /tmp/ltsmin3017020274556298590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3017020274556298590;'/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/stateBased373409807296429761.hoa' '--buchi-type=spotba'
LTSmin run took 119 ms.
FORMULA CO4-PT-14-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-14-LTLCardinality-13 finished in 2356 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((X((p0 U p1))&&(G(p3)||p2))))'
Support contains 5 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 493/493 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 363 transition count 474
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 363 transition count 474
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 363 transition count 473
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 358 transition count 468
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 358 transition count 468
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 358 transition count 467
Applied a total of 44 rules in 17 ms. Remains 358 /379 variables (removed 21) and now considering 467/493 (removed 26) transitions.
// Phase 1: matrix 467 rows 358 cols
[2024-06-02 22:52:38] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:52:38] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 22:52:38] [INFO ] Invariant cache hit.
[2024-06-02 22:52:38] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-06-02 22:52:38] [INFO ] Invariant cache hit.
[2024-06-02 22:52:38] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 358/379 places, 467/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 434 ms. Remains : 358/379 places, 467/493 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (OR (AND p1 p2 (NOT p3)) (AND p0 p2 (NOT p3)))]
Running random walk in product with property : CO4-PT-14-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR p2 p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p2 (NOT p3) p1) (AND p2 (NOT p3) p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 p3), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s332 0) (EQ s285 1)), p3:(EQ s297 0), p1:(EQ s325 1), p0:(EQ s153 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CO4-PT-14-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLCardinality-14 finished in 585 ms.
All properties solved by simple procedures.
Total runtime 29214 ms.

BK_STOP 1717368760060

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

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