About the Execution of 2023-gold for CO4-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 305.287 | 10156.00 | 19437.00 | 454.20 | FFTFFFFFTTFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r571-tall-171734910100048.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-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910100048
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K 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 132K 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-10-LTLFireability-00
FORMULA_NAME CO4-PT-10-LTLFireability-01
FORMULA_NAME CO4-PT-10-LTLFireability-02
FORMULA_NAME CO4-PT-10-LTLFireability-03
FORMULA_NAME CO4-PT-10-LTLFireability-04
FORMULA_NAME CO4-PT-10-LTLFireability-05
FORMULA_NAME CO4-PT-10-LTLFireability-06
FORMULA_NAME CO4-PT-10-LTLFireability-07
FORMULA_NAME CO4-PT-10-LTLFireability-08
FORMULA_NAME CO4-PT-10-LTLFireability-09
FORMULA_NAME CO4-PT-10-LTLFireability-10
FORMULA_NAME CO4-PT-10-LTLFireability-11
FORMULA_NAME CO4-PT-10-LTLFireability-12
FORMULA_NAME CO4-PT-10-LTLFireability-13
FORMULA_NAME CO4-PT-10-LTLFireability-14
FORMULA_NAME CO4-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717368669028
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-10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:51:10] [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:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:51:10] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-06-02 22:51:10] [INFO ] Transformed 544 places.
[2024-06-02 22:51:10] [INFO ] Transformed 615 transitions.
[2024-06-02 22:51:10] [INFO ] Found NUPN structural information;
[2024-06-02 22:51:10] [INFO ] Parsed PT model containing 544 places and 615 transitions and 1338 arcs in 131 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 6 formulas.
Deduced a syphon composed of 157 places in 9 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-10-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 438/438 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 375 transition count 435
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 76 place count 314 transition count 372
Iterating global reduction 1 with 61 rules applied. Total rules applied 137 place count 314 transition count 372
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 182 place count 269 transition count 327
Iterating global reduction 1 with 45 rules applied. Total rules applied 227 place count 269 transition count 327
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 229 place count 269 transition count 325
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 252 place count 246 transition count 302
Iterating global reduction 2 with 23 rules applied. Total rules applied 275 place count 246 transition count 302
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 289 place count 232 transition count 288
Iterating global reduction 2 with 14 rules applied. Total rules applied 303 place count 232 transition count 288
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 305 place count 232 transition count 286
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 311 place count 226 transition count 280
Iterating global reduction 3 with 6 rules applied. Total rules applied 317 place count 226 transition count 280
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 319 place count 224 transition count 278
Iterating global reduction 3 with 2 rules applied. Total rules applied 321 place count 224 transition count 278
Applied a total of 321 rules in 167 ms. Remains 224 /387 variables (removed 163) and now considering 278/438 (removed 160) transitions.
// Phase 1: matrix 278 rows 224 cols
[2024-06-02 22:51:11] [INFO ] Computed 4 invariants in 18 ms
[2024-06-02 22:51:11] [INFO ] Implicit Places using invariants in 195 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 261 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/387 places, 278/438 transitions.
Applied a total of 0 rules in 5 ms. Remains 223 /223 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 434 ms. Remains : 223/387 places, 278/438 transitions.
Support contains 22 out of 223 places after structural reductions.
[2024-06-02 22:51:11] [INFO ] Flatten gal took : 38 ms
[2024-06-02 22:51:11] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:51:11] [INFO ] Input system was already deterministic with 278 transitions.
Support contains 21 out of 223 places (down from 22) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 278 rows 223 cols
[2024-06-02 22:51:12] [INFO ] Computed 3 invariants in 4 ms
[2024-06-02 22:51:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-02 22:51:12] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-06-02 22:51:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-02 22:51:12] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2024-06-02 22:51:13] [INFO ] After 599ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 180 ms.
[2024-06-02 22:51:13] [INFO ] After 950ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 14 properties in 43 ms.
Support contains 3 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 278/278 transitions.
Graph (trivial) has 230 edges and 223 vertex of which 3 / 223 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 345 edges and 221 vertex of which 207 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 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 105 rules applied. Total rules applied 107 place count 207 transition count 158
Reduce places removed 92 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 93 rules applied. Total rules applied 200 place count 115 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 114 transition count 157
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 201 place count 114 transition count 137
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 241 place count 94 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 243 place count 92 transition count 135
Iterating global reduction 3 with 2 rules applied. Total rules applied 245 place count 92 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 246 place count 92 transition count 134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 246 place count 92 transition count 133
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 248 place count 91 transition count 133
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 250 place count 89 transition count 131
Iterating global reduction 4 with 2 rules applied. Total rules applied 252 place count 89 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 253 place count 89 transition count 130
Performed 37 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 327 place count 52 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 329 place count 52 transition count 83
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 331 place count 50 transition count 81
Iterating global reduction 6 with 2 rules applied. Total rules applied 333 place count 50 transition count 81
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 357 place count 38 transition count 82
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 365 place count 38 transition count 74
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 376 place count 27 transition count 52
Iterating global reduction 7 with 11 rules applied. Total rules applied 387 place count 27 transition count 52
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 395 place count 27 transition count 44
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 398 place count 24 transition count 35
Iterating global reduction 8 with 3 rules applied. Total rules applied 401 place count 24 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 403 place count 24 transition count 33
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 9 with 2 rules applied. Total rules applied 405 place count 23 transition count 40
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 408 place count 23 transition count 37
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 412 place count 23 transition count 33
Free-agglomeration rule applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 417 place count 23 transition count 28
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 423 place count 18 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 424 place count 17 transition count 26
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 8 edges and 15 vertex of which 2 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 11 with 3 rules applied. Total rules applied 427 place count 14 transition count 26
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 429 place count 14 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 430 place count 14 transition count 23
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 431 place count 13 transition count 21
Iterating global reduction 13 with 1 rules applied. Total rules applied 432 place count 13 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 433 place count 13 transition count 20
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 435 place count 13 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 437 place count 11 transition count 18
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 439 place count 11 transition count 16
Applied a total of 439 rules in 43 ms. Remains 11 /223 variables (removed 212) and now considering 16/278 (removed 262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 11/223 places, 16/278 transitions.
Finished random walk after 37 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=37 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CO4-PT-10-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 14 stabilizing places and 16 stable transitions
Graph (complete) has 348 edges and 223 vertex of which 217 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 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(((p1 U X(G(p2)))||p0)))'
Support contains 3 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 278/278 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 215 transition count 270
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 215 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 215 transition count 269
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 212 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 212 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 210 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 210 transition count 264
Applied a total of 27 rules in 14 ms. Remains 210 /223 variables (removed 13) and now considering 264/278 (removed 14) transitions.
// Phase 1: matrix 264 rows 210 cols
[2024-06-02 22:51:13] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 22:51:13] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 22:51:13] [INFO ] Invariant cache hit.
[2024-06-02 22:51:13] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-06-02 22:51:13] [INFO ] Invariant cache hit.
[2024-06-02 22:51:13] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 210/223 places, 264/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 210/223 places, 264/278 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 303 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Running random walk in product with property : CO4-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s121 1) (EQ s69 1)), p1:(EQ s69 1), p2:(EQ s176 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][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-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-10-LTLFireability-04 finished in 638 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))&&(p1 U X(p2))))'
Support contains 4 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 278/278 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 213 transition count 268
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 213 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 213 transition count 267
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 210 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 210 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 208 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 208 transition count 262
Applied a total of 31 rules in 17 ms. Remains 208 /223 variables (removed 15) and now considering 262/278 (removed 16) transitions.
// Phase 1: matrix 262 rows 208 cols
[2024-06-02 22:51:14] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:51:14] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 22:51:14] [INFO ] Invariant cache hit.
[2024-06-02 22:51:14] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-06-02 22:51:14] [INFO ] Invariant cache hit.
[2024-06-02 22:51:14] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 208/223 places, 262/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 263 ms. Remains : 208/223 places, 262/278 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), true]
Running random walk in product with property : CO4-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s93 1) (EQ s198 1)), p0:(EQ s173 0), p2:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-10-LTLFireability-05 finished in 472 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&&X(F(p1)))))'
Support contains 3 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 278/278 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 212 transition count 267
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 212 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 212 transition count 266
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 208 transition count 262
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 208 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 208 transition count 261
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 205 transition count 258
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 205 transition count 258
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 204 transition count 257
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 204 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 204 transition count 256
Applied a total of 41 rules in 15 ms. Remains 204 /223 variables (removed 19) and now considering 256/278 (removed 22) transitions.
// Phase 1: matrix 256 rows 204 cols
[2024-06-02 22:51:14] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:51:14] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 22:51:14] [INFO ] Invariant cache hit.
[2024-06-02 22:51:14] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-06-02 22:51:14] [INFO ] Invariant cache hit.
[2024-06-02 22:51:14] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/223 places, 256/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 257 ms. Remains : 204/223 places, 256/278 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CO4-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s131 1) (EQ s194 1)), p0:(EQ s157 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-10-LTLFireability-07 finished in 381 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&&X(G(p1))))) U (p2&&X(G((p0&&X(G(p1)))))))))'
Support contains 4 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 278/278 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 213 transition count 268
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 213 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 213 transition count 267
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 210 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 210 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 210 transition count 263
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 208 transition count 261
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 208 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 207 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 207 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 207 transition count 259
Applied a total of 35 rules in 12 ms. Remains 207 /223 variables (removed 16) and now considering 259/278 (removed 19) transitions.
// Phase 1: matrix 259 rows 207 cols
[2024-06-02 22:51:15] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:51:15] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 22:51:15] [INFO ] Invariant cache hit.
[2024-06-02 22:51:15] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-06-02 22:51:15] [INFO ] Invariant cache hit.
[2024-06-02 22:51:15] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/223 places, 259/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 247 ms. Remains : 207/223 places, 259/278 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CO4-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s65 1), p0:(EQ s33 1), p1:(AND (NEQ s101 1) (EQ s184 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CO4-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-10-LTLFireability-10 finished in 425 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)||F(G(p1))))))'
Support contains 2 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 278/278 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 213 transition count 268
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 213 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 213 transition count 267
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 210 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 210 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 210 transition count 263
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 208 transition count 261
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 208 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 207 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 207 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 207 transition count 259
Applied a total of 35 rules in 15 ms. Remains 207 /223 variables (removed 16) and now considering 259/278 (removed 19) transitions.
// Phase 1: matrix 259 rows 207 cols
[2024-06-02 22:51:15] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 22:51:15] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 22:51:15] [INFO ] Invariant cache hit.
[2024-06-02 22:51:15] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-06-02 22:51:15] [INFO ] Invariant cache hit.
[2024-06-02 22:51:15] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/223 places, 259/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 207/223 places, 259/278 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s92 1), p1:(EQ s191 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA CO4-PT-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-10-LTLFireability-11 finished in 395 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)&&F(p1)))'
Support contains 2 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 278/278 transitions.
Graph (trivial) has 229 edges and 223 vertex of which 3 / 223 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 346 edges and 221 vertex of which 215 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 90 place count 214 transition count 180
Reduce places removed 88 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 126 transition count 178
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 182 place count 124 transition count 178
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 182 place count 124 transition count 158
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 222 place count 104 transition count 158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 225 place count 101 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 228 place count 101 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 229 place count 101 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 229 place count 101 transition count 153
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 231 place count 100 transition count 153
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 233 place count 98 transition count 151
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 98 transition count 151
Performed 37 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 309 place count 61 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 312 place count 61 transition count 102
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 314 place count 59 transition count 100
Iterating global reduction 5 with 2 rules applied. Total rules applied 316 place count 59 transition count 100
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
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 344 place count 45 transition count 101
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 351 place count 45 transition count 94
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 362 place count 34 transition count 72
Iterating global reduction 6 with 11 rules applied. Total rules applied 373 place count 34 transition count 72
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 379 place count 34 transition count 66
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 382 place count 31 transition count 57
Iterating global reduction 7 with 3 rules applied. Total rules applied 385 place count 31 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 386 place count 31 transition count 56
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 388 place count 30 transition count 64
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 404 place count 30 transition count 48
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 408 place count 30 transition count 48
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 410 place count 28 transition count 46
Applied a total of 410 rules in 40 ms. Remains 28 /223 variables (removed 195) and now considering 46/278 (removed 232) transitions.
[2024-06-02 22:51:15] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
// Phase 1: matrix 44 rows 28 cols
[2024-06-02 22:51:15] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:51:15] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-02 22:51:15] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2024-06-02 22:51:15] [INFO ] Invariant cache hit.
[2024-06-02 22:51:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:51:15] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-06-02 22:51:15] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:51:15] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2024-06-02 22:51:15] [INFO ] Invariant cache hit.
[2024-06-02 22:51:16] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/223 places, 46/278 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 28/223 places, 46/278 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s5 1), p0:(EQ s14 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, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA CO4-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-10-LTLFireability-12 finished in 260 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 U G(p1)))&&(G(p2)||F(p3))))'
Support contains 3 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 278/278 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 214 transition count 269
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 214 transition count 269
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 214 transition count 268
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 210 transition count 264
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 210 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 210 transition count 263
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 207 transition count 260
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 207 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 206 transition count 259
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 206 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 206 transition count 258
Applied a total of 37 rules in 17 ms. Remains 206 /223 variables (removed 17) and now considering 258/278 (removed 20) transitions.
// Phase 1: matrix 258 rows 206 cols
[2024-06-02 22:51:16] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:51:16] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 22:51:16] [INFO ] Invariant cache hit.
[2024-06-02 22:51:16] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-06-02 22:51:16] [INFO ] Invariant cache hit.
[2024-06-02 22:51:16] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 206/223 places, 258/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 206/223 places, 258/278 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), (AND (NOT p3) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : CO4-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s156 0), p3:(EQ s183 0), p1:(NEQ s156 1), p0:(NEQ s70 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7 reset in 175 ms.
Product exploration explored 100000 steps with 29 reset in 120 ms.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 324 edges and 206 vertex of which 200 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p2 p3 p1 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p3), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p2 (NOT p3)))), true, (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 104 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 22:51:17] [INFO ] Invariant cache hit.
[2024-06-02 22:51:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-02 22:51:17] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-06-02 22:51:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-02 22:51:17] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-06-02 22:51:17] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-06-02 22:51:17] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 258/258 transitions.
Graph (trivial) has 215 edges and 206 vertex of which 3 / 206 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 321 edges and 204 vertex of which 191 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 96 rules applied. Total rules applied 98 place count 191 transition count 148
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 182 place count 107 transition count 148
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 182 place count 107 transition count 127
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 224 place count 86 transition count 127
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 225 place count 85 transition count 126
Iterating global reduction 2 with 1 rules applied. Total rules applied 226 place count 85 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 227 place count 85 transition count 125
Performed 32 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 291 place count 53 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 293 place count 53 transition count 83
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 296 place count 50 transition count 80
Iterating global reduction 4 with 3 rules applied. Total rules applied 299 place count 50 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 303 place count 48 transition count 78
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 111 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 6 rules applied. Total rules applied 309 place count 47 transition count 73
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 310 place count 47 transition count 72
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 314 place count 43 transition count 68
Iterating global reduction 6 with 4 rules applied. Total rules applied 318 place count 43 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 319 place count 43 transition count 67
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 325 place count 40 transition count 64
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 328 place count 40 transition count 61
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 331 place count 37 transition count 58
Iterating global reduction 8 with 3 rules applied. Total rules applied 334 place count 37 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 336 place count 37 transition count 56
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 337 place count 36 transition count 55
Iterating global reduction 9 with 1 rules applied. Total rules applied 338 place count 36 transition count 55
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 356 place count 27 transition count 56
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 371 place count 27 transition count 41
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 379 place count 19 transition count 33
Iterating global reduction 10 with 8 rules applied. Total rules applied 387 place count 19 transition count 33
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 393 place count 19 transition count 27
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 397 place count 19 transition count 23
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 398 place count 18 transition count 22
Iterating global reduction 11 with 1 rules applied. Total rules applied 399 place count 18 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 400 place count 18 transition count 21
Free-agglomeration rule applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 405 place count 18 transition count 16
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 410 place count 13 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 411 place count 13 transition count 15
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 413 place count 13 transition count 15
Graph (complete) has 23 edges and 13 vertex of which 12 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 1 rules applied. Total rules applied 414 place count 12 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 415 place count 12 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 416 place count 12 transition count 13
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 417 place count 12 transition count 13
Graph (complete) has 20 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 418 place count 11 transition count 13
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 419 place count 11 transition count 12
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 420 place count 11 transition count 12
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 421 place count 11 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 422 place count 10 transition count 10
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t60.t64.t255.t262 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 424 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 18 with 2 rules applied. Total rules applied 426 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 428 place count 5 transition count 6
Free-agglomeration rule applied 2 times.
Iterating global reduction 20 with 2 rules applied. Total rules applied 430 place count 5 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 432 place count 3 transition count 4
Applied a total of 432 rules in 29 ms. Remains 3 /206 variables (removed 203) and now considering 4/258 (removed 254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 3/206 places, 4/258 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p3 p1 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p3), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p2 (NOT p3)))), true, (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 17 factoid took 265 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-10-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-10-LTLFireability-15 finished in 1793 ms.
All properties solved by simple procedures.
Total runtime 7392 ms.
BK_STOP 1717368679184
--------------------
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-10"
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-10, 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-171734910100048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-10.tgz
mv CO4-PT-10 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 '
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 ;