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.r043-smll-171620180500278.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 BART-PT-002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180500278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 231K Apr 12 21:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 891K Apr 12 21:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Apr 12 21:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 351K Apr 12 21:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 105K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 278K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 31K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 405K Apr 12 22:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 12 22:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 383K Apr 12 21:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 12 21:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 37K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 534K May 18 16:42 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 BART-PT-002-LTLFireability-00
FORMULA_NAME BART-PT-002-LTLFireability-01
FORMULA_NAME BART-PT-002-LTLFireability-02
FORMULA_NAME BART-PT-002-LTLFireability-03
FORMULA_NAME BART-PT-002-LTLFireability-04
FORMULA_NAME BART-PT-002-LTLFireability-05
FORMULA_NAME BART-PT-002-LTLFireability-06
FORMULA_NAME BART-PT-002-LTLFireability-07
FORMULA_NAME BART-PT-002-LTLFireability-08
FORMULA_NAME BART-PT-002-LTLFireability-09
FORMULA_NAME BART-PT-002-LTLFireability-10
FORMULA_NAME BART-PT-002-LTLFireability-11
FORMULA_NAME BART-PT-002-LTLFireability-12
FORMULA_NAME BART-PT-002-LTLFireability-13
FORMULA_NAME BART-PT-002-LTLFireability-14
FORMULA_NAME BART-PT-002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716347235936

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=BART-PT-002
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 03:07:18] [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-05-22 03:07:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:07:18] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2024-05-22 03:07:18] [INFO ] Transformed 474 places.
[2024-05-22 03:07:18] [INFO ] Transformed 404 transitions.
[2024-05-22 03:07:18] [INFO ] Found NUPN structural information;
[2024-05-22 03:07:18] [INFO ] Parsed PT model containing 474 places and 404 transitions and 3240 arcs in 282 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-002-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 264 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 27 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 264 cols
[2024-05-22 03:07:19] [INFO ] Computed 2 invariants in 29 ms
[2024-05-22 03:07:19] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-22 03:07:19] [INFO ] Invariant cache hit.
[2024-05-22 03:07:19] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2024-05-22 03:07:20] [INFO ] Invariant cache hit.
[2024-05-22 03:07:20] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1173 ms. Remains : 264/264 places, 404/404 transitions.
Support contains 264 out of 264 places after structural reductions.
[2024-05-22 03:07:20] [INFO ] Flatten gal took : 94 ms
[2024-05-22 03:07:20] [INFO ] Flatten gal took : 45 ms
[2024-05-22 03:07:21] [INFO ] Input system was already deterministic with 404 transitions.
Finished random walk after 1168 steps, including 0 resets, run visited all 22 properties in 151 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
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 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 264 transition count 276
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 1 with 128 rules applied. Total rules applied 256 place count 136 transition count 276
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 256 place count 136 transition count 268
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 272 place count 128 transition count 268
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 284 place count 116 transition count 256
Iterating global reduction 2 with 12 rules applied. Total rules applied 296 place count 116 transition count 256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 298 place count 116 transition count 254
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 306 place count 108 transition count 246
Iterating global reduction 3 with 8 rules applied. Total rules applied 314 place count 108 transition count 246
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 320 place count 102 transition count 240
Iterating global reduction 3 with 6 rules applied. Total rules applied 326 place count 102 transition count 240
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 332 place count 96 transition count 234
Iterating global reduction 3 with 6 rules applied. Total rules applied 338 place count 96 transition count 234
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 342 place count 92 transition count 230
Iterating global reduction 3 with 4 rules applied. Total rules applied 346 place count 92 transition count 230
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 350 place count 88 transition count 226
Iterating global reduction 3 with 4 rules applied. Total rules applied 354 place count 88 transition count 226
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 356 place count 86 transition count 224
Iterating global reduction 3 with 2 rules applied. Total rules applied 358 place count 86 transition count 224
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 386 place count 72 transition count 210
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 394 place count 72 transition count 202
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 402 place count 68 transition count 198
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 410 place count 68 transition count 190
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 418 place count 64 transition count 186
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 426 place count 64 transition count 178
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 434 place count 60 transition count 174
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 442 place count 60 transition count 166
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 450 place count 56 transition count 162
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 458 place count 56 transition count 154
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 466 place count 52 transition count 150
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 474 place count 52 transition count 142
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 482 place count 48 transition count 138
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 490 place count 48 transition count 130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 498 place count 44 transition count 126
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 506 place count 44 transition count 118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 514 place count 40 transition count 114
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 522 place count 40 transition count 106
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 530 place count 36 transition count 102
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 538 place count 36 transition count 94
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 546 place count 32 transition count 90
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 554 place count 32 transition count 82
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 562 place count 28 transition count 78
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 570 place count 28 transition count 70
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 578 place count 24 transition count 66
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 586 place count 24 transition count 58
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 594 place count 20 transition count 54
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 602 place count 20 transition count 46
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 610 place count 16 transition count 42
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 618 place count 16 transition count 34
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 626 place count 12 transition count 30
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 18 with 8 rules applied. Total rules applied 634 place count 12 transition count 22
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 642 place count 8 transition count 18
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 19 with 10 rules applied. Total rules applied 652 place count 8 transition count 8
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 656 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 2 Pre rules applied. Total rules applied 656 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 4 rules applied. Total rules applied 660 place count 4 transition count 4
Applied a total of 660 rules in 158 ms. Remains 4 /264 variables (removed 260) and now considering 4/404 (removed 400) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-22 03:07:21] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 03:07:21] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-22 03:07:21] [INFO ] Invariant cache hit.
[2024-05-22 03:07:21] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-22 03:07:21] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 03:07:21] [INFO ] Invariant cache hit.
[2024-05-22 03:07:22] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/264 places, 4/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 248 ms. Remains : 4/264 places, 4/404 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 244 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-002-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 1) (EQ s3 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]]
Product exploration explored 100000 steps with 50000 reset in 409 ms.
Product exploration explored 100000 steps with 50000 reset in 262 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 21 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-002-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-002-LTLFireability-00 finished in 1263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(G(p1))))))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 200 transition count 340
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 200 transition count 340
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 182 place count 146 transition count 286
Iterating global reduction 0 with 54 rules applied. Total rules applied 236 place count 146 transition count 286
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 244 place count 138 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 252 place count 138 transition count 278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 258 place count 132 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 264 place count 132 transition count 272
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 270 place count 126 transition count 266
Iterating global reduction 0 with 6 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 282 place count 120 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 294 place count 114 transition count 254
Iterating global reduction 0 with 6 rules applied. Total rules applied 300 place count 114 transition count 254
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 306 place count 108 transition count 248
Iterating global reduction 0 with 6 rules applied. Total rules applied 312 place count 108 transition count 248
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 316 place count 104 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 320 place count 104 transition count 244
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 324 place count 100 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 328 place count 100 transition count 240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 330 place count 98 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 332 place count 98 transition count 238
Applied a total of 332 rules in 60 ms. Remains 98 /264 variables (removed 166) and now considering 238/404 (removed 166) transitions.
// Phase 1: matrix 238 rows 98 cols
[2024-05-22 03:07:23] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 03:07:23] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 03:07:23] [INFO ] Invariant cache hit.
[2024-05-22 03:07:23] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-22 03:07:23] [INFO ] Invariant cache hit.
[2024-05-22 03:07:23] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/264 places, 238/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 424 ms. Remains : 98/264 places, 238/404 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-002-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s2 1) (EQ s3 1)), p0:(AND (EQ s2 0) (EQ s3 0))], 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]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 1 ms.
FORMULA BART-PT-002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-01 finished in 579 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 178 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 264 transition count 400
Reduce places removed 4 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 22 rules applied. Total rules applied 26 place count 260 transition count 382
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 44 place count 242 transition count 382
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 44 place count 242 transition count 374
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 60 place count 234 transition count 374
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 72 place count 222 transition count 362
Iterating global reduction 3 with 12 rules applied. Total rules applied 84 place count 222 transition count 362
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 222 transition count 360
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 92 place count 216 transition count 354
Iterating global reduction 4 with 6 rules applied. Total rules applied 98 place count 216 transition count 354
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 104 place count 210 transition count 348
Iterating global reduction 4 with 6 rules applied. Total rules applied 110 place count 210 transition count 348
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 116 place count 204 transition count 342
Iterating global reduction 4 with 6 rules applied. Total rules applied 122 place count 204 transition count 342
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 126 place count 200 transition count 338
Iterating global reduction 4 with 4 rules applied. Total rules applied 130 place count 200 transition count 338
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 134 place count 196 transition count 334
Iterating global reduction 4 with 4 rules applied. Total rules applied 138 place count 196 transition count 334
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 140 place count 194 transition count 332
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 194 transition count 332
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 166 place count 182 transition count 320
Applied a total of 166 rules in 67 ms. Remains 182 /264 variables (removed 82) and now considering 320/404 (removed 84) transitions.
// Phase 1: matrix 320 rows 182 cols
[2024-05-22 03:07:23] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 03:07:23] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 03:07:23] [INFO ] Invariant cache hit.
[2024-05-22 03:07:23] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-22 03:07:23] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-22 03:07:23] [INFO ] Invariant cache hit.
[2024-05-22 03:07:24] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 182/264 places, 320/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 527 ms. Remains : 182/264 places, 320/404 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-002-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 1) (EQ s3 1) (AND (EQ s129 0) (EQ s59 0) (EQ s78 0) (EQ s61 0) (EQ s127 0) (EQ s142 0) (EQ s80 0) (EQ s125 0) (EQ s171 0) (EQ s145 0) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 908 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA BART-PT-002-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-02 finished in 1653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 138 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 258 transition count 398
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 258 transition count 398
Applied a total of 12 rules in 7 ms. Remains 258 /264 variables (removed 6) and now considering 398/404 (removed 6) transitions.
// Phase 1: matrix 398 rows 258 cols
[2024-05-22 03:07:25] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 03:07:25] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 03:07:25] [INFO ] Invariant cache hit.
[2024-05-22 03:07:25] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-05-22 03:07:25] [INFO ] Invariant cache hit.
[2024-05-22 03:07:25] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 258/264 places, 398/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 590 ms. Remains : 258/264 places, 398/404 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-002-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s86 1) (EQ s92 1) (EQ s236 1) (EQ s8 1) (EQ s166 1) (EQ s151 1) (EQ s85 1) (EQ s172 1) (EQ s77 1) (EQ s157 1) (EQ s165 1) (EQ s78 1) (EQ s9 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 774 ms.
Product exploration explored 100000 steps with 50000 reset in 666 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-002-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-002-LTLFireability-03 finished in 2267 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&&F(G(p1)))))'
Support contains 178 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 246 transition count 386
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 246 transition count 386
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 234 transition count 374
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 234 transition count 374
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 228 transition count 368
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 228 transition count 368
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 222 transition count 362
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 222 transition count 362
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 216 transition count 356
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 216 transition count 356
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 102 place count 210 transition count 350
Iterating global reduction 0 with 6 rules applied. Total rules applied 108 place count 210 transition count 350
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 112 place count 206 transition count 346
Iterating global reduction 0 with 4 rules applied. Total rules applied 116 place count 206 transition count 346
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 120 place count 202 transition count 342
Iterating global reduction 0 with 4 rules applied. Total rules applied 124 place count 202 transition count 342
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 126 place count 200 transition count 340
Iterating global reduction 0 with 2 rules applied. Total rules applied 128 place count 200 transition count 340
Applied a total of 128 rules in 16 ms. Remains 200 /264 variables (removed 64) and now considering 340/404 (removed 64) transitions.
// Phase 1: matrix 340 rows 200 cols
[2024-05-22 03:07:27] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 03:07:27] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 03:07:27] [INFO ] Invariant cache hit.
[2024-05-22 03:07:27] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-05-22 03:07:27] [INFO ] Invariant cache hit.
[2024-05-22 03:07:27] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 200/264 places, 340/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 528 ms. Remains : 200/264 places, 340/404 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BART-PT-002-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s145 1) (EQ s69 1) (EQ s90 1) (EQ s71 1) (EQ s143 1) (EQ s160 1) (EQ s92 1) (EQ s141 1) (EQ s189 1) (EQ s163 1) (EQ s26 1) (EQ s187 1) (EQ s135...], 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]]
Product exploration explored 100000 steps with 0 reset in 214 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 1 ms.
FORMULA BART-PT-002-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-04 finished in 955 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)||F(G((p1&&(p1 U X(p0)))))))'
Support contains 20 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 218 transition count 358
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 218 transition count 358
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 130 place count 180 transition count 320
Iterating global reduction 0 with 38 rules applied. Total rules applied 168 place count 180 transition count 320
Applied a total of 168 rules in 14 ms. Remains 180 /264 variables (removed 84) and now considering 320/404 (removed 84) transitions.
// Phase 1: matrix 320 rows 180 cols
[2024-05-22 03:07:28] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 03:07:28] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-22 03:07:28] [INFO ] Invariant cache hit.
[2024-05-22 03:07:28] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-05-22 03:07:28] [INFO ] Invariant cache hit.
[2024-05-22 03:07:28] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/264 places, 320/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 554 ms. Remains : 180/264 places, 320/404 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-002-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(OR (EQ s0 1) (EQ s0 1) (EQ s1 1) (EQ s0 1) (EQ s1 1) (EQ s0 1) (EQ s1 1) (EQ s0 1) (EQ s0 1) (EQ s0 1) (EQ s1 1) (EQ s0 1) (EQ s1 1) (EQ s1 1) (EQ s1 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1274 reset in 713 ms.
Stack based approach found an accepted trace after 140 steps with 4 reset with depth 30 and stack size 30 in 2 ms.
FORMULA BART-PT-002-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-06 finished in 1614 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))&&F(p1)))'
Support contains 20 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 218 transition count 358
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 218 transition count 358
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 130 place count 180 transition count 320
Iterating global reduction 0 with 38 rules applied. Total rules applied 168 place count 180 transition count 320
Applied a total of 168 rules in 14 ms. Remains 180 /264 variables (removed 84) and now considering 320/404 (removed 84) transitions.
[2024-05-22 03:07:30] [INFO ] Invariant cache hit.
[2024-05-22 03:07:30] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 03:07:30] [INFO ] Invariant cache hit.
[2024-05-22 03:07:30] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2024-05-22 03:07:30] [INFO ] Invariant cache hit.
[2024-05-22 03:07:30] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/264 places, 320/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 180/264 places, 320/404 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-002-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s14 1) (EQ s54 1) (EQ s55 1) (EQ s24 1) (EQ s15 1) (EQ s49 1) (EQ s60 1) (EQ s48 1) (EQ s61 1) (EQ s67 1) (EQ s37 1) (EQ s10 1) (EQ s11 1) (EQ ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7006 reset in 583 ms.
Stack based approach found an accepted trace after 17369 steps with 1226 reset with depth 9 and stack size 9 in 61 ms.
FORMULA BART-PT-002-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-07 finished in 1366 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) U p1) U X((!p1||X((p2 U (p3||G(p2))))))))'
Support contains 4 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 202 transition count 342
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 202 transition count 342
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 175 place count 151 transition count 291
Iterating global reduction 0 with 51 rules applied. Total rules applied 226 place count 151 transition count 291
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 232 place count 145 transition count 285
Iterating global reduction 0 with 6 rules applied. Total rules applied 238 place count 145 transition count 285
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 243 place count 140 transition count 280
Iterating global reduction 0 with 5 rules applied. Total rules applied 248 place count 140 transition count 280
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 253 place count 135 transition count 275
Iterating global reduction 0 with 5 rules applied. Total rules applied 258 place count 135 transition count 275
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 263 place count 130 transition count 270
Iterating global reduction 0 with 5 rules applied. Total rules applied 268 place count 130 transition count 270
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 272 place count 126 transition count 266
Iterating global reduction 0 with 4 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 280 place count 122 transition count 262
Iterating global reduction 0 with 4 rules applied. Total rules applied 284 place count 122 transition count 262
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 286 place count 120 transition count 260
Iterating global reduction 0 with 2 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 289 place count 119 transition count 259
Iterating global reduction 0 with 1 rules applied. Total rules applied 290 place count 119 transition count 259
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 291 place count 118 transition count 258
Iterating global reduction 0 with 1 rules applied. Total rules applied 292 place count 118 transition count 258
Applied a total of 292 rules in 34 ms. Remains 118 /264 variables (removed 146) and now considering 258/404 (removed 146) transitions.
// Phase 1: matrix 258 rows 118 cols
[2024-05-22 03:07:31] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 03:07:31] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 03:07:31] [INFO ] Invariant cache hit.
[2024-05-22 03:07:31] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-22 03:07:31] [INFO ] Invariant cache hit.
[2024-05-22 03:07:31] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/264 places, 258/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 409 ms. Remains : 118/264 places, 258/404 transitions.
Stuttering acceptance computed with spot in 359 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p3) (NOT p2)), (AND p1 (NOT p0) (NOT p3) (NOT p2)), (AND p1 (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), true, (AND (NOT p3) (NOT p2) (NOT p0)), (AND p1 (NOT p3) (NOT p2)), (NOT p0)]
Running random walk in product with property : BART-PT-002-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p0), acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND p1 (NOT p3) p2), acceptance={} source=7 dest: 7}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(NEQ s16 1), p0:(EQ s104 1), p3:(AND (NEQ s103 1) (NEQ s31 1)), p2:(NEQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 32789 reset in 737 ms.
Product exploration explored 100000 steps with 32810 reset in 518 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p3 p2), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X p1), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3) p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND p1 (NOT p3) p2))), (X (X (NOT (AND p1 (NOT p3) p2))))]
Knowledge based reduction with 9 factoid took 264 ms. Reduced automaton from 9 states, 18 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Finished random walk after 595 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=119 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) p3 p2), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X p1), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3) p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND p1 (NOT p3) p2))), (X (X (NOT (AND p1 (NOT p3) p2)))), (F (AND p1 p2 (NOT p3))), (F (AND p1 (NOT p2) (NOT p3)))]
Knowledge based reduction with 9 factoid took 410 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 137 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Support contains 3 out of 118 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 258/258 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-22 03:07:34] [INFO ] Invariant cache hit.
[2024-05-22 03:07:34] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 03:07:34] [INFO ] Invariant cache hit.
[2024-05-22 03:07:34] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-22 03:07:34] [INFO ] Invariant cache hit.
[2024-05-22 03:07:35] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 462 ms. Remains : 118/118 places, 258/258 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p3), (X (X (NOT (AND p1 (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3)))))]
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Finished random walk after 1060 steps, including 0 resets, run visited all 2 properties in 13 ms. (steps per millisecond=81 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p3), (X (X (NOT (AND p1 (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (F (AND p1 p2 (NOT p3))), (F (AND p1 (NOT p2) (NOT p3)))]
Knowledge based reduction with 2 factoid took 232 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 142 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 115 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 32778 reset in 431 ms.
Product exploration explored 100000 steps with 32794 reset in 444 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 135 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 258/258 transitions.
Graph (trivial) has 250 edges and 118 vertex of which 99 / 118 are part of one of the 2 SCC in 4 ms
Free SCC test removed 97 places
Ensure Unique test removed 222 transitions
Reduce isomorphic transitions removed 222 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 21 transition count 36
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 21 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 21 transition count 34
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 21 transition count 34
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 21 transition count 34
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 27 place count 21 transition count 24
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 37 place count 11 transition count 14
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 47 place count 11 transition count 14
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 47 rules in 14 ms. Remains 11 /118 variables (removed 107) and now considering 14/258 (removed 244) transitions.
[2024-05-22 03:07:37] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 03:07:37] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 11 cols
[2024-05-22 03:07:37] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 03:07:37] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/118 places, 14/258 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46 ms. Remains : 11/118 places, 14/258 transitions.
Built C files in :
/tmp/ltsmin17626255621092586235
[2024-05-22 03:07:37] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17626255621092586235
Running compilation step : cd /tmp/ltsmin17626255621092586235;'/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 649 ms.
Running link step : cd /tmp/ltsmin17626255621092586235;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin17626255621092586235;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13195158602789653178.hoa' '--buchi-type=spotba'
LTSmin run took 147 ms.
FORMULA BART-PT-002-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-PT-002-LTLFireability-08 finished in 6887 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)))'
Support contains 1 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 200 transition count 340
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 200 transition count 340
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 182 place count 146 transition count 286
Iterating global reduction 0 with 54 rules applied. Total rules applied 236 place count 146 transition count 286
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 244 place count 138 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 252 place count 138 transition count 278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 258 place count 132 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 264 place count 132 transition count 272
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 270 place count 126 transition count 266
Iterating global reduction 0 with 6 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 282 place count 120 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 294 place count 114 transition count 254
Iterating global reduction 0 with 6 rules applied. Total rules applied 300 place count 114 transition count 254
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 306 place count 108 transition count 248
Iterating global reduction 0 with 6 rules applied. Total rules applied 312 place count 108 transition count 248
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 316 place count 104 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 320 place count 104 transition count 244
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 324 place count 100 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 328 place count 100 transition count 240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 330 place count 98 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 332 place count 98 transition count 238
Applied a total of 332 rules in 19 ms. Remains 98 /264 variables (removed 166) and now considering 238/404 (removed 166) transitions.
// Phase 1: matrix 238 rows 98 cols
[2024-05-22 03:07:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 03:07:38] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 03:07:38] [INFO ] Invariant cache hit.
[2024-05-22 03:07:38] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-22 03:07:38] [INFO ] Invariant cache hit.
[2024-05-22 03:07:38] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/264 places, 238/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 398 ms. Remains : 98/264 places, 238/404 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-002-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 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]]
Product exploration explored 100000 steps with 4398 reset in 130 ms.
Stack based approach found an accepted trace after 51 steps with 2 reset with depth 18 and stack size 18 in 0 ms.
FORMULA BART-PT-002-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-09 finished in 627 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)&&F(G((p1 U X(p2)))))))'
Support contains 3 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 201 transition count 341
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 201 transition count 341
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 179 place count 148 transition count 288
Iterating global reduction 0 with 53 rules applied. Total rules applied 232 place count 148 transition count 288
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 240 place count 140 transition count 280
Iterating global reduction 0 with 8 rules applied. Total rules applied 248 place count 140 transition count 280
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 254 place count 134 transition count 274
Iterating global reduction 0 with 6 rules applied. Total rules applied 260 place count 134 transition count 274
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 266 place count 128 transition count 268
Iterating global reduction 0 with 6 rules applied. Total rules applied 272 place count 128 transition count 268
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 278 place count 122 transition count 262
Iterating global reduction 0 with 6 rules applied. Total rules applied 284 place count 122 transition count 262
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 290 place count 116 transition count 256
Iterating global reduction 0 with 6 rules applied. Total rules applied 296 place count 116 transition count 256
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 302 place count 110 transition count 250
Iterating global reduction 0 with 6 rules applied. Total rules applied 308 place count 110 transition count 250
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 312 place count 106 transition count 246
Iterating global reduction 0 with 4 rules applied. Total rules applied 316 place count 106 transition count 246
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 320 place count 102 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 324 place count 102 transition count 242
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 326 place count 100 transition count 240
Iterating global reduction 0 with 2 rules applied. Total rules applied 328 place count 100 transition count 240
Applied a total of 328 rules in 25 ms. Remains 100 /264 variables (removed 164) and now considering 240/404 (removed 164) transitions.
// Phase 1: matrix 240 rows 100 cols
[2024-05-22 03:07:38] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 03:07:38] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 03:07:39] [INFO ] Invariant cache hit.
[2024-05-22 03:07:39] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-22 03:07:39] [INFO ] Invariant cache hit.
[2024-05-22 03:07:39] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/264 places, 240/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 100/264 places, 240/404 transitions.
Stuttering acceptance computed with spot in 373 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : BART-PT-002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s1 0), p1:(NEQ s46 1), p2:(EQ s8 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]]
Product exploration explored 100000 steps with 464 reset in 125 ms.
Stack based approach found an accepted trace after 46 steps with 2 reset with depth 41 and stack size 41 in 0 ms.
FORMULA BART-PT-002-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-10 finished in 878 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||X(F(p1)))))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 396 edges and 264 vertex of which 236 / 264 are part of one of the 2 SCC in 1 ms
Free SCC test removed 234 places
Ensure Unique test removed 363 transitions
Reduce isomorphic transitions removed 363 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 30 transition count 23
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 40 place count 12 transition count 20
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 11 transition count 18
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 46 place count 10 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 49 place count 9 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 52 place count 8 transition count 12
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 54 place count 7 transition count 11
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 56 place count 5 transition count 9
Iterating global reduction 7 with 2 rules applied. Total rules applied 58 place count 5 transition count 9
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 60 place count 5 transition count 7
Applied a total of 60 rules in 10 ms. Remains 5 /264 variables (removed 259) and now considering 7/404 (removed 397) transitions.
[2024-05-22 03:07:39] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 5 cols
[2024-05-22 03:07:39] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 03:07:39] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-22 03:07:39] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2024-05-22 03:07:39] [INFO ] Invariant cache hit.
[2024-05-22 03:07:39] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-22 03:07:39] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 03:07:39] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2024-05-22 03:07:39] [INFO ] Invariant cache hit.
[2024-05-22 03:07:39] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/264 places, 7/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 5/264 places, 7/404 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BART-PT-002-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 0), p1:(EQ s0 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]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-12 finished in 203 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)||X(G((p1||F(p0))))))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 201 transition count 341
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 201 transition count 341
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 179 place count 148 transition count 288
Iterating global reduction 0 with 53 rules applied. Total rules applied 232 place count 148 transition count 288
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 239 place count 141 transition count 281
Iterating global reduction 0 with 7 rules applied. Total rules applied 246 place count 141 transition count 281
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 251 place count 136 transition count 276
Iterating global reduction 0 with 5 rules applied. Total rules applied 256 place count 136 transition count 276
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 261 place count 131 transition count 271
Iterating global reduction 0 with 5 rules applied. Total rules applied 266 place count 131 transition count 271
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 271 place count 126 transition count 266
Iterating global reduction 0 with 5 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 281 place count 121 transition count 261
Iterating global reduction 0 with 5 rules applied. Total rules applied 286 place count 121 transition count 261
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 291 place count 116 transition count 256
Iterating global reduction 0 with 5 rules applied. Total rules applied 296 place count 116 transition count 256
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 299 place count 113 transition count 253
Iterating global reduction 0 with 3 rules applied. Total rules applied 302 place count 113 transition count 253
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 305 place count 110 transition count 250
Iterating global reduction 0 with 3 rules applied. Total rules applied 308 place count 110 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 309 place count 109 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 310 place count 109 transition count 249
Applied a total of 310 rules in 19 ms. Remains 109 /264 variables (removed 155) and now considering 249/404 (removed 155) transitions.
// Phase 1: matrix 249 rows 109 cols
[2024-05-22 03:07:40] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 03:07:40] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 03:07:40] [INFO ] Invariant cache hit.
[2024-05-22 03:07:40] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-22 03:07:40] [INFO ] Invariant cache hit.
[2024-05-22 03:07:40] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/264 places, 249/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 474 ms. Remains : 109/264 places, 249/404 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-002-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s7 1), p1:(EQ s0 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 1887 reset in 124 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 1 ms.
FORMULA BART-PT-002-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-13 finished in 764 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) U X(p1))||F(p2)))'
Support contains 3 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 201 transition count 341
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 201 transition count 341
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 179 place count 148 transition count 288
Iterating global reduction 0 with 53 rules applied. Total rules applied 232 place count 148 transition count 288
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 240 place count 140 transition count 280
Iterating global reduction 0 with 8 rules applied. Total rules applied 248 place count 140 transition count 280
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 254 place count 134 transition count 274
Iterating global reduction 0 with 6 rules applied. Total rules applied 260 place count 134 transition count 274
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 266 place count 128 transition count 268
Iterating global reduction 0 with 6 rules applied. Total rules applied 272 place count 128 transition count 268
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 278 place count 122 transition count 262
Iterating global reduction 0 with 6 rules applied. Total rules applied 284 place count 122 transition count 262
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 290 place count 116 transition count 256
Iterating global reduction 0 with 6 rules applied. Total rules applied 296 place count 116 transition count 256
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 302 place count 110 transition count 250
Iterating global reduction 0 with 6 rules applied. Total rules applied 308 place count 110 transition count 250
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 312 place count 106 transition count 246
Iterating global reduction 0 with 4 rules applied. Total rules applied 316 place count 106 transition count 246
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 320 place count 102 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 324 place count 102 transition count 242
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 326 place count 100 transition count 240
Iterating global reduction 0 with 2 rules applied. Total rules applied 328 place count 100 transition count 240
Applied a total of 328 rules in 20 ms. Remains 100 /264 variables (removed 164) and now considering 240/404 (removed 164) transitions.
// Phase 1: matrix 240 rows 100 cols
[2024-05-22 03:07:40] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 03:07:40] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 03:07:40] [INFO ] Invariant cache hit.
[2024-05-22 03:07:40] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-22 03:07:40] [INFO ] Invariant cache hit.
[2024-05-22 03:07:41] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/264 places, 240/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 100/264 places, 240/404 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BART-PT-002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s0 1), p2:(EQ s18 1), p1:(EQ s64 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 269 reset in 110 ms.
Stack based approach found an accepted trace after 60 steps with 0 reset with depth 61 and stack size 61 in 1 ms.
FORMULA BART-PT-002-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-14 finished in 851 ms.
All properties solved by simple procedures.
Total runtime 23085 ms.

BK_STOP 1716347262713

--------------------
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="BART-PT-002"
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 BART-PT-002, 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 r043-smll-171620180500278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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