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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 177K 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-12-LTLFireability-00
FORMULA_NAME CO4-PT-12-LTLFireability-01
FORMULA_NAME CO4-PT-12-LTLFireability-02
FORMULA_NAME CO4-PT-12-LTLFireability-03
FORMULA_NAME CO4-PT-12-LTLFireability-04
FORMULA_NAME CO4-PT-12-LTLFireability-05
FORMULA_NAME CO4-PT-12-LTLFireability-06
FORMULA_NAME CO4-PT-12-LTLFireability-07
FORMULA_NAME CO4-PT-12-LTLFireability-08
FORMULA_NAME CO4-PT-12-LTLFireability-09
FORMULA_NAME CO4-PT-12-LTLFireability-10
FORMULA_NAME CO4-PT-12-LTLFireability-11
FORMULA_NAME CO4-PT-12-LTLFireability-12
FORMULA_NAME CO4-PT-12-LTLFireability-13
FORMULA_NAME CO4-PT-12-LTLFireability-14
FORMULA_NAME CO4-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717368701645

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-12
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:51:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:51:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:51:43] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-06-02 22:51:43] [INFO ] Transformed 649 places.
[2024-06-02 22:51:43] [INFO ] Transformed 782 transitions.
[2024-06-02 22:51:43] [INFO ] Found NUPN structural information;
[2024-06-02 22:51:43] [INFO ] Parsed PT model containing 649 places and 782 transitions and 1960 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 172 places in 10 ms
Reduce places removed 172 places and 219 transitions.
FORMULA CO4-PT-12-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 563/563 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 461 transition count 559
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 101 place count 380 transition count 477
Iterating global reduction 1 with 81 rules applied. Total rules applied 182 place count 380 transition count 477
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 248 place count 314 transition count 393
Iterating global reduction 1 with 66 rules applied. Total rules applied 314 place count 314 transition count 393
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 319 place count 314 transition count 388
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 352 place count 281 transition count 355
Iterating global reduction 2 with 33 rules applied. Total rules applied 385 place count 281 transition count 355
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 406 place count 260 transition count 334
Iterating global reduction 2 with 21 rules applied. Total rules applied 427 place count 260 transition count 334
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 432 place count 260 transition count 329
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 438 place count 254 transition count 323
Iterating global reduction 3 with 6 rules applied. Total rules applied 444 place count 254 transition count 323
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 446 place count 252 transition count 321
Iterating global reduction 3 with 2 rules applied. Total rules applied 448 place count 252 transition count 321
Applied a total of 448 rules in 97 ms. Remains 252 /477 variables (removed 225) and now considering 321/563 (removed 242) transitions.
// Phase 1: matrix 321 rows 252 cols
[2024-06-02 22:51:43] [INFO ] Computed 6 invariants in 26 ms
[2024-06-02 22:51:43] [INFO ] Implicit Places using invariants in 227 ms returned [7, 180]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 253 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 250/477 places, 321/563 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 356 ms. Remains : 250/477 places, 321/563 transitions.
Support contains 19 out of 250 places after structural reductions.
[2024-06-02 22:51:44] [INFO ] Flatten gal took : 52 ms
[2024-06-02 22:51:44] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:51:44] [INFO ] Input system was already deterministic with 321 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 11) 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 11) 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 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 321 rows 250 cols
[2024-06-02 22:51:44] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:51:45] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:51:45] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-06-02 22:51:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:51:45] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2024-06-02 22:51:45] [INFO ] After 439ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 144 ms.
[2024-06-02 22:51:45] [INFO ] After 738ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 8 properties in 22 ms.
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 321/321 transitions.
Graph (trivial) has 261 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 425 edges and 248 vertex of which 231 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 115 rules applied. Total rules applied 117 place count 231 transition count 188
Reduce places removed 98 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 99 rules applied. Total rules applied 216 place count 133 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 132 transition count 187
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 217 place count 132 transition count 167
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 257 place count 112 transition count 167
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 260 place count 109 transition count 164
Iterating global reduction 3 with 3 rules applied. Total rules applied 263 place count 109 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 265 place count 109 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 265 place count 109 transition count 161
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 108 transition count 161
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 270 place count 105 transition count 158
Iterating global reduction 4 with 3 rules applied. Total rules applied 273 place count 105 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 275 place count 105 transition count 156
Performed 45 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 365 place count 60 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 368 place count 60 transition count 93
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 371 place count 57 transition count 90
Iterating global reduction 6 with 3 rules applied. Total rules applied 374 place count 57 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 376 place count 56 transition count 89
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 402 place count 43 transition count 91
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 410 place count 43 transition count 83
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 420 place count 33 transition count 63
Iterating global reduction 7 with 10 rules applied. Total rules applied 430 place count 33 transition count 63
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 437 place count 33 transition count 56
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 440 place count 30 transition count 47
Iterating global reduction 8 with 3 rules applied. Total rules applied 443 place count 30 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 445 place count 30 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 447 place count 29 transition count 51
Free-agglomeration rule applied 6 times.
Iterating global reduction 9 with 6 rules applied. Total rules applied 453 place count 29 transition count 45
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 459 place count 23 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 460 place count 22 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 461 place count 21 transition count 44
Applied a total of 461 rules in 44 ms. Remains 21 /250 variables (removed 229) and now considering 44/321 (removed 277) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 21/250 places, 44/321 transitions.
Finished random walk after 190 steps, including 21 resets, run visited all 2 properties in 2 ms. (steps per millisecond=95 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 16 stabilizing places and 22 stable transitions
Graph (complete) has 428 edges and 250 vertex of which 243 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.10 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(F((p0||X(p1)))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 241 transition count 311
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 241 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 241 transition count 309
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 238 transition count 306
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 238 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 238 transition count 305
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 236 transition count 303
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 236 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 235 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 235 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 235 transition count 301
Applied a total of 34 rules in 22 ms. Remains 235 /250 variables (removed 15) and now considering 301/321 (removed 20) transitions.
// Phase 1: matrix 301 rows 235 cols
[2024-06-02 22:51:46] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 22:51:46] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 22:51:46] [INFO ] Invariant cache hit.
[2024-06-02 22:51:46] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-06-02 22:51:46] [INFO ] Invariant cache hit.
[2024-06-02 22:51:46] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 301/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 381 ms. Remains : 235/250 places, 301/321 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 226 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-12-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s211 0), p1:(EQ s185 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 274 ms.
Product exploration explored 100000 steps with 50000 reset in 246 ms.
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 406 edges and 235 vertex of which 230 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 15 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 29 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-12-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-12-LTLFireability-00 finished in 1212 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 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Graph (trivial) has 263 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 426 edges and 248 vertex of which 241 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 96 place count 240 transition count 216
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 190 place count 146 transition count 216
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 190 place count 146 transition count 195
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 232 place count 125 transition count 195
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 235 place count 122 transition count 192
Iterating global reduction 2 with 3 rules applied. Total rules applied 238 place count 122 transition count 192
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 238 place count 122 transition count 190
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 242 place count 120 transition count 190
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 243 place count 119 transition count 189
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 119 transition count 189
Performed 50 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 344 place count 69 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 348 place count 69 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 351 place count 66 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 354 place count 66 transition count 115
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 3 with 2 rules applied. Total rules applied 356 place count 65 transition count 114
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 384 place count 51 transition count 117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 393 place count 51 transition count 108
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 404 place count 40 transition count 86
Iterating global reduction 4 with 11 rules applied. Total rules applied 415 place count 40 transition count 86
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 423 place count 40 transition count 78
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 426 place count 37 transition count 69
Iterating global reduction 5 with 3 rules applied. Total rules applied 429 place count 37 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 431 place count 37 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 433 place count 36 transition count 73
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 443 place count 36 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 445 place count 34 transition count 61
Applied a total of 445 rules in 41 ms. Remains 34 /250 variables (removed 216) and now considering 61/321 (removed 260) transitions.
[2024-06-02 22:51:47] [INFO ] Flow matrix only has 57 transitions (discarded 4 similar events)
// Phase 1: matrix 57 rows 34 cols
[2024-06-02 22:51:47] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:51:47] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-02 22:51:47] [INFO ] Flow matrix only has 57 transitions (discarded 4 similar events)
[2024-06-02 22:51:47] [INFO ] Invariant cache hit.
[2024-06-02 22:51:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:47] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-06-02 22:51:47] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:51:47] [INFO ] Flow matrix only has 57 transitions (discarded 4 similar events)
[2024-06-02 22:51:47] [INFO ] Invariant cache hit.
[2024-06-02 22:51:47] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/250 places, 61/321 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 34/250 places, 61/321 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLFireability-01 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 s28 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 6 steps with 0 reset in 1 ms.
FORMULA CO4-PT-12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-01 finished in 216 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||G(F(p1)))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 242 transition count 312
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 242 transition count 312
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 242 transition count 310
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 239 transition count 307
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 239 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 239 transition count 306
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 237 transition count 304
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 237 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 236 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 236 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 236 transition count 302
Applied a total of 32 rules in 16 ms. Remains 236 /250 variables (removed 14) and now considering 302/321 (removed 19) transitions.
// Phase 1: matrix 302 rows 236 cols
[2024-06-02 22:51:47] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:51:47] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 22:51:47] [INFO ] Invariant cache hit.
[2024-06-02 22:51:47] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-06-02 22:51:47] [INFO ] Invariant cache hit.
[2024-06-02 22:51:47] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/250 places, 302/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 317 ms. Remains : 236/250 places, 302/321 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CO4-PT-12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s128 1), p1:(EQ s203 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA CO4-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-03 finished in 522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Graph (trivial) has 261 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 426 edges and 248 vertex of which 241 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 240 transition count 219
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 184 place count 149 transition count 219
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 184 place count 149 transition count 198
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 226 place count 128 transition count 198
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 230 place count 124 transition count 193
Iterating global reduction 2 with 4 rules applied. Total rules applied 234 place count 124 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 236 place count 124 transition count 191
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 236 place count 124 transition count 189
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 240 place count 122 transition count 189
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 241 place count 121 transition count 188
Iterating global reduction 3 with 1 rules applied. Total rules applied 242 place count 121 transition count 188
Performed 49 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 340 place count 72 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 343 place count 72 transition count 121
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 346 place count 69 transition count 118
Iterating global reduction 4 with 3 rules applied. Total rules applied 349 place count 69 transition count 118
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 351 place count 68 transition count 117
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 379 place count 54 transition count 120
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 387 place count 54 transition count 112
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 398 place count 43 transition count 90
Iterating global reduction 5 with 11 rules applied. Total rules applied 409 place count 43 transition count 90
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 416 place count 43 transition count 83
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 419 place count 40 transition count 74
Iterating global reduction 6 with 3 rules applied. Total rules applied 422 place count 40 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 424 place count 40 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 426 place count 39 transition count 79
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 435 place count 39 transition count 70
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 437 place count 39 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 439 place count 37 transition count 68
Applied a total of 439 rules in 33 ms. Remains 37 /250 variables (removed 213) and now considering 68/321 (removed 253) transitions.
[2024-06-02 22:51:48] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
// Phase 1: matrix 64 rows 37 cols
[2024-06-02 22:51:48] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:51:48] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-02 22:51:48] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 22:51:48] [INFO ] Invariant cache hit.
[2024-06-02 22:51:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:48] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-06-02 22:51:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:51:48] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 22:51:48] [INFO ] Invariant cache hit.
[2024-06-02 22:51:48] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/250 places, 68/321 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 37/250 places, 68/321 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s23 1) (NEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 136 ms.
Product exploration explored 100000 steps with 14 reset in 87 ms.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4983 steps, including 599 resets, run visited all 1 properties in 23 ms. (steps per millisecond=216 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 68/68 transitions.
Applied a total of 0 rules in 4 ms. Remains 37 /37 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-06-02 22:51:49] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 22:51:49] [INFO ] Invariant cache hit.
[2024-06-02 22:51:49] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-02 22:51:49] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 22:51:49] [INFO ] Invariant cache hit.
[2024-06-02 22:51:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:49] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-06-02 22:51:49] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:51:49] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 22:51:49] [INFO ] Invariant cache hit.
[2024-06-02 22:51:49] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 37/37 places, 68/68 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1191 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 149 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 27950 steps, run visited all 1 properties in 48 ms. (steps per millisecond=582 )
Probabilistic random walk after 27950 steps, saw 6161 distinct states, run finished after 48 ms. (steps per millisecond=582 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16 reset in 67 ms.
Product exploration explored 100000 steps with 11 reset in 70 ms.
Built C files in :
/tmp/ltsmin12700499821710294132
[2024-06-02 22:51:50] [INFO ] Computing symmetric may disable matrix : 68 transitions.
[2024-06-02 22:51:50] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:51:50] [INFO ] Computing symmetric may enable matrix : 68 transitions.
[2024-06-02 22:51:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:51:50] [INFO ] Computing Do-Not-Accords matrix : 68 transitions.
[2024-06-02 22:51:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:51:50] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12700499821710294132
Running compilation step : cd /tmp/ltsmin12700499821710294132;'/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 245 ms.
Running link step : cd /tmp/ltsmin12700499821710294132;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12700499821710294132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13113756446318798892.hoa' '--buchi-type=spotba'
LTSmin run took 155 ms.
FORMULA CO4-PT-12-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-12-LTLFireability-06 finished in 2504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Graph (trivial) has 261 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 426 edges and 248 vertex of which 243 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 95 place count 242 transition count 219
Reduce places removed 93 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 94 rules applied. Total rules applied 189 place count 149 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 190 place count 148 transition count 218
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 190 place count 148 transition count 197
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 232 place count 127 transition count 197
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 236 place count 123 transition count 192
Iterating global reduction 3 with 4 rules applied. Total rules applied 240 place count 123 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 242 place count 123 transition count 190
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 242 place count 123 transition count 188
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 246 place count 121 transition count 188
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 247 place count 120 transition count 187
Iterating global reduction 4 with 1 rules applied. Total rules applied 248 place count 120 transition count 187
Performed 49 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 346 place count 71 transition count 123
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 352 place count 71 transition count 117
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 355 place count 68 transition count 114
Iterating global reduction 5 with 3 rules applied. Total rules applied 358 place count 68 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 360 place count 67 transition count 113
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 388 place count 53 transition count 116
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 397 place count 53 transition count 107
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 408 place count 42 transition count 85
Iterating global reduction 6 with 11 rules applied. Total rules applied 419 place count 42 transition count 85
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 427 place count 42 transition count 77
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 430 place count 39 transition count 68
Iterating global reduction 7 with 3 rules applied. Total rules applied 433 place count 39 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 435 place count 39 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 437 place count 38 transition count 72
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 445 place count 38 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 447 place count 36 transition count 62
Applied a total of 447 rules in 35 ms. Remains 36 /250 variables (removed 214) and now considering 62/321 (removed 259) transitions.
[2024-06-02 22:51:50] [INFO ] Flow matrix only has 59 transitions (discarded 3 similar events)
// Phase 1: matrix 59 rows 36 cols
[2024-06-02 22:51:50] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:51:50] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-02 22:51:50] [INFO ] Flow matrix only has 59 transitions (discarded 3 similar events)
[2024-06-02 22:51:50] [INFO ] Invariant cache hit.
[2024-06-02 22:51:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:50] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-06-02 22:51:50] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:51:50] [INFO ] Flow matrix only has 59 transitions (discarded 3 similar events)
[2024-06-02 22:51:50] [INFO ] Invariant cache hit.
[2024-06-02 22:51:50] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/250 places, 62/321 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165 ms. Remains : 36/250 places, 62/321 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-12-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s23 1), p0:(EQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA CO4-PT-12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-08 finished in 252 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)||G((F(p1)&&F(p2))))))'
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Graph (trivial) has 257 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 426 edges and 248 vertex of which 241 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 91 place count 240 transition count 221
Reduce places removed 89 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 91 rules applied. Total rules applied 182 place count 151 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 184 place count 149 transition count 219
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 184 place count 149 transition count 198
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 226 place count 128 transition count 198
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 229 place count 125 transition count 194
Iterating global reduction 3 with 3 rules applied. Total rules applied 232 place count 125 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 234 place count 125 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 234 place count 125 transition count 191
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 236 place count 124 transition count 191
Performed 50 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 336 place count 74 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 339 place count 74 transition count 121
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 342 place count 71 transition count 118
Iterating global reduction 5 with 3 rules applied. Total rules applied 345 place count 71 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 347 place count 70 transition count 117
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 373 place count 57 transition count 120
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 381 place count 57 transition count 112
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 391 place count 47 transition count 92
Iterating global reduction 6 with 10 rules applied. Total rules applied 401 place count 47 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 407 place count 47 transition count 86
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 410 place count 44 transition count 77
Iterating global reduction 7 with 3 rules applied. Total rules applied 413 place count 44 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 415 place count 44 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 417 place count 43 transition count 83
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 426 place count 43 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 428 place count 41 transition count 72
Applied a total of 428 rules in 41 ms. Remains 41 /250 variables (removed 209) and now considering 72/321 (removed 249) transitions.
[2024-06-02 22:51:50] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
// Phase 1: matrix 68 rows 41 cols
[2024-06-02 22:51:50] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:51:50] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 22:51:50] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-06-02 22:51:50] [INFO ] Invariant cache hit.
[2024-06-02 22:51:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:50] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-06-02 22:51:50] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:51:50] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-06-02 22:51:50] [INFO ] Invariant cache hit.
[2024-06-02 22:51:51] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/250 places, 72/321 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 41/250 places, 72/321 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s11 0), p1:(EQ s8 0), p2:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 59 reset in 144 ms.
Product exploration explored 100000 steps with 22 reset in 73 ms.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 1216 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 153 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 156 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 22:51:51] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-06-02 22:51:51] [INFO ] Invariant cache hit.
[2024-06-02 22:51:51] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:51:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:51:51] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-06-02 22:51:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:51] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-06-02 22:51:51] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-06-02 22:51:51] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 72/72 transitions.
Graph (complete) has 109 edges and 41 vertex of which 33 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 15 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 33 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 32 transition count 54
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 32 transition count 53
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 31 transition count 53
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 28 transition count 50
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 28 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 31 place count 28 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 27 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 37 place count 27 transition count 42
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 44 place count 27 transition count 35
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 11 rules applied. Total rules applied 55 place count 19 transition count 32
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 57 place count 18 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 58 place count 17 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 58 place count 17 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 60 place count 16 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 66 place count 13 transition count 27
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 72 place count 13 transition count 21
Applied a total of 72 rules in 8 ms. Remains 13 /41 variables (removed 28) and now considering 21/72 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 13/41 places, 21/72 transitions.
Finished random walk after 53 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=53 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 197 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 41 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2024-06-02 22:51:52] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-06-02 22:51:52] [INFO ] Invariant cache hit.
[2024-06-02 22:51:52] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 22:51:52] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-06-02 22:51:52] [INFO ] Invariant cache hit.
[2024-06-02 22:51:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:52] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-06-02 22:51:52] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:51:52] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-06-02 22:51:52] [INFO ] Invariant cache hit.
[2024-06-02 22:51:52] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 41/41 places, 72/72 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 6682 steps, including 815 resets, run visited all 2 properties in 14 ms. (steps per millisecond=477 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 5 factoid took 144 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 91 reset in 34 ms.
Product exploration explored 100000 steps with 8 reset in 36 ms.
Built C files in :
/tmp/ltsmin114517350720854764
[2024-06-02 22:51:53] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2024-06-02 22:51:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:51:53] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2024-06-02 22:51:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:51:53] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2024-06-02 22:51:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:51:53] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin114517350720854764
Running compilation step : cd /tmp/ltsmin114517350720854764;'/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 161 ms.
Running link step : cd /tmp/ltsmin114517350720854764;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin114517350720854764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17179897424384333615.hoa' '--buchi-type=spotba'
LTSmin run took 93 ms.
FORMULA CO4-PT-12-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-12-LTLFireability-10 finished in 2613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Graph (trivial) has 261 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 426 edges and 248 vertex of which 241 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 240 transition count 218
Reduce places removed 92 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 94 rules applied. Total rules applied 188 place count 148 transition count 216
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 190 place count 146 transition count 216
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 190 place count 146 transition count 195
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 232 place count 125 transition count 195
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 236 place count 121 transition count 190
Iterating global reduction 3 with 4 rules applied. Total rules applied 240 place count 121 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 242 place count 121 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 242 place count 121 transition count 186
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 246 place count 119 transition count 186
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 247 place count 118 transition count 185
Iterating global reduction 4 with 1 rules applied. Total rules applied 248 place count 118 transition count 185
Performed 49 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 346 place count 69 transition count 122
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 353 place count 69 transition count 115
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 356 place count 66 transition count 112
Iterating global reduction 5 with 3 rules applied. Total rules applied 359 place count 66 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 361 place count 65 transition count 111
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 389 place count 51 transition count 114
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 398 place count 51 transition count 105
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 409 place count 40 transition count 83
Iterating global reduction 6 with 11 rules applied. Total rules applied 420 place count 40 transition count 83
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 428 place count 40 transition count 75
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 431 place count 37 transition count 66
Iterating global reduction 7 with 3 rules applied. Total rules applied 434 place count 37 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 436 place count 37 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 438 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 446 place count 36 transition count 62
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 448 place count 34 transition count 60
Applied a total of 448 rules in 26 ms. Remains 34 /250 variables (removed 216) and now considering 60/321 (removed 261) transitions.
[2024-06-02 22:51:53] [INFO ] Flow matrix only has 57 transitions (discarded 3 similar events)
// Phase 1: matrix 57 rows 34 cols
[2024-06-02 22:51:53] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:51:53] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-02 22:51:53] [INFO ] Flow matrix only has 57 transitions (discarded 3 similar events)
[2024-06-02 22:51:53] [INFO ] Invariant cache hit.
[2024-06-02 22:51:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:53] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-06-02 22:51:53] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:51:53] [INFO ] Flow matrix only has 57 transitions (discarded 3 similar events)
[2024-06-02 22:51:53] [INFO ] Invariant cache hit.
[2024-06-02 22:51:53] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/250 places, 60/321 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 34/250 places, 60/321 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLFireability-11 automaton TGBA Formula[mat=[[{ 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, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA CO4-PT-12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-11 finished in 189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(p1||X(p2)||F(p3)))))'
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 244 transition count 315
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 244 transition count 315
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 241 transition count 312
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 241 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 241 transition count 311
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 239 transition count 309
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 239 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 238 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 238 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 238 transition count 307
Applied a total of 26 rules in 17 ms. Remains 238 /250 variables (removed 12) and now considering 307/321 (removed 14) transitions.
// Phase 1: matrix 307 rows 238 cols
[2024-06-02 22:51:53] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:51:53] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 22:51:53] [INFO ] Invariant cache hit.
[2024-06-02 22:51:53] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-06-02 22:51:53] [INFO ] Invariant cache hit.
[2024-06-02 22:51:53] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/250 places, 307/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 238/250 places, 307/321 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p3)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : CO4-PT-12-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(OR p1 p3), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p3 p0) (AND p0 p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p3 p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=5, aps=[p0:(EQ s30 1), p1:(EQ s4 1), p3:(AND (EQ s30 0) (EQ s138 1)), p2:(EQ s231 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CO4-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-13 finished in 557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 241 transition count 311
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 241 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 241 transition count 309
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 238 transition count 306
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 238 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 238 transition count 305
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 236 transition count 303
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 236 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 235 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 235 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 235 transition count 301
Applied a total of 34 rules in 18 ms. Remains 235 /250 variables (removed 15) and now considering 301/321 (removed 20) transitions.
// Phase 1: matrix 301 rows 235 cols
[2024-06-02 22:51:54] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:51:54] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 22:51:54] [INFO ] Invariant cache hit.
[2024-06-02 22:51:54] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-06-02 22:51:54] [INFO ] Invariant cache hit.
[2024-06-02 22:51:54] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 301/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 235/250 places, 301/321 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLFireability-14 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: 2}]], initial=3, aps=[p0:(OR (NEQ s47 1) (NEQ s116 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][false, false, false, false]]
Product exploration explored 100000 steps with 6 reset in 116 ms.
Product exploration explored 100000 steps with 20 reset in 111 ms.
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 406 edges and 235 vertex of which 230 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 15 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 184 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 78 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2287102 steps, run timeout after 3001 ms. (steps per millisecond=762 ) properties seen :{}
Probabilistic random walk after 2287102 steps, saw 380255 distinct states, run finished after 3002 ms. (steps per millisecond=761 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:51:58] [INFO ] Invariant cache hit.
[2024-06-02 22:51:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:51:58] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-12-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-12-LTLFireability-14 finished in 4276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)||X(F(p2)))))'
Support contains 3 out of 250 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 244 transition count 314
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 244 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 244 transition count 312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 242 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 242 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 241 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 241 transition count 309
Applied a total of 20 rules in 14 ms. Remains 241 /250 variables (removed 9) and now considering 309/321 (removed 12) transitions.
// Phase 1: matrix 309 rows 241 cols
[2024-06-02 22:51:58] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:51:58] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 22:51:58] [INFO ] Invariant cache hit.
[2024-06-02 22:51:58] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-06-02 22:51:58] [INFO ] Invariant cache hit.
[2024-06-02 22:51:58] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/250 places, 309/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 241/250 places, 309/321 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-12-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s169 1), p2:(AND (EQ s106 1) (EQ s170 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][false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA CO4-PT-12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-15 finished in 404 ms.
All properties solved by simple procedures.
Total runtime 15515 ms.

BK_STOP 1717368720322

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-12"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CO4-PT-12, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r571-tall-171734910100058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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