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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 152K 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-09-LTLCardinality-00
FORMULA_NAME CO4-PT-09-LTLCardinality-01
FORMULA_NAME CO4-PT-09-LTLCardinality-02
FORMULA_NAME CO4-PT-09-LTLCardinality-03
FORMULA_NAME CO4-PT-09-LTLCardinality-04
FORMULA_NAME CO4-PT-09-LTLCardinality-05
FORMULA_NAME CO4-PT-09-LTLCardinality-06
FORMULA_NAME CO4-PT-09-LTLCardinality-07
FORMULA_NAME CO4-PT-09-LTLCardinality-08
FORMULA_NAME CO4-PT-09-LTLCardinality-09
FORMULA_NAME CO4-PT-09-LTLCardinality-10
FORMULA_NAME CO4-PT-09-LTLCardinality-11
FORMULA_NAME CO4-PT-09-LTLCardinality-12
FORMULA_NAME CO4-PT-09-LTLCardinality-13
FORMULA_NAME CO4-PT-09-LTLCardinality-14
FORMULA_NAME CO4-PT-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717368653161

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-09
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:50:54] [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:50:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:50:54] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-06-02 22:50:54] [INFO ] Transformed 467 places.
[2024-06-02 22:50:54] [INFO ] Transformed 634 transitions.
[2024-06-02 22:50:54] [INFO ] Found NUPN structural information;
[2024-06-02 22:50:54] [INFO ] Parsed PT model containing 467 places and 634 transitions and 1868 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 108 places in 8 ms
Reduce places removed 108 places and 163 transitions.
FORMULA CO4-PT-09-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 471/471 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 347 transition count 470
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 91 place count 269 transition count 390
Iterating global reduction 1 with 78 rules applied. Total rules applied 169 place count 269 transition count 390
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 173 place count 269 transition count 386
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 210 place count 232 transition count 328
Iterating global reduction 2 with 37 rules applied. Total rules applied 247 place count 232 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 249 place count 232 transition count 326
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 255 place count 226 transition count 316
Iterating global reduction 3 with 6 rules applied. Total rules applied 261 place count 226 transition count 316
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 265 place count 222 transition count 312
Iterating global reduction 3 with 4 rules applied. Total rules applied 269 place count 222 transition count 312
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 270 place count 221 transition count 311
Iterating global reduction 3 with 1 rules applied. Total rules applied 271 place count 221 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 272 place count 221 transition count 310
Applied a total of 272 rules in 69 ms. Remains 221 /359 variables (removed 138) and now considering 310/471 (removed 161) transitions.
// Phase 1: matrix 310 rows 221 cols
[2024-06-02 22:50:55] [INFO ] Computed 6 invariants in 13 ms
[2024-06-02 22:50:55] [INFO ] Implicit Places using invariants in 224 ms returned [5, 145]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 251 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 219/359 places, 310/471 transitions.
Applied a total of 0 rules in 10 ms. Remains 219 /219 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 330 ms. Remains : 219/359 places, 310/471 transitions.
Support contains 17 out of 219 places after structural reductions.
[2024-06-02 22:50:55] [INFO ] Flatten gal took : 46 ms
[2024-06-02 22:50:55] [INFO ] Flatten gal took : 20 ms
[2024-06-02 22:50:55] [INFO ] Input system was already deterministic with 310 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 59 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 310 rows 219 cols
[2024-06-02 22:50:56] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:50:56] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2024-06-02 22:50:56] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 22:50:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:50:57] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 22:50:57] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-06-02 22:50:57] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 152 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=76 )
Parikh walk visited 4 properties in 11 ms.
Computed a total of 14 stabilizing places and 20 stable transitions
Graph (complete) has 476 edges and 219 vertex of which 214 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X((G(p1)||(p2 U p3)))||p0))||G(p4))))'
Support contains 6 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 310/310 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 218 transition count 309
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 212 transition count 302
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 212 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 212 transition count 301
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 209 transition count 296
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 209 transition count 296
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 207 transition count 294
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 207 transition count 294
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 205 transition count 292
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 205 transition count 292
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 205 transition count 290
Applied a total of 31 rules in 13 ms. Remains 205 /219 variables (removed 14) and now considering 290/310 (removed 20) transitions.
// Phase 1: matrix 290 rows 205 cols
[2024-06-02 22:50:57] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:50:57] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 22:50:57] [INFO ] Invariant cache hit.
[2024-06-02 22:50:57] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-06-02 22:50:57] [INFO ] Invariant cache hit.
[2024-06-02 22:50:57] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/219 places, 290/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 327 ms. Remains : 205/219 places, 290/310 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 333 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4))]
Running random walk in product with property : CO4-PT-09-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p4, acceptance={1} source=0 dest: 0}, { cond=(NOT p4), acceptance={1, 2} source=0 dest: 0}, { cond=(AND p4 (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p4) (NOT p0)), acceptance={0, 1, 2} source=0 dest: 1}], [{ cond=(AND p4 (NOT p1) (NOT p3) (NOT p2)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p4) (NOT p1) (NOT p3) (NOT p2)), acceptance={1, 2} source=1 dest: 0}, { cond=(AND p4 p0 p1 (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND p4 (NOT p0) p1 (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p4 (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p4) p0 p1 (NOT p3) p2), acceptance={2} source=1 dest: 1}, { cond=(AND (NOT p4) (NOT p0) p1 (NOT p3)), acceptance={0, 2} source=1 dest: 1}, { cond=(AND (NOT p4) (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p4 (NOT p1) (NOT p3) p2), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p4) (NOT p1) (NOT p3) p2), acceptance={1, 2} source=1 dest: 2}, { cond=(AND p4 p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p4) p1 (NOT p3) (NOT p2)), acceptance={2} source=1 dest: 3}], [{ cond=(AND p4 (NOT p3) (NOT p2)), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p4) (NOT p3) (NOT p2)), acceptance={1, 2} source=2 dest: 0}, { cond=(AND p4 (NOT p0) (NOT p3)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p4) (NOT p0) (NOT p3)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p4 (NOT p3) p2), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p4) (NOT p3) p2), acceptance={1, 2} source=2 dest: 2}], [{ cond=(AND p4 (NOT p1)), acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p4) (NOT p1)), acceptance={1, 2} source=3 dest: 0}, { cond=(AND p4 (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p4 (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p4) (NOT p0) p1), acceptance={0, 2} source=3 dest: 1}, { cond=(AND (NOT p4) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p4 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p4) p1), acceptance={2} source=3 dest: 3}]], initial=0, aps=[p4:(OR (EQ s162 0) (EQ s37 1)), p0:(OR (EQ s146 0) (EQ s173 1)), p1:(EQ s101 1), p3:(OR (EQ s146 0) (EQ s173 1)), p2:(OR (EQ s3 0) (EQ s101 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 96 reset in 271 ms.
Product exploration explored 100000 steps with 333 reset in 131 ms.
Computed a total of 14 stabilizing places and 20 stable transitions
Graph (complete) has 455 edges and 205 vertex of which 202 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p4 p0 (NOT p1) p3 p2), (X p4), (X (NOT (AND p4 p1 (NOT p3) (NOT p2)))), (X (NOT (AND p4 (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p4) p0 p1 (NOT p3) p2))), (X (NOT (AND p4 (NOT p0)))), (X (NOT (AND p4 p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p4) (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p4) (NOT p0) p1 (NOT p3)))), (X (NOT (AND p4 (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND p4 (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p4) (NOT p0)))), (X (NOT (AND (NOT p4) (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p4) p1 (NOT p3) (NOT p2)))), (X (NOT (AND p4 (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p4) (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND p4 (NOT p3) p2)))), (X (X (NOT (AND p4 (NOT p0) p1)))), (X (X p4)), (X (X (NOT (AND p4 (NOT p0) (NOT p3))))), (X (X (NOT (AND p4 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p4) p0 p1 (NOT p3) p2)))), (X (X (NOT (AND p4 p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p4) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p4) (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND p4 (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p4 (NOT p0) p1 (NOT p3))))), (X (X (AND p4 (NOT p1)))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND p4 (NOT p0) (NOT p1))))), (X (X (NOT (AND p4 p1)))), (X (X (NOT (AND (NOT p4) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p4) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p4 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p1))))), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p4) p1)))), (X (X (NOT (AND p4 (NOT p0))))), (X (X (NOT (AND (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND (NOT p4) (NOT p0) p1)))), (X (X (NOT (AND (NOT p4) (NOT p0))))), (X (X (NOT (AND p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p4 (NOT p0) (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 45 factoid took 405 ms. Reduced automaton from 4 states, 30 edges and 5 AP (stutter sensitive) to 4 states, 30 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4))]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :2
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :2
Running SMT prover for 25 properties.
[2024-06-02 22:50:59] [INFO ] Invariant cache hit.
[2024-06-02 22:50:59] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:21
[2024-06-02 22:50:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:51:00] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :16 sat :9
[2024-06-02 22:51:00] [INFO ] After 369ms SMT Verify possible using trap constraints in natural domain returned unsat :16 sat :9
Attempting to minimize the solution found.
Minimization took 100 ms.
[2024-06-02 22:51:00] [INFO ] After 669ms SMT Verify possible using all constraints in natural domain returned unsat :16 sat :9
Fused 25 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 6 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 290/290 transitions.
Graph (trivial) has 209 edges and 205 vertex of which 2 / 205 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 453 edges and 204 vertex of which 188 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 188 transition count 195
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 148 place count 122 transition count 194
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 148 place count 122 transition count 172
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 192 place count 100 transition count 172
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 194 place count 98 transition count 170
Iterating global reduction 2 with 2 rules applied. Total rules applied 196 place count 98 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 198 place count 98 transition count 168
Performed 29 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 256 place count 69 transition count 132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 261 place count 69 transition count 127
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 263 place count 67 transition count 123
Iterating global reduction 4 with 2 rules applied. Total rules applied 265 place count 67 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 267 place count 66 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 268 place count 66 transition count 121
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 300 place count 50 transition count 138
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 306 place count 50 transition count 132
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 316 place count 40 transition count 92
Iterating global reduction 6 with 10 rules applied. Total rules applied 326 place count 40 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 332 place count 40 transition count 86
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 334 place count 38 transition count 74
Iterating global reduction 7 with 2 rules applied. Total rules applied 336 place count 38 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 337 place count 38 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 339 place count 37 transition count 86
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 344 place count 37 transition count 81
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 354 place count 37 transition count 71
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 361 place count 37 transition count 64
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 368 place count 30 transition count 64
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 370 place count 30 transition count 64
Graph (complete) has 113 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 10 with 1 rules applied. Total rules applied 371 place count 29 transition count 64
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 373 place count 29 transition count 62
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 374 place count 29 transition count 62
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 376 place count 29 transition count 62
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 377 place count 29 transition count 61
Applied a total of 377 rules in 61 ms. Remains 29 /205 variables (removed 176) and now considering 61/290 (removed 229) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 29/205 places, 61/290 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-06-02 22:51:00] [INFO ] Flow matrix only has 53 transitions (discarded 8 similar events)
// Phase 1: matrix 53 rows 29 cols
[2024-06-02 22:51:00] [INFO ] Computed 6 invariants in 0 ms
[2024-06-02 22:51:00] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:51:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-02 22:51:00] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:51:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 22:51:00] [INFO ] After 7ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:51:00] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-06-02 22:51:00] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 61/61 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 29 transition count 59
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 27 transition count 59
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 24 transition count 56
Drop transitions removed 10 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 82 edges and 24 vertex of which 23 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 2 with 16 rules applied. Total rules applied 26 place count 23 transition count 41
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 22 transition count 39
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 22 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 22 transition count 38
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 22 transition count 36
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 21 transition count 34
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 21 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 34 place count 21 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 35 place count 20 transition count 32
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t95.t259.t92 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 38 place count 17 transition count 29
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 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 41 place count 15 transition count 28
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 42 place count 15 transition count 27
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 48 place count 15 transition count 21
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 51 place count 15 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 54 place count 12 transition count 18
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 56 place count 12 transition count 16
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 58 place count 12 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 60 place count 10 transition count 14
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 62 place count 10 transition count 12
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 64 place count 10 transition count 10
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 67 place count 8 transition count 9
Applied a total of 67 rules in 16 ms. Remains 8 /29 variables (removed 21) and now considering 9/61 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 8/29 places, 9/61 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished Best-First random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Found 16 invariant AP formulas.
Knowledge obtained : [(AND p4 p0 (NOT p1) p3 p2), (X p4), (X (NOT (AND p4 p1 (NOT p3) (NOT p2)))), (X (NOT (AND p4 (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p4) p0 p1 (NOT p3) p2))), (X (NOT (AND p4 (NOT p0)))), (X (NOT (AND p4 p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p4) (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p4) (NOT p0) p1 (NOT p3)))), (X (NOT (AND p4 (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND p4 (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p4) (NOT p0)))), (X (NOT (AND (NOT p4) (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p4) p1 (NOT p3) (NOT p2)))), (X (NOT (AND p4 (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p4) (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND p4 (NOT p3) p2)))), (X (X (NOT (AND p4 (NOT p0) p1)))), (X (X p4)), (X (X (NOT (AND p4 (NOT p0) (NOT p3))))), (X (X (NOT (AND p4 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p4) p0 p1 (NOT p3) p2)))), (X (X (NOT (AND p4 p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p4) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p4) (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND p4 (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p4 (NOT p0) p1 (NOT p3))))), (X (X (AND p4 (NOT p1)))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND p4 (NOT p0) (NOT p1))))), (X (X (NOT (AND p4 p1)))), (X (X (NOT (AND (NOT p4) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p4) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p4 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p1))))), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p4) p1)))), (X (X (NOT (AND p4 (NOT p0))))), (X (X (NOT (AND (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND (NOT p4) (NOT p0) p1)))), (X (X (NOT (AND (NOT p4) (NOT p0))))), (X (X (NOT (AND p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p4 (NOT p0) (NOT p1) (NOT p3))))), (G (NOT (AND (NOT p1) (NOT p4) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (G (NOT (AND p1 (NOT p4) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3) p4))), (G (NOT (AND p1 p2 (NOT p3) p4 p0))), (G (NOT (AND (NOT p4) (NOT p0)))), (G (NOT (AND p2 (NOT p3) (NOT p4)))), (G (NOT (AND p1 p2 (NOT p3) (NOT p4) p0))), (G (NOT (AND p1 (NOT p3) (NOT p4) (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p3) p4))), (G (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4)))), (G (NOT (AND p1 (NOT p2) (NOT p3) p4))), (G (NOT (AND (NOT p1) p2 (NOT p3) (NOT p4)))), (G (NOT (AND (NOT p3) (NOT p4) (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p4)))), (G (NOT (AND (NOT p1) (NOT p3) (NOT p4) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p4 (NOT p0))), (F (AND p1 (NOT p3) p4 (NOT p0))), (F (AND p1 p4 (NOT p0))), (F (NOT p4)), (F (AND p1 (NOT p4))), (F (AND p1 p4)), (F (AND p4 (NOT p0))), (F (AND (NOT p1) (NOT p4))), (F (NOT (AND (NOT p1) p4))), (F (AND (NOT p1) (NOT p3) p4 (NOT p0))), (F (AND p2 (NOT p3) p4)), (F (AND (NOT p3) p4 (NOT p0))), (F (AND (NOT p1) p2 (NOT p3) p4))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 61 factoid took 25 ms. Reduced automaton from 4 states, 30 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-09-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-09-LTLCardinality-01 finished in 3570 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((F(p0)||X(p1)))))'
Support contains 3 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 310/310 transitions.
Graph (trivial) has 228 edges and 219 vertex of which 2 / 219 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 475 edges and 218 vertex of which 214 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 213 transition count 226
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 81 rules applied. Total rules applied 160 place count 136 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 135 transition count 222
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 161 place count 135 transition count 199
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 207 place count 112 transition count 199
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 210 place count 109 transition count 194
Iterating global reduction 3 with 3 rules applied. Total rules applied 213 place count 109 transition count 194
Performed 32 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 277 place count 77 transition count 151
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 rules applied. Total rules applied 284 place count 77 transition count 144
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 286 place count 76 transition count 143
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 288 place count 74 transition count 139
Iterating global reduction 5 with 2 rules applied. Total rules applied 290 place count 74 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 292 place count 73 transition count 138
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 328 place count 55 transition count 158
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 336 place count 55 transition count 150
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 346 place count 45 transition count 110
Iterating global reduction 6 with 10 rules applied. Total rules applied 356 place count 45 transition count 110
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 363 place count 45 transition count 103
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 366 place count 42 transition count 85
Iterating global reduction 7 with 3 rules applied. Total rules applied 369 place count 42 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 371 place count 42 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 373 place count 41 transition count 93
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 8 with 19 rules applied. Total rules applied 392 place count 41 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 394 place count 39 transition count 72
Applied a total of 394 rules in 40 ms. Remains 39 /219 variables (removed 180) and now considering 72/310 (removed 238) transitions.
[2024-06-02 22:51:00] [INFO ] Flow matrix only has 65 transitions (discarded 7 similar events)
// Phase 1: matrix 65 rows 39 cols
[2024-06-02 22:51:00] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:51:01] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-02 22:51:01] [INFO ] Flow matrix only has 65 transitions (discarded 7 similar events)
[2024-06-02 22:51:01] [INFO ] Invariant cache hit.
[2024-06-02 22:51:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:51:01] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-06-02 22:51:01] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:51:01] [INFO ] Flow matrix only has 65 transitions (discarded 7 similar events)
[2024-06-02 22:51:01] [INFO ] Invariant cache hit.
[2024-06-02 22:51:01] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/219 places, 72/310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 39/219 places, 72/310 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-09-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s24 0) (EQ s20 1)), p0:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA CO4-PT-09-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLCardinality-04 finished in 291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 3 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 310/310 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 218 transition count 309
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 209 transition count 298
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 209 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 209 transition count 297
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 26 place count 204 transition count 290
Iterating global reduction 2 with 5 rules applied. Total rules applied 31 place count 204 transition count 290
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 34 place count 201 transition count 287
Iterating global reduction 2 with 3 rules applied. Total rules applied 37 place count 201 transition count 287
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 199 transition count 285
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 199 transition count 285
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 199 transition count 283
Applied a total of 43 rules in 20 ms. Remains 199 /219 variables (removed 20) and now considering 283/310 (removed 27) transitions.
// Phase 1: matrix 283 rows 199 cols
[2024-06-02 22:51:01] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:51:01] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 22:51:01] [INFO ] Invariant cache hit.
[2024-06-02 22:51:01] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-06-02 22:51:01] [INFO ] Invariant cache hit.
[2024-06-02 22:51:01] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 199/219 places, 283/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 199/219 places, 283/310 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s98 0) (EQ s55 1) (EQ s169 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CO4-PT-09-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLCardinality-06 finished in 462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 310/310 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 218 transition count 309
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 208 transition count 298
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 208 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 208 transition count 296
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 203 transition count 289
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 203 transition count 289
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 200 transition count 286
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 200 transition count 286
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 198 transition count 284
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 198 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 198 transition count 282
Applied a total of 46 rules in 27 ms. Remains 198 /219 variables (removed 21) and now considering 282/310 (removed 28) transitions.
// Phase 1: matrix 282 rows 198 cols
[2024-06-02 22:51:01] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 22:51:01] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 22:51:01] [INFO ] Invariant cache hit.
[2024-06-02 22:51:01] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-06-02 22:51:01] [INFO ] Invariant cache hit.
[2024-06-02 22:51:02] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 198/219 places, 282/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 315 ms. Remains : 198/219 places, 282/310 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s83 0) (EQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 175 ms.
Product exploration explored 100000 steps with 25000 reset in 154 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 444 edges and 198 vertex of which 195 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 160 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1212018 steps, run visited all 1 properties in 1454 ms. (steps per millisecond=833 )
Probabilistic random walk after 1212018 steps, saw 197875 distinct states, run finished after 1455 ms. (steps per millisecond=833 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 282/282 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-06-02 22:51:04] [INFO ] Invariant cache hit.
[2024-06-02 22:51:04] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 22:51:04] [INFO ] Invariant cache hit.
[2024-06-02 22:51:04] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-06-02 22:51:04] [INFO ] Invariant cache hit.
[2024-06-02 22:51:05] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 198/198 places, 282/282 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 444 edges and 198 vertex of which 195 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 125 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1212018 steps, run visited all 1 properties in 1367 ms. (steps per millisecond=886 )
Probabilistic random walk after 1212018 steps, saw 197875 distinct states, run finished after 1367 ms. (steps per millisecond=886 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 353 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 124 ms.
Product exploration explored 100000 steps with 25000 reset in 128 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 282/282 transitions.
Graph (trivial) has 208 edges and 198 vertex of which 2 / 198 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 443 edges and 197 vertex of which 194 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
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 194 transition count 278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 194 transition count 276
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 69 place count 194 transition count 297
Deduced a syphon composed of 87 places in 1 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 91 place count 194 transition count 297
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 106 place count 179 transition count 282
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 121 place count 179 transition count 282
Performed 25 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 146 place count 179 transition count 298
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 153 place count 179 transition count 291
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 168 place count 164 transition count 275
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 3 with 15 rules applied. Total rules applied 183 place count 164 transition count 275
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 185 place count 164 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 187 place count 164 transition count 273
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 191 place count 160 transition count 269
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 195 place count 160 transition count 269
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 197 place count 160 transition count 269
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 199 place count 158 transition count 267
Deduced a syphon composed of 81 places in 1 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 201 place count 158 transition count 267
Performed 25 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 4 with 25 rules applied. Total rules applied 226 place count 158 transition count 399
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 247 place count 158 transition count 378
Discarding 45 places :
Symmetric choice reduction at 5 with 45 rule applications. Total rules 292 place count 113 transition count 252
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 5 with 45 rules applied. Total rules applied 337 place count 113 transition count 252
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 354 place count 113 transition count 235
Discarding 29 places :
Symmetric choice reduction at 6 with 29 rule applications. Total rules 383 place count 84 transition count 172
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 6 with 29 rules applied. Total rules applied 412 place count 84 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 413 place count 84 transition count 171
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 419 place count 78 transition count 159
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 425 place count 78 transition count 159
Deduced a syphon composed of 40 places in 0 ms
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 7 with 22 rules applied. Total rules applied 447 place count 78 transition count 137
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 448 place count 77 transition count 136
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 449 place count 77 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 450 place count 77 transition count 160
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 452 place count 75 transition count 146
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 454 place count 75 transition count 146
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 454 rules in 58 ms. Remains 75 /198 variables (removed 123) and now considering 146/282 (removed 136) transitions.
[2024-06-02 22:51:08] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:51:08] [INFO ] Flow matrix only has 130 transitions (discarded 16 similar events)
// Phase 1: matrix 130 rows 75 cols
[2024-06-02 22:51:08] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:51:08] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/198 places, 146/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 75/198 places, 146/282 transitions.
Built C files in :
/tmp/ltsmin8902668773055489445
[2024-06-02 22:51:08] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8902668773055489445
Running compilation step : cd /tmp/ltsmin8902668773055489445;'/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 468 ms.
Running link step : cd /tmp/ltsmin8902668773055489445;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin8902668773055489445;'/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/stateBased4582292428275731721.hoa' '--buchi-type=spotba'
LTSmin run took 191 ms.
FORMULA CO4-PT-09-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-09-LTLCardinality-07 finished in 7222 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 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 310/310 transitions.
Graph (trivial) has 233 edges and 219 vertex of which 2 / 219 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 475 edges and 218 vertex of which 213 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 212 transition count 222
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 84 rules applied. Total rules applied 167 place count 132 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 131 transition count 218
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 168 place count 131 transition count 195
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 214 place count 108 transition count 195
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 217 place count 105 transition count 190
Iterating global reduction 3 with 3 rules applied. Total rules applied 220 place count 105 transition count 190
Performed 32 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 284 place count 73 transition count 146
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 8 rules applied. Total rules applied 292 place count 73 transition count 138
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 294 place count 72 transition count 137
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 296 place count 70 transition count 133
Iterating global reduction 5 with 2 rules applied. Total rules applied 298 place count 70 transition count 133
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 5 with 4 rules applied. Total rules applied 302 place count 68 transition count 131
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 338 place count 50 transition count 151
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 347 place count 50 transition count 142
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 358 place count 39 transition count 98
Iterating global reduction 6 with 11 rules applied. Total rules applied 369 place count 39 transition count 98
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 377 place count 39 transition count 90
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 380 place count 36 transition count 72
Iterating global reduction 7 with 3 rules applied. Total rules applied 383 place count 36 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 385 place count 36 transition count 70
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 393 place count 36 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 394 place count 35 transition count 61
Applied a total of 394 rules in 40 ms. Remains 35 /219 variables (removed 184) and now considering 61/310 (removed 249) transitions.
[2024-06-02 22:51:08] [INFO ] Flow matrix only has 49 transitions (discarded 12 similar events)
// Phase 1: matrix 49 rows 35 cols
[2024-06-02 22:51:08] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:51:08] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 22:51:08] [INFO ] Flow matrix only has 49 transitions (discarded 12 similar events)
[2024-06-02 22:51:08] [INFO ] Invariant cache hit.
[2024-06-02 22:51:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-02 22:51:09] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-06-02 22:51:09] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:51:09] [INFO ] Flow matrix only has 49 transitions (discarded 12 similar events)
[2024-06-02 22:51:09] [INFO ] Invariant cache hit.
[2024-06-02 22:51:09] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/219 places, 61/310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 35/219 places, 61/310 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s13 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-09-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLCardinality-10 finished in 204 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(X(p0)))))'
Support contains 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 310/310 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 218 transition count 309
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 207 transition count 296
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 207 transition count 296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 207 transition count 294
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 31 place count 202 transition count 287
Iterating global reduction 2 with 5 rules applied. Total rules applied 36 place count 202 transition count 287
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 199 transition count 284
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 199 transition count 284
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 197 transition count 282
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 197 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 197 transition count 280
Applied a total of 48 rules in 16 ms. Remains 197 /219 variables (removed 22) and now considering 280/310 (removed 30) transitions.
// Phase 1: matrix 280 rows 197 cols
[2024-06-02 22:51:09] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:51:09] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 22:51:09] [INFO ] Invariant cache hit.
[2024-06-02 22:51:09] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-06-02 22:51:09] [INFO ] Invariant cache hit.
[2024-06-02 22:51:09] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/219 places, 280/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 320 ms. Remains : 197/219 places, 280/310 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLCardinality-13 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}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p0:(EQ s57 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 109 ms.
Product exploration explored 100000 steps with 20000 reset in 111 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 440 edges and 197 vertex of which 194 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.15 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1042714 steps, run visited all 1 properties in 1146 ms. (steps per millisecond=909 )
Probabilistic random walk after 1042714 steps, saw 163259 distinct states, run finished after 1147 ms. (steps per millisecond=909 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 280/280 transitions.
Applied a total of 0 rules in 3 ms. Remains 197 /197 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-06-02 22:51:11] [INFO ] Invariant cache hit.
[2024-06-02 22:51:11] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 22:51:11] [INFO ] Invariant cache hit.
[2024-06-02 22:51:12] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-06-02 22:51:12] [INFO ] Invariant cache hit.
[2024-06-02 22:51:12] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 197/197 places, 280/280 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 440 edges and 197 vertex of which 194 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 194 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1042714 steps, run visited all 1 properties in 1149 ms. (steps per millisecond=907 )
Probabilistic random walk after 1042714 steps, saw 163259 distinct states, run finished after 1149 ms. (steps per millisecond=907 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 104 ms.
Product exploration explored 100000 steps with 20000 reset in 125 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 280/280 transitions.
Graph (trivial) has 208 edges and 197 vertex of which 2 / 197 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 439 edges and 196 vertex of which 193 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 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 193 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 68 place count 193 transition count 274
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 68 place count 193 transition count 295
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 193 transition count 295
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 105 place count 178 transition count 280
Deduced a syphon composed of 71 places in 1 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 120 place count 178 transition count 280
Performed 26 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 2 with 26 rules applied. Total rules applied 146 place count 178 transition count 296
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 153 place count 178 transition count 289
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 169 place count 162 transition count 271
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 185 place count 162 transition count 271
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 162 transition count 271
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 189 place count 162 transition count 269
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 193 place count 158 transition count 265
Deduced a syphon composed of 81 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 197 place count 158 transition count 265
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 199 place count 158 transition count 265
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 201 place count 156 transition count 263
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 203 place count 156 transition count 263
Performed 25 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 4 with 25 rules applied. Total rules applied 228 place count 156 transition count 391
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 249 place count 156 transition count 370
Discarding 46 places :
Symmetric choice reduction at 5 with 46 rule applications. Total rules 295 place count 110 transition count 241
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 5 with 46 rules applied. Total rules applied 341 place count 110 transition count 241
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 358 place count 110 transition count 224
Discarding 29 places :
Symmetric choice reduction at 6 with 29 rule applications. Total rules 387 place count 81 transition count 161
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 6 with 29 rules applied. Total rules applied 416 place count 81 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 419 place count 81 transition count 158
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 425 place count 75 transition count 146
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 431 place count 75 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 432 place count 75 transition count 171
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 439 place count 75 transition count 164
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 442 place count 72 transition count 146
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 445 place count 72 transition count 146
Deduced a syphon composed of 37 places in 0 ms
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 458 place count 72 transition count 133
Deduced a syphon composed of 37 places in 0 ms
Applied a total of 458 rules in 39 ms. Remains 72 /197 variables (removed 125) and now considering 133/280 (removed 147) transitions.
[2024-06-02 22:51:15] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:51:15] [INFO ] Flow matrix only has 121 transitions (discarded 12 similar events)
// Phase 1: matrix 121 rows 72 cols
[2024-06-02 22:51:15] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:51:15] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/197 places, 133/280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 72/197 places, 133/280 transitions.
Built C files in :
/tmp/ltsmin9907629463466507810
[2024-06-02 22:51:15] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9907629463466507810
Running compilation step : cd /tmp/ltsmin9907629463466507810;'/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 362 ms.
Running link step : cd /tmp/ltsmin9907629463466507810;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9907629463466507810;'/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/stateBased16135121214630884500.hoa' '--buchi-type=spotba'
LTSmin run took 185 ms.
FORMULA CO4-PT-09-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-09-LTLCardinality-13 finished in 6591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 310/310 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 218 transition count 309
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 208 transition count 297
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 208 transition count 297
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 208 transition count 295
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 204 transition count 290
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 204 transition count 290
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 202 transition count 288
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 202 transition count 288
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 201 transition count 287
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 201 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 201 transition count 286
Applied a total of 39 rules in 12 ms. Remains 201 /219 variables (removed 18) and now considering 286/310 (removed 24) transitions.
// Phase 1: matrix 286 rows 201 cols
[2024-06-02 22:51:15] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:51:15] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 22:51:15] [INFO ] Invariant cache hit.
[2024-06-02 22:51:15] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-06-02 22:51:15] [INFO ] Invariant cache hit.
[2024-06-02 22:51:16] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 201/219 places, 286/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 311 ms. Remains : 201/219 places, 286/310 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-09-LTLCardinality-14 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}]], initial=1, aps=[p0:(NEQ s164 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 446 edges and 201 vertex of which 198 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-09-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-09-LTLCardinality-14 finished in 731 ms.
All properties solved by simple procedures.
Total runtime 21829 ms.

BK_STOP 1717368677791

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

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