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.r219-smll-171649597800053.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 HirschbergSinclair-PT-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r219-smll-171649597800053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 736K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 03:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 13 03:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 13 03:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 13 03:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 284K 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 HirschbergSinclair-PT-20-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716641382523

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=HirschbergSinclair-PT-20
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 12:49:45] [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-25 12:49:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 12:49:45] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-05-25 12:49:45] [INFO ] Transformed 530 places.
[2024-05-25 12:49:45] [INFO ] Transformed 485 transitions.
[2024-05-25 12:49:45] [INFO ] Parsed PT model containing 530 places and 485 transitions and 1479 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HirschbergSinclair-PT-20-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 530 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 485/485 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 510 transition count 485
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 36 place count 494 transition count 469
Iterating global reduction 1 with 16 rules applied. Total rules applied 52 place count 494 transition count 469
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 67 place count 479 transition count 454
Iterating global reduction 1 with 15 rules applied. Total rules applied 82 place count 479 transition count 454
Applied a total of 82 rules in 245 ms. Remains 479 /530 variables (removed 51) and now considering 454/485 (removed 31) transitions.
// Phase 1: matrix 454 rows 479 cols
[2024-05-25 12:49:46] [INFO ] Computed 25 invariants in 26 ms
[2024-05-25 12:49:46] [INFO ] Implicit Places using invariants in 699 ms returned []
[2024-05-25 12:49:46] [INFO ] Invariant cache hit.
[2024-05-25 12:49:48] [INFO ] Implicit Places using invariants and state equation in 1522 ms returned []
Implicit Place search using SMT with State Equation took 2398 ms to find 0 implicit places.
[2024-05-25 12:49:48] [INFO ] Invariant cache hit.
[2024-05-25 12:49:48] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 479/530 places, 454/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3267 ms. Remains : 479/530 places, 454/485 transitions.
Support contains 44 out of 479 places after structural reductions.
[2024-05-25 12:49:49] [INFO ] Flatten gal took : 169 ms
[2024-05-25 12:49:49] [INFO ] Flatten gal took : 49 ms
[2024-05-25 12:49:49] [INFO ] Input system was already deterministic with 454 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 37) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:49:49] [INFO ] Invariant cache hit.
[2024-05-25 12:49:50] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 64 ms returned sat
[2024-05-25 12:49:50] [INFO ] After 544ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:49:50] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 85 ms returned sat
[2024-05-25 12:49:51] [INFO ] After 502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:49:51] [INFO ] After 620ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-25 12:49:51] [INFO ] After 943ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 454/454 transitions.
Graph (complete) has 912 edges and 479 vertex of which 473 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 197 rules applied. Total rules applied 198 place count 473 transition count 257
Reduce places removed 191 places and 0 transitions.
Graph (complete) has 498 edges and 282 vertex of which 248 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 192 rules applied. Total rules applied 390 place count 248 transition count 257
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 424 place count 248 transition count 223
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 426 place count 246 transition count 221
Iterating global reduction 3 with 2 rules applied. Total rules applied 428 place count 246 transition count 221
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 1 rules applied. Total rules applied 429 place count 246 transition count 220
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 431 edges and 245 vertex of which 243 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 431 place count 243 transition count 220
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 433 place count 243 transition count 218
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 434 place count 242 transition count 217
Iterating global reduction 6 with 1 rules applied. Total rules applied 435 place count 242 transition count 217
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 6 with 14 rules applied. Total rules applied 449 place count 242 transition count 203
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 463 place count 228 transition count 203
Reduce places removed 19 places and 19 transitions.
Iterating global reduction 7 with 19 rules applied. Total rules applied 482 place count 209 transition count 184
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 7 with 45 rules applied. Total rules applied 527 place count 203 transition count 145
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 8 with 39 rules applied. Total rules applied 566 place count 164 transition count 145
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 15 Pre rules applied. Total rules applied 566 place count 164 transition count 130
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 596 place count 149 transition count 130
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 597 place count 148 transition count 130
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 597 place count 148 transition count 129
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 599 place count 147 transition count 129
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 605 place count 144 transition count 126
Applied a total of 605 rules in 199 ms. Remains 144 /479 variables (removed 335) and now considering 126/454 (removed 328) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 144/479 places, 126/454 transitions.
Incomplete random walk after 10000 steps, including 78 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Finished probabilistic random walk after 35026 steps, run visited all 1 properties in 211 ms. (steps per millisecond=166 )
Probabilistic random walk after 35026 steps, saw 9666 distinct states, run finished after 211 ms. (steps per millisecond=166 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HirschbergSinclair-PT-20-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 479 stabilizing places and 454 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 479 transition count 454
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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(p1))))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 474 transition count 449
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 474 transition count 449
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 470 transition count 445
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 470 transition count 445
Applied a total of 18 rules in 127 ms. Remains 470 /479 variables (removed 9) and now considering 445/454 (removed 9) transitions.
// Phase 1: matrix 445 rows 470 cols
[2024-05-25 12:49:52] [INFO ] Computed 25 invariants in 8 ms
[2024-05-25 12:49:53] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-25 12:49:53] [INFO ] Invariant cache hit.
[2024-05-25 12:49:54] [INFO ] Implicit Places using invariants and state equation in 1683 ms returned []
Implicit Place search using SMT with State Equation took 2112 ms to find 0 implicit places.
[2024-05-25 12:49:54] [INFO ] Invariant cache hit.
[2024-05-25 12:49:55] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 445/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2850 ms. Remains : 470/479 places, 445/454 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 452 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(GEQ s417 1), p1:(GEQ s238 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLFireability-00 finished in 3403 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(F((p1||X(F(p2))))))))'
Support contains 5 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 474 transition count 449
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 474 transition count 449
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 470 transition count 445
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 470 transition count 445
Applied a total of 18 rules in 64 ms. Remains 470 /479 variables (removed 9) and now considering 445/454 (removed 9) transitions.
[2024-05-25 12:49:55] [INFO ] Invariant cache hit.
[2024-05-25 12:49:56] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-25 12:49:56] [INFO ] Invariant cache hit.
[2024-05-25 12:49:57] [INFO ] Implicit Places using invariants and state equation in 1677 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
[2024-05-25 12:49:57] [INFO ] Invariant cache hit.
[2024-05-25 12:49:58] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 445/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2600 ms. Remains : 470/479 places, 445/454 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s193 1), p1:(AND (OR (LT s166 1) (LT s53 1)) (OR (LT s5 1) (LT s163 1))), p2:(LT s166 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 896 ms.
Product exploration explored 100000 steps with 50000 reset in 713 ms.
Computed a total of 470 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 470 transition count 445
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 25 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-20-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLFireability-02 finished in 4648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Reduce places removed 20 places and 20 transitions.
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 202 place count 459 transition count 232
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 1 with 202 rules applied. Total rules applied 404 place count 257 transition count 232
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 409 place count 252 transition count 227
Iterating global reduction 2 with 5 rules applied. Total rules applied 414 place count 252 transition count 227
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 1 rules applied. Total rules applied 415 place count 252 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 416 place count 251 transition count 226
Applied a total of 416 rules in 41 ms. Remains 251 /479 variables (removed 228) and now considering 226/454 (removed 228) transitions.
// Phase 1: matrix 226 rows 251 cols
[2024-05-25 12:50:00] [INFO ] Computed 25 invariants in 3 ms
[2024-05-25 12:50:00] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-25 12:50:00] [INFO ] Invariant cache hit.
[2024-05-25 12:50:01] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
[2024-05-25 12:50:01] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-25 12:50:01] [INFO ] Invariant cache hit.
[2024-05-25 12:50:01] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/479 places, 226/454 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1202 ms. Remains : 251/479 places, 226/454 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s222 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 480 reset in 195 ms.
Product exploration explored 100000 steps with 481 reset in 525 ms.
Computed a total of 251 stabilizing places and 226 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 251 transition count 226
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 209 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=104 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-25 12:50:02] [INFO ] Invariant cache hit.
[2024-05-25 12:50:03] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 62 ms returned sat
[2024-05-25 12:50:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:50:03] [INFO ] [Real]Absence check using state equation in 373 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 174 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-20-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLFireability-03 finished in 3277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Reduce places removed 20 places and 20 transitions.
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 202 place count 459 transition count 232
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 1 with 202 rules applied. Total rules applied 404 place count 257 transition count 232
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 409 place count 252 transition count 227
Iterating global reduction 2 with 5 rules applied. Total rules applied 414 place count 252 transition count 227
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 1 rules applied. Total rules applied 415 place count 252 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 416 place count 251 transition count 226
Applied a total of 416 rules in 45 ms. Remains 251 /479 variables (removed 228) and now considering 226/454 (removed 228) transitions.
// Phase 1: matrix 226 rows 251 cols
[2024-05-25 12:50:03] [INFO ] Computed 25 invariants in 2 ms
[2024-05-25 12:50:04] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-25 12:50:04] [INFO ] Invariant cache hit.
[2024-05-25 12:50:04] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 877 ms to find 0 implicit places.
[2024-05-25 12:50:04] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-25 12:50:04] [INFO ] Invariant cache hit.
[2024-05-25 12:50:04] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/479 places, 226/454 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1198 ms. Remains : 251/479 places, 226/454 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s83 1)], 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 407 reset in 339 ms.
Product exploration explored 100000 steps with 406 reset in 362 ms.
Computed a total of 251 stabilizing places and 226 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 251 transition count 226
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-20-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLFireability-05 finished in 2087 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(p1)&&p0)) U X((F(p3)&&p2))))'
Support contains 5 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 475 transition count 450
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 475 transition count 450
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 472 transition count 447
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 472 transition count 447
Applied a total of 14 rules in 80 ms. Remains 472 /479 variables (removed 7) and now considering 447/454 (removed 7) transitions.
// Phase 1: matrix 447 rows 472 cols
[2024-05-25 12:50:05] [INFO ] Computed 25 invariants in 3 ms
[2024-05-25 12:50:06] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-25 12:50:06] [INFO ] Invariant cache hit.
[2024-05-25 12:50:07] [INFO ] Implicit Places using invariants and state equation in 1433 ms returned []
Implicit Place search using SMT with State Equation took 1716 ms to find 0 implicit places.
[2024-05-25 12:50:07] [INFO ] Invariant cache hit.
[2024-05-25 12:50:08] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/479 places, 447/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2227 ms. Remains : 472/479 places, 447/454 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (NOT p3), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s270 1)), p2:(AND (GEQ s11 1) (GEQ s270 1) (GEQ s79 1)), p3:(AND (GEQ s13 1) (GEQ s223 1)), p1:(GEQ s79 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLFireability-08 finished in 2553 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)||G(p1))))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 475 transition count 450
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 475 transition count 450
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 472 transition count 447
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 472 transition count 447
Applied a total of 14 rules in 37 ms. Remains 472 /479 variables (removed 7) and now considering 447/454 (removed 7) transitions.
// Phase 1: matrix 447 rows 472 cols
[2024-05-25 12:50:08] [INFO ] Computed 25 invariants in 4 ms
[2024-05-25 12:50:08] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-25 12:50:08] [INFO ] Invariant cache hit.
[2024-05-25 12:50:10] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 1967 ms to find 0 implicit places.
[2024-05-25 12:50:10] [INFO ] Invariant cache hit.
[2024-05-25 12:50:10] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/479 places, 447/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2441 ms. Remains : 472/479 places, 447/454 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(GEQ s307 1), p0:(LT s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 78 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLFireability-09 finished in 2641 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((F(G(p0))||G(p1)))))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 474 transition count 449
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 474 transition count 449
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 470 transition count 445
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 470 transition count 445
Applied a total of 18 rules in 42 ms. Remains 470 /479 variables (removed 9) and now considering 445/454 (removed 9) transitions.
// Phase 1: matrix 445 rows 470 cols
[2024-05-25 12:50:11] [INFO ] Computed 25 invariants in 4 ms
[2024-05-25 12:50:11] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-25 12:50:11] [INFO ] Invariant cache hit.
[2024-05-25 12:50:13] [INFO ] Implicit Places using invariants and state equation in 1914 ms returned []
Implicit Place search using SMT with State Equation took 2375 ms to find 0 implicit places.
[2024-05-25 12:50:13] [INFO ] Invariant cache hit.
[2024-05-25 12:50:13] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 445/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2876 ms. Remains : 470/479 places, 445/454 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(LT s358 1), p0:(LT s269 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]]
Product exploration explored 100000 steps with 206 reset in 261 ms.
Product exploration explored 100000 steps with 206 reset in 371 ms.
Computed a total of 470 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 470 transition count 445
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-20-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLFireability-10 finished in 3890 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)))'
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 474 transition count 449
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 474 transition count 449
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 470 transition count 445
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 470 transition count 445
Applied a total of 18 rules in 40 ms. Remains 470 /479 variables (removed 9) and now considering 445/454 (removed 9) transitions.
[2024-05-25 12:50:15] [INFO ] Invariant cache hit.
[2024-05-25 12:50:15] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-25 12:50:15] [INFO ] Invariant cache hit.
[2024-05-25 12:50:16] [INFO ] Implicit Places using invariants and state equation in 1610 ms returned []
Implicit Place search using SMT with State Equation took 1908 ms to find 0 implicit places.
[2024-05-25 12:50:16] [INFO ] Invariant cache hit.
[2024-05-25 12:50:17] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 445/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2341 ms. Remains : 470/479 places, 445/454 transitions.
Stuttering acceptance computed with spot in 191 ms :[p1, p1, p1, true, p0]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s25 1) (GEQ s343 1)), p1:(AND (GEQ s21 1) (GEQ s286 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 50000 reset in 552 ms.
Product exploration explored 100000 steps with 50000 reset in 582 ms.
Computed a total of 470 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 470 transition count 445
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 16 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-20-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLFireability-11 finished in 3883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||(p2&&X(p3)))))'
Support contains 6 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 475 transition count 450
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 475 transition count 450
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 471 transition count 446
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 471 transition count 446
Applied a total of 16 rules in 35 ms. Remains 471 /479 variables (removed 8) and now considering 446/454 (removed 8) transitions.
// Phase 1: matrix 446 rows 471 cols
[2024-05-25 12:50:18] [INFO ] Computed 25 invariants in 3 ms
[2024-05-25 12:50:19] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-25 12:50:19] [INFO ] Invariant cache hit.
[2024-05-25 12:50:20] [INFO ] Implicit Places using invariants and state equation in 1584 ms returned []
Implicit Place search using SMT with State Equation took 1918 ms to find 0 implicit places.
[2024-05-25 12:50:20] [INFO ] Invariant cache hit.
[2024-05-25 12:50:21] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/479 places, 446/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2489 ms. Remains : 471/479 places, 446/454 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 4}]], initial=2, aps=[p3:(OR (LT s27 1) (LT s334 1)), p0:(AND (GEQ s3 1) (GEQ s46 1)), p1:(OR (AND (GEQ s27 1) (GEQ s334 1) (GEQ s167 1)) (AND (GEQ s3 1) (GEQ s46 1))), p2:(OR ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 526 ms.
Product exploration explored 100000 steps with 33333 reset in 510 ms.
Computed a total of 471 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 471 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (G p3)), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 18 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-20-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLFireability-12 finished in 3955 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((X(p0)&&(p1||F(p2))))))'
Support contains 5 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 475 transition count 450
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 475 transition count 450
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 471 transition count 446
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 471 transition count 446
Applied a total of 16 rules in 35 ms. Remains 471 /479 variables (removed 8) and now considering 446/454 (removed 8) transitions.
[2024-05-25 12:50:22] [INFO ] Invariant cache hit.
[2024-05-25 12:50:23] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-25 12:50:23] [INFO ] Invariant cache hit.
[2024-05-25 12:50:24] [INFO ] Implicit Places using invariants and state equation in 1619 ms returned []
Implicit Place search using SMT with State Equation took 1933 ms to find 0 implicit places.
[2024-05-25 12:50:24] [INFO ] Invariant cache hit.
[2024-05-25 12:50:25] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/479 places, 446/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2413 ms. Remains : 471/479 places, 446/454 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), true]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s46 1) (OR (LT s9 1) (LT s465 1))), p2:(AND (GEQ s3 1) (GEQ s162 1)), p0:(AND (GEQ s9 1) (GEQ s465 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]]
Entered a terminal (fully accepting) state of product in 166 steps with 1 reset in 1 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLFireability-13 finished in 2654 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(p1)&&F(G(p0)))))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 474 transition count 449
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 474 transition count 449
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 471 transition count 446
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 471 transition count 446
Applied a total of 16 rules in 34 ms. Remains 471 /479 variables (removed 8) and now considering 446/454 (removed 8) transitions.
// Phase 1: matrix 446 rows 471 cols
[2024-05-25 12:50:25] [INFO ] Computed 25 invariants in 3 ms
[2024-05-25 12:50:25] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-25 12:50:25] [INFO ] Invariant cache hit.
[2024-05-25 12:50:27] [INFO ] Implicit Places using invariants and state equation in 1690 ms returned []
Implicit Place search using SMT with State Equation took 1993 ms to find 0 implicit places.
[2024-05-25 12:50:27] [INFO ] Invariant cache hit.
[2024-05-25 12:50:28] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/479 places, 446/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2549 ms. Remains : 471/479 places, 446/454 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, true, true, (NOT p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s6 1) (OR (LT s33 1) (LT s102 1))), p1:(AND (GEQ s33 1) (GEQ s102 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 983 steps with 3 reset in 2 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLFireability-14 finished in 2770 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' '!(((p0 U (G(p0)||(p0&&G(p1)))) U (p0&&G(p2))))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Reduce places removed 19 places and 19 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 460 transition count 234
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 259 transition count 234
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 406 place count 255 transition count 230
Iterating global reduction 2 with 4 rules applied. Total rules applied 410 place count 255 transition count 230
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 1 rules applied. Total rules applied 411 place count 255 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 412 place count 254 transition count 229
Applied a total of 412 rules in 31 ms. Remains 254 /479 variables (removed 225) and now considering 229/454 (removed 225) transitions.
// Phase 1: matrix 229 rows 254 cols
[2024-05-25 12:50:28] [INFO ] Computed 25 invariants in 1 ms
[2024-05-25 12:50:28] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-25 12:50:28] [INFO ] Invariant cache hit.
[2024-05-25 12:50:28] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-25 12:50:29] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
[2024-05-25 12:50:29] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-25 12:50:29] [INFO ] Invariant cache hit.
[2024-05-25 12:50:29] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 254/479 places, 229/454 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1343 ms. Remains : 254/479 places, 229/454 transitions.
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p0) (NOT p2)), true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 1}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LT s49 1), p2:(LT s17 1), p1:(LT s221 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 200 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLFireability-15 finished in 1730 ms.
All properties solved by simple procedures.
Total runtime 44829 ms.

BK_STOP 1716641431414

--------------------
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="HirschbergSinclair-PT-20"
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 HirschbergSinclair-PT-20, 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 r219-smll-171649597800053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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