Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r082-smll-177946993600284.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is Dekker-PT-100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993600284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 7.5K Mar 4 18:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 4 18:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 4 18:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 4 18:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 4 18:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Mar 4 18:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 4 18:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 4 18:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 5.9M Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Dekker-PT-100-LTLFireability-00
FORMULA_NAME Dekker-PT-100-LTLFireability-01
FORMULA_NAME Dekker-PT-100-LTLFireability-02
FORMULA_NAME Dekker-PT-100-LTLFireability-03
FORMULA_NAME Dekker-PT-100-LTLFireability-04
FORMULA_NAME Dekker-PT-100-LTLFireability-05
FORMULA_NAME Dekker-PT-100-LTLFireability-06
FORMULA_NAME Dekker-PT-100-LTLFireability-07
FORMULA_NAME Dekker-PT-100-LTLFireability-08
FORMULA_NAME Dekker-PT-100-LTLFireability-09
FORMULA_NAME Dekker-PT-100-LTLFireability-10
FORMULA_NAME Dekker-PT-100-LTLFireability-11
FORMULA_NAME Dekker-PT-100-LTLFireability-12
FORMULA_NAME Dekker-PT-100-LTLFireability-13
FORMULA_NAME Dekker-PT-100-LTLFireability-14
FORMULA_NAME Dekker-PT-100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779639872121

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 16:24:34] [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]
[2026-05-24 16:24:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 16:24:35] [INFO ] Load time of PNML (sax parser for PT used): 864 ms
[2026-05-24 16:24:35] [INFO ] Transformed 500 places.
[2026-05-24 16:24:35] [INFO ] Transformed 10200 transitions.
[2026-05-24 16:24:35] [INFO ] Found NUPN structural information;
[2026-05-24 16:24:35] [INFO ] Parsed PT model containing 500 places and 10200 transitions and 80200 arcs in 1096 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 3 formulas.
FORMULA Dekker-PT-100-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 81 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 338 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2026-05-24 16:24:36] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12706135671646568238.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4653442790934590997.kers'
[2026-05-24 16:24:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12706135671646568238.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4653442790934590997.kers]
Culling duplicate invariants (modulo rational): removing 200 columns.
Culled 200 columns in 0 ms.
// Phase 1: matrix 400 rows 300 cols 800 entries
Finished phase 1 with 200 SingleSign rule and 0 generalized
[2026-05-24 16:24:36] [INFO ] Computed 300 invariants in 2 ms
Computed 300 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4653442790934590997.kers
Total runtime 5 ms.
[2026-05-24 16:24:49] [INFO ] Implicit Places using invariants in 13804 ms returned [200, 203, 206, 209, 212, 215, 218, 221, 224, 227, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 266, 269, 272, 275, 278, 281, 284, 287, 290, 293, 296, 299, 302, 305, 308, 311, 314, 317, 320, 323, 326, 329, 332, 335, 338, 341, 344, 347, 350, 353, 356, 359, 362, 365, 368, 371, 374, 377, 380, 383, 386, 389, 392, 395, 398, 401, 404, 407, 410, 413, 416, 419, 422, 425, 428, 431, 434, 437, 440, 443, 446, 449, 452, 455, 458, 461, 464, 467, 470, 473, 476, 479, 482, 485, 488, 491, 494, 497]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 13906 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 102 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14379 ms. Remains : 400/500 places, 10200/10200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 109 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2026-05-24 16:24:50] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6907610908021541161.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15474928270042951349.kers'
[2026-05-24 16:24:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6907610908021541161.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15474928270042951349.kers]
Culling duplicate invariants (modulo rational): removing 100 columns.
Culled 100 columns in 1 ms.
// Phase 1: matrix 400 rows 300 cols 800 entries
Finished phase 1 with 200 SingleSign rule and 0 generalized
[2026-05-24 16:24:50] [INFO ] Computed 200 invariants in 4 ms
Computed 200 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15474928270042951349.kers
Total runtime 5 ms.
[2026-05-24 16:24:51] [INFO ] Implicit Places using invariants in 1515 ms returned []
Implicit Place search using SMT only with invariants took 1516 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2026-05-24 16:24:51] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2026-05-24 16:24:51] [INFO ] Invariant cache hit.
[2026-05-24 16:24:51] [INFO ] State equation strengthened by 100 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 40005ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 40156ms
Finished structural reductions in LTL mode , in 1 iterations and 41900 ms. Remains : 400/400 places, 10200/10200 transitions.
Support contains 81 out of 400 places after structural reductions.
[2026-05-24 16:25:33] [INFO ] Flatten gal took : 984 ms
[2026-05-24 16:25:33] [INFO ] Flatten gal took : 469 ms
[2026-05-24 16:25:34] [INFO ] Input system was already deterministic with 10200 transitions.
Reduction of identical properties reduced properties to check from 35 to 32
RANDOM walk for 40000 steps (8 resets) in 3300 ms. (12 steps per ms) remains 1/32 properties
BEST_FIRST walk for 808 steps (0 resets) in 8 ms. (89 steps per ms) remains 0/1 properties
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.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 6 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 1114 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2026-05-24 16:25:37] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2026-05-24 16:25:37] [INFO ] Invariant cache hit.
[2026-05-24 16:25:40] [INFO ] Implicit Places using invariants in 2317 ms returned []
Implicit Place search using SMT only with invariants took 2319 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3444 ms. Remains : 400/400 places, 10200/10200 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Dekker-PT-100-LTLFireability-00
Product exploration explored 100000 steps with 101 reset in 3485 ms.
Stack based approach found an accepted trace after 73 steps with 0 reset with depth 74 and stack size 74 in 5 ms.
FORMULA Dekker-PT-100-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLFireability-00 finished in 7380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&G((((X(!p1)&&F(!p0))||X(G(!p1))) U X(p2)))))'
Support contains 9 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 106 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2026-05-24 16:25:44] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2026-05-24 16:25:44] [INFO ] Invariant cache hit.
[2026-05-24 16:25:46] [INFO ] Implicit Places using invariants in 2529 ms returned []
Implicit Place search using SMT only with invariants took 2531 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2639 ms. Remains : 400/400 places, 10200/10200 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&G((((X(!p1)&&F(!p0))||X(G(!p1))) U X(p2)))))'
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), false, (NOT p2), (AND p0 p1 (NOT p2)), true, p0, (AND p0 p1)]
Running random walk in product with property : Dekker-PT-100-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1242 steps with 7 reset in 43 ms.
FORMULA Dekker-PT-100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLFireability-01 finished in 3137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 616 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2026-05-24 16:25:47] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2026-05-24 16:25:47] [INFO ] Invariant cache hit.
[2026-05-24 16:25:50] [INFO ] Implicit Places using invariants in 2217 ms returned []
Implicit Place search using SMT only with invariants took 2218 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2836 ms. Remains : 400/400 places, 10200/10200 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLFireability-02
Product exploration explored 100000 steps with 488 reset in 3195 ms.
Stack based approach found an accepted trace after 59 steps with 0 reset with depth 60 and stack size 60 in 3 ms.
FORMULA Dekker-PT-100-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLFireability-02 finished in 6159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(F(G(p0))))||(X(p1) U p2))))'
Support contains 9 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 99 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2026-05-24 16:25:53] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2026-05-24 16:25:53] [INFO ] Invariant cache hit.
[2026-05-24 16:25:55] [INFO ] Implicit Places using invariants in 1865 ms returned []
Implicit Place search using SMT only with invariants took 1870 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1970 ms. Remains : 400/400 places, 10200/10200 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(F(G(p0))))||(X(p1) U p2))))'
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 3105 ms.
Stack based approach found an accepted trace after 575 steps with 0 reset with depth 576 and stack size 573 in 18 ms.
FORMULA Dekker-PT-100-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLFireability-03 finished in 5348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 577 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2026-05-24 16:25:59] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2026-05-24 16:25:59] [INFO ] Invariant cache hit.
[2026-05-24 16:26:01] [INFO ] Implicit Places using invariants in 1887 ms returned []
Implicit Place search using SMT only with invariants took 1889 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2471 ms. Remains : 400/400 places, 10200/10200 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 3061 ms.
Stack based approach found an accepted trace after 266 steps with 0 reset with depth 267 and stack size 265 in 9 ms.
FORMULA Dekker-PT-100-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLFireability-05 finished in 5622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))) U (G((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))||(G(!p2)&&X(!p3)&&(X(!p0) U ((!p1&&X(!p0))||X(G(!p0))))))))'
Support contains 11 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 99 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2026-05-24 16:26:04] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2026-05-24 16:26:04] [INFO ] Invariant cache hit.
[2026-05-24 16:26:06] [INFO ] Implicit Places using invariants in 1931 ms returned []
Implicit Place search using SMT only with invariants took 1932 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2031 ms. Remains : 400/400 places, 10200/10200 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U (X(G(!p0))||(!p1&&X(!p0)))) U (G((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))||(G(!p2)&&X(!p3)&&(X(!p0) U ((!p1&&X(!p0))||X(G(!p0))))))))'
Stuttering acceptance computed with spot in 360 ms :[p0, (AND p0 p2), (AND p0 (NOT p2) p3), p0, p0, (AND p2 p0), true, (AND p2 (NOT p0))]
Running random walk in product with property : Dekker-PT-100-LTLFireability-06
Product exploration explored 100000 steps with 37530 reset in 2658 ms.
Product exploration explored 100000 steps with 37546 reset in 2782 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 14 factoid took 329 ms. Reduced automaton from 8 states, 22 edges and 4 AP (stutter sensitive) to 8 states, 22 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 2884 ms. (13 steps per ms) remains 5/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 2/2 properties
[2026-05-24 16:26:14] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2026-05-24 16:26:14] [INFO ] Invariant cache hit.
[2026-05-24 16:26:14] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 8/16 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/20 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 20/40 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 190/230 variables, 100/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 475/705 variables, 285/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/705 variables, 285/720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/705 variables, 95/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/705 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 95/800 variables, 95/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 95/1005 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 95/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 726 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 8/16 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/20 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 20/40 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 190/230 variables, 100/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 475/705 variables, 285/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/705 variables, 285/720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/705 variables, 95/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/705 variables, 2/817 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/705 variables, 3/820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6079ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 667 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 668 ms. Remains : 400/400 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1977 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 184426 steps, run timeout after 3002 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 184426 steps, saw 169911 distinct states, run finished after 3013 ms. (steps per millisecond=61 ) properties seen :0
[2026-05-24 16:26:24] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2026-05-24 16:26:24] [INFO ] Invariant cache hit.
[2026-05-24 16:26:24] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 8/16 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/20 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 20/40 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 190/230 variables, 100/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 475/705 variables, 285/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/705 variables, 285/720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/705 variables, 95/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/705 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 95/800 variables, 95/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 95/1005 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 95/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 808 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 8/16 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/20 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 20/40 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 190/230 variables, 100/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 475/705 variables, 285/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/705 variables, 285/720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/705 variables, 95/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/705 variables, 2/817 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/705 variables, 3/820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/705 variables, 4/824 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/705 variables, 4/828 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/705 variables, 10/838 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/705 variables, 1/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/705 variables, 1/840 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/705 variables, 2/842 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/705 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 95/800 variables, 95/937 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/800 variables, 95/1032 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/800 variables, 95/1127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/800 variables, 12/1139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/800 variables, 4/1143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/800 variables, 4/1147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/800 variables, 9/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/800 variables, 1/1157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/800 variables, 2/1159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/800 variables, 1/1160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/800 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 0/800 variables, 1/1161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/800 variables, 2/1163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/800 variables, 1/1164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/800 variables, 5/1169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/800 variables, 3/1172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/800 variables, 1/1173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/800 variables, 4/1177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/800 variables, 2/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/800 variables, 2/1181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/800 variables, 6/1187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/800 variables, 2/1189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/800 variables, 4/1193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/800 variables, 1/1194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/800 variables, 6/1200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/800 variables, 1/1201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/800 variables, 2/1203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/800 variables, 4/1207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/800 variables, 1/1208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/800 variables, 1/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/800 variables, 2/1211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/800 variables, 4/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/800 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (OVERLAPS) 0/800 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 1215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 33541 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 113/113 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34371ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 762 ms.
Support contains 8 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 452 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 452 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 449 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2026-05-24 16:27:00] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2026-05-24 16:27:00] [INFO ] Invariant cache hit.
[2026-05-24 16:27:03] [INFO ] Implicit Places using invariants in 2475 ms returned []
Implicit Place search using SMT only with invariants took 2477 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2928 ms. Remains : 400/400 places, 10200/10200 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 600 edges and 400 vertex of which 20 are kept as prefixes of interest. Removing 380 places using SCC suffix rule.2 ms
Discarding 380 places :
Also discarding 9690 output transitions
Drop transitions (Output transitions of discarded places.) removed 9690 transitions
Ensure Unique test removed 490 transitions
Reduce isomorphic transitions removed 490 transitions.
Iterating post reduction 0 with 490 rules applied. Total rules applied 491 place count 20 transition count 20
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 493 place count 20 transition count 18
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 499 place count 16 transition count 16
Applied a total of 499 rules in 39 ms. Remains 16 /400 variables (removed 384) and now considering 16/10200 (removed 10184) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5077742969870112200.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11977846914569893636.kers'
[2026-05-24 16:27:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5077742969870112200.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11977846914569893636.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 16 rows 11 cols 28 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-24 16:27:03] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11977846914569893636.kers
Total runtime 0 ms.
[2026-05-24 16:27:03] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-24 16:27:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-24 16:27:03] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-24 16:27:03] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-24 16:27:03] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 191 ms.
Negative knowledge disproves property using: (G (OR (NOT p0) (NOT p2)))
Knowledge based reduction with 14 factoid took 237 ms. Proved property starting from automaton with 8 states, 22 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 51174 ms.
FORMULA Dekker-PT-100-LTLFireability-06 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property Dekker-PT-100-LTLFireability-06 finished in 59087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(((X(p0) U G(p1))&&X(p2))) U X(p3))))'
Support contains 12 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 102 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2026-05-24 16:27:03] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7411457421145698369.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2805555252244406510.kers'
[2026-05-24 16:27:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7411457421145698369.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2805555252244406510.kers]
Culling duplicate invariants (modulo rational): removing 100 columns.
Culled 100 columns in 0 ms.
// Phase 1: matrix 400 rows 300 cols 800 entries
Finished phase 1 with 200 SingleSign rule and 0 generalized
[2026-05-24 16:27:03] [INFO ] Computed 200 invariants in 2 ms
Computed 200 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2805555252244406510.kers
Total runtime 3 ms.
[2026-05-24 16:27:05] [INFO ] Implicit Places using invariants in 2208 ms returned []
Implicit Place search using SMT only with invariants took 2209 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2312 ms. Remains : 400/400 places, 10200/10200 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(((X(p0) U G(p1))&&X(p2))) U X(p3))))'
Stuttering acceptance computed with spot in 519 ms :[(NOT p3), (NOT p3), (NOT p3), false, false, (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : Dekker-PT-100-LTLFireability-07
Product exploration explored 100000 steps with 2245 reset in 3380 ms.
Stack based approach found an accepted trace after 131 steps with 2 reset with depth 53 and stack size 53 in 6 ms.
FORMULA Dekker-PT-100-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLFireability-07 finished in 6333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(X(p1)))) U (X(F(p2)) U p1)))'
Support contains 9 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 101 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2026-05-24 16:27:09] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2026-05-24 16:27:09] [INFO ] Invariant cache hit.
[2026-05-24 16:27:11] [INFO ] Implicit Places using invariants in 1919 ms returned []
Implicit Place search using SMT only with invariants took 1920 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2023 ms. Remains : 400/400 places, 10200/10200 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(X(p1)))) U (X(F(p2)) U p1)))'
Stuttering acceptance computed with spot in 788 ms :[(NOT p1), (NOT p1), false, (NOT p1), (AND (NOT p1) (NOT p2)), false, (AND (NOT p2) (NOT p1)), false, (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Dekker-PT-100-LTLFireability-08
Product exploration explored 100000 steps with 292 reset in 3028 ms.
Stack based approach found an accepted trace after 186 steps with 0 reset with depth 187 and stack size 187 in 6 ms.
FORMULA Dekker-PT-100-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLFireability-08 finished in 5928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0 U p1))&&F(p2))))'
Support contains 6 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 99 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2026-05-24 16:27:15] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2026-05-24 16:27:15] [INFO ] Invariant cache hit.
[2026-05-24 16:27:18] [INFO ] Implicit Places using invariants in 2409 ms returned []
Implicit Place search using SMT only with invariants took 2410 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2512 ms. Remains : 400/400 places, 10200/10200 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0 U p1))&&F(p2))))'
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), true]
Running random walk in product with property : Dekker-PT-100-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLFireability-10 finished in 2796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U ((X(X(!p0))&&F(!p2)&&p1)||X(X(G(!p0))))))'
Support contains 9 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 96 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2026-05-24 16:27:18] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2026-05-24 16:27:18] [INFO ] Invariant cache hit.
[2026-05-24 16:27:21] [INFO ] Implicit Places using invariants in 2626 ms returned []
Implicit Place search using SMT only with invariants took 2634 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2732 ms. Remains : 400/400 places, 10200/10200 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U (X(X(G(!p0)))||(X(X(!p0))&&F(!p2)&&p1))))'
Stuttering acceptance computed with spot in 342 ms :[p0, p0, p0, (AND p0 p2), (AND p0 p2), true, (AND p2 p0), p2]
Running random walk in product with property : Dekker-PT-100-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2996 steps with 762 reset in 84 ms.
FORMULA Dekker-PT-100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLFireability-11 finished in 3222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((G(F(p0)) U G(p1)))) U (X(X((G(F(p0)) U G(p1))))&&p2))))'
Support contains 6 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 99 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2026-05-24 16:27:21] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2026-05-24 16:27:21] [INFO ] Invariant cache hit.
[2026-05-24 16:27:23] [INFO ] Implicit Places using invariants in 1797 ms returned []
Implicit Place search using SMT only with invariants took 1800 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1899 ms. Remains : 400/400 places, 10200/10200 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((G(F(p0)) U G(p1)))) U (X(X((G(F(p0)) U G(p1))))&&p2))))'
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : Dekker-PT-100-LTLFireability-12
Product exploration explored 100000 steps with 978 reset in 2987 ms.
Stack based approach found an accepted trace after 238 steps with 4 reset with depth 108 and stack size 108 in 8 ms.
FORMULA Dekker-PT-100-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLFireability-12 finished in 5264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p1)||p0))&&F(p2)))'
Support contains 6 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 605 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2026-05-24 16:27:27] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2026-05-24 16:27:27] [INFO ] Invariant cache hit.
[2026-05-24 16:27:30] [INFO ] Implicit Places using invariants in 2606 ms returned []
Implicit Place search using SMT only with invariants took 2614 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3219 ms. Remains : 400/400 places, 10200/10200 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p1)||p0))&&F(p2)))'
Stuttering acceptance computed with spot in 206 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Dekker-PT-100-LTLFireability-13
Entered a terminal (fully accepting) state of product in 384 steps with 0 reset in 13 ms.
FORMULA Dekker-PT-100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLFireability-13 finished in 3488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(F(p1))))))'
Support contains 6 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 96 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2026-05-24 16:27:30] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2026-05-24 16:27:30] [INFO ] Invariant cache hit.
[2026-05-24 16:27:32] [INFO ] Implicit Places using invariants in 1829 ms returned []
Implicit Place search using SMT only with invariants took 1830 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1926 ms. Remains : 400/400 places, 10200/10200 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(F(p1))))))'
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Dekker-PT-100-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLFireability-15 finished in 2215 ms.
All properties solved by simple procedures.
Total runtime 178654 ms.

BK_STOP 1779640052833

--------------------
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
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="Dekker-PT-100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-5973"
echo " Executing tool itstools"
echo " Input is Dekker-PT-100, 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 r082-smll-177946993600284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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