Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r064-tall-162038397200437.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DLCround-PT-13a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038397200437
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 95K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 09:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 09:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 987K May 5 16:51 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 DLCround-PT-13a-00
FORMULA_NAME DLCround-PT-13a-01
FORMULA_NAME DLCround-PT-13a-02
FORMULA_NAME DLCround-PT-13a-03
FORMULA_NAME DLCround-PT-13a-04
FORMULA_NAME DLCround-PT-13a-05
FORMULA_NAME DLCround-PT-13a-06
FORMULA_NAME DLCround-PT-13a-07
FORMULA_NAME DLCround-PT-13a-08
FORMULA_NAME DLCround-PT-13a-09
FORMULA_NAME DLCround-PT-13a-10
FORMULA_NAME DLCround-PT-13a-11
FORMULA_NAME DLCround-PT-13a-12
FORMULA_NAME DLCround-PT-13a-13
FORMULA_NAME DLCround-PT-13a-14
FORMULA_NAME DLCround-PT-13a-15

=== Now, execution of the tool begins

BK_START 1620527813711

Running Version 0
[2021-05-09 02:37:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 02:37:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 02:37:14] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2021-05-09 02:37:14] [INFO ] Transformed 463 places.
[2021-05-09 02:37:14] [INFO ] Transformed 3847 transitions.
[2021-05-09 02:37:14] [INFO ] Found NUPN structural information;
[2021-05-09 02:37:14] [INFO ] Parsed PT model containing 463 places and 3847 transitions in 222 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 02:37:14] [INFO ] Initial state test concluded for 4 properties.
Ensure Unique test removed 352 transitions
Reduce redundant transitions removed 352 transitions.
FORMULA DLCround-PT-13a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 463 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 463/463 places, 3495/3495 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 437 transition count 3025
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 437 transition count 3025
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 437 transition count 3022
Drop transitions removed 962 transitions
Redundant transition composition rules discarded 962 transitions
Iterating global reduction 1 with 962 rules applied. Total rules applied 1017 place count 437 transition count 2060
Applied a total of 1017 rules in 173 ms. Remains 437 /463 variables (removed 26) and now considering 2060/3495 (removed 1435) transitions.
[2021-05-09 02:37:15] [INFO ] Flow matrix only has 237 transitions (discarded 1823 similar events)
// Phase 1: matrix 237 rows 437 cols
[2021-05-09 02:37:15] [INFO ] Computed 312 place invariants in 17 ms
[2021-05-09 02:37:16] [INFO ] Implicit Places using invariants in 1391 ms returned [143, 145, 146, 147, 148, 149, 150, 151, 152, 153, 155, 156, 157, 158, 159, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 229, 230, 231, 232, 233, 234, 235, 236, 237, 239, 240, 241, 242, 244, 245, 246, 247, 248, 249, 250, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 265, 266, 267, 268, 269, 272, 273, 274, 275, 276, 277, 278, 280, 282, 283, 284, 285, 286, 287, 288, 289, 291, 292, 293, 294, 295, 296, 298, 299, 300, 301, 302, 303, 304, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 362, 363, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 376, 377, 378, 379, 380, 381, 383, 384, 385, 386, 387, 388, 389, 390, 391, 393, 394, 395, 396, 397, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 414, 415, 416, 417, 418, 419, 420, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 434, 435, 436]
Discarding 266 places :
Ensure Unique test removed 1558 transitions
Reduce isomorphic transitions removed 1558 transitions.
Implicit Place search using SMT only with invariants took 1422 ms to find 266 implicit places.
[2021-05-09 02:37:16] [INFO ] Flow matrix only has 237 transitions (discarded 265 similar events)
// Phase 1: matrix 237 rows 171 cols
[2021-05-09 02:37:16] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-09 02:37:16] [INFO ] Dead Transitions using invariants and state equation in 269 ms returned []
Starting structural reductions, iteration 1 : 171/463 places, 502/3495 transitions.
Drop transitions removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 0 with 192 rules applied. Total rules applied 192 place count 171 transition count 310
Applied a total of 192 rules in 7 ms. Remains 171 /171 variables (removed 0) and now considering 310/502 (removed 192) transitions.
[2021-05-09 02:37:16] [INFO ] Flow matrix only has 237 transitions (discarded 73 similar events)
// Phase 1: matrix 237 rows 171 cols
[2021-05-09 02:37:16] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-09 02:37:16] [INFO ] Implicit Places using invariants in 46 ms returned []
[2021-05-09 02:37:16] [INFO ] Flow matrix only has 237 transitions (discarded 73 similar events)
// Phase 1: matrix 237 rows 171 cols
[2021-05-09 02:37:16] [INFO ] Computed 46 place invariants in 10 ms
[2021-05-09 02:37:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 02:37:16] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 171/463 places, 310/3495 transitions.
[2021-05-09 02:37:17] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 02:37:17] [INFO ] Flatten gal took : 48 ms
FORMULA DLCround-PT-13a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 02:37:17] [INFO ] Flatten gal took : 17 ms
[2021-05-09 02:37:17] [INFO ] Input system was already deterministic with 310 transitions.
Finished random walk after 367 steps, including 0 resets, run visited all 26 properties in 10 ms. (steps per millisecond=36 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))&&F((p1&&G(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 310/310 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 144 transition count 310
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 35 place count 136 transition count 294
Iterating global reduction 1 with 8 rules applied. Total rules applied 43 place count 136 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 136 transition count 293
Applied a total of 44 rules in 9 ms. Remains 136 /171 variables (removed 35) and now considering 293/310 (removed 17) transitions.
[2021-05-09 02:37:17] [INFO ] Flow matrix only has 228 transitions (discarded 65 similar events)
// Phase 1: matrix 228 rows 136 cols
[2021-05-09 02:37:17] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-09 02:37:17] [INFO ] Implicit Places using invariants in 24 ms returned []
[2021-05-09 02:37:17] [INFO ] Flow matrix only has 228 transitions (discarded 65 similar events)
// Phase 1: matrix 228 rows 136 cols
[2021-05-09 02:37:17] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-09 02:37:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 02:37:17] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2021-05-09 02:37:17] [INFO ] Flow matrix only has 228 transitions (discarded 65 similar events)
// Phase 1: matrix 228 rows 136 cols
[2021-05-09 02:37:17] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-09 02:37:17] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Finished structural reductions, in 1 iterations. Remains : 136/171 places, 293/310 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DLCround-PT-13a-00 automaton TGBA [mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s24 0), p0:(OR (NEQ s13 1) (NEQ s135 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-13a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-00 finished in 503 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 310/310 transitions.
Graph (trivial) has 302 edges and 171 vertex of which 138 / 171 are part of one of the 19 SCC in 3 ms
Free SCC test removed 119 places
Ensure Unique test removed 279 transitions
Reduce isomorphic transitions removed 279 transitions.
Graph (complete) has 76 edges and 52 vertex of which 26 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.3 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 26 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 25 transition count 30
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 19 place count 10 transition count 15
Iterating global reduction 2 with 15 rules applied. Total rules applied 34 place count 10 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 10 transition count 14
Applied a total of 35 rules in 26 ms. Remains 10 /171 variables (removed 161) and now considering 14/310 (removed 296) transitions.
[2021-05-09 02:37:17] [INFO ] Flow matrix only has 8 transitions (discarded 6 similar events)
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 02:37:17] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:37:17] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-09 02:37:17] [INFO ] Flow matrix only has 8 transitions (discarded 6 similar events)
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 02:37:17] [INFO ] Computed 5 place invariants in 5 ms
[2021-05-09 02:37:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 02:37:17] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-09 02:37:17] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 02:37:17] [INFO ] Flow matrix only has 8 transitions (discarded 6 similar events)
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 02:37:17] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:37:17] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/171 places, 14/310 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-13a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s5 1) (NEQ s8 1)), p0:(OR (NEQ s6 1) (NEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-13a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-01 finished in 140 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p0) U (p1 U p2))||G(p3)))], workingDir=/home/mcc/execution]
Support contains 8 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 310/310 transitions.
Graph (trivial) has 284 edges and 171 vertex of which 125 / 171 are part of one of the 18 SCC in 0 ms
Free SCC test removed 107 places
Ensure Unique test removed 250 transitions
Reduce isomorphic transitions removed 250 transitions.
Graph (complete) has 105 edges and 64 vertex of which 40 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 40 transition count 58
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 38 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 37 transition count 57
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 22 place count 23 transition count 42
Iterating global reduction 3 with 14 rules applied. Total rules applied 36 place count 23 transition count 42
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 23 transition count 42
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 40 place count 23 transition count 40
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 42 place count 21 transition count 38
Iterating global reduction 4 with 2 rules applied. Total rules applied 44 place count 21 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 46 place count 21 transition count 36
Applied a total of 46 rules in 11 ms. Remains 21 /171 variables (removed 150) and now considering 36/310 (removed 274) transitions.
[2021-05-09 02:37:17] [INFO ] Flow matrix only has 24 transitions (discarded 12 similar events)
// Phase 1: matrix 24 rows 21 cols
[2021-05-09 02:37:17] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-09 02:37:17] [INFO ] Implicit Places using invariants in 16 ms returned []
[2021-05-09 02:37:17] [INFO ] Flow matrix only has 24 transitions (discarded 12 similar events)
// Phase 1: matrix 24 rows 21 cols
[2021-05-09 02:37:17] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-09 02:37:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 02:37:17] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2021-05-09 02:37:17] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 02:37:17] [INFO ] Flow matrix only has 24 transitions (discarded 12 similar events)
// Phase 1: matrix 24 rows 21 cols
[2021-05-09 02:37:17] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-09 02:37:17] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/171 places, 36/310 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p2)]
Running random walk in product with property : DLCround-PT-13a-02 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s15 1) (EQ s19 1)), p3:(OR (NEQ s10 1) (NEQ s20 1)), p1:(AND (EQ s5 1) (EQ s18 1)), p0:(OR (NEQ s2 1) (NEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 21 steps with 3 reset in 1 ms.
FORMULA DLCround-PT-13a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-02 finished in 225 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 310/310 transitions.
Graph (trivial) has 306 edges and 171 vertex of which 141 / 171 are part of one of the 18 SCC in 0 ms
Free SCC test removed 123 places
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 288 transitions.
Graph (complete) has 67 edges and 48 vertex of which 21 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.0 ms
Discarding 27 places :
Also discarding 0 output transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 18 place count 5 transition count 6
Iterating global reduction 0 with 16 rules applied. Total rules applied 34 place count 5 transition count 6
Applied a total of 34 rules in 2 ms. Remains 5 /171 variables (removed 166) and now considering 6/310 (removed 304) transitions.
[2021-05-09 02:37:18] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
// Phase 1: matrix 4 rows 5 cols
[2021-05-09 02:37:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 02:37:18] [INFO ] Implicit Places using invariants in 7 ms returned []
[2021-05-09 02:37:18] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
// Phase 1: matrix 4 rows 5 cols
[2021-05-09 02:37:18] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-09 02:37:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 02:37:18] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-09 02:37:18] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 02:37:18] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
// Phase 1: matrix 4 rows 5 cols
[2021-05-09 02:37:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 02:37:18] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/171 places, 6/310 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-13a-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s2 1) (NEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-13a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-03 finished in 95 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&(p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 310/310 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 145 transition count 310
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 135 transition count 290
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 135 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 135 transition count 289
Applied a total of 47 rules in 10 ms. Remains 135 /171 variables (removed 36) and now considering 289/310 (removed 21) transitions.
[2021-05-09 02:37:18] [INFO ] Flow matrix only has 226 transitions (discarded 63 similar events)
// Phase 1: matrix 226 rows 135 cols
[2021-05-09 02:37:18] [INFO ] Computed 20 place invariants in 12 ms
[2021-05-09 02:37:18] [INFO ] Implicit Places using invariants in 44 ms returned []
[2021-05-09 02:37:18] [INFO ] Flow matrix only has 226 transitions (discarded 63 similar events)
// Phase 1: matrix 226 rows 135 cols
[2021-05-09 02:37:18] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-09 02:37:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 02:37:18] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2021-05-09 02:37:18] [INFO ] Flow matrix only has 226 transitions (discarded 63 similar events)
// Phase 1: matrix 226 rows 135 cols
[2021-05-09 02:37:18] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-09 02:37:18] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Finished structural reductions, in 1 iterations. Remains : 135/171 places, 289/310 transitions.
Stuttering acceptance computed with spot in 3950 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-13a-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s36 1) (EQ s134 1)), p1:(AND (EQ s36 1) (EQ s134 1) (EQ s10 1) (EQ s133 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-13a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-04 finished in 4226 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 310/310 transitions.
Graph (trivial) has 295 edges and 171 vertex of which 132 / 171 are part of one of the 19 SCC in 1 ms
Free SCC test removed 113 places
Ensure Unique test removed 265 transitions
Reduce isomorphic transitions removed 265 transitions.
Graph (complete) has 90 edges and 58 vertex of which 32 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 32 transition count 43
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 30 transition count 42
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 23 place count 14 transition count 25
Iterating global reduction 2 with 16 rules applied. Total rules applied 39 place count 14 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 14 transition count 25
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 13 transition count 24
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 13 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 13 transition count 23
Applied a total of 43 rules in 7 ms. Remains 13 /171 variables (removed 158) and now considering 23/310 (removed 287) transitions.
[2021-05-09 02:37:22] [INFO ] Flow matrix only has 15 transitions (discarded 8 similar events)
// Phase 1: matrix 15 rows 13 cols
[2021-05-09 02:37:22] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:37:22] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-09 02:37:22] [INFO ] Flow matrix only has 15 transitions (discarded 8 similar events)
// Phase 1: matrix 15 rows 13 cols
[2021-05-09 02:37:22] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:37:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 02:37:22] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-09 02:37:22] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-09 02:37:22] [INFO ] Flow matrix only has 15 transitions (discarded 8 similar events)
// Phase 1: matrix 15 rows 13 cols
[2021-05-09 02:37:22] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:37:22] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/171 places, 23/310 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-13a-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s12 1)), p1:(AND (EQ s4 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-13a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-05 finished in 136 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 310/310 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 144 transition count 310
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 36 place count 135 transition count 292
Iterating global reduction 1 with 9 rules applied. Total rules applied 45 place count 135 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 135 transition count 291
Applied a total of 46 rules in 5 ms. Remains 135 /171 variables (removed 36) and now considering 291/310 (removed 19) transitions.
[2021-05-09 02:37:22] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
// Phase 1: matrix 227 rows 135 cols
[2021-05-09 02:37:22] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-09 02:37:22] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-09 02:37:22] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
// Phase 1: matrix 227 rows 135 cols
[2021-05-09 02:37:22] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-09 02:37:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 02:37:22] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2021-05-09 02:37:22] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
// Phase 1: matrix 227 rows 135 cols
[2021-05-09 02:37:22] [INFO ] Computed 19 place invariants in 6 ms
[2021-05-09 02:37:22] [INFO ] Dead Transitions using invariants and state equation in 119 ms returned []
Finished structural reductions, in 1 iterations. Remains : 135/171 places, 291/310 transitions.
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-13a-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s121 1) (NEQ s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1523 steps with 0 reset in 12 ms.
FORMULA DLCround-PT-13a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-06 finished in 287 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 310/310 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 144 transition count 310
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 36 place count 135 transition count 292
Iterating global reduction 1 with 9 rules applied. Total rules applied 45 place count 135 transition count 292
Applied a total of 45 rules in 5 ms. Remains 135 /171 variables (removed 36) and now considering 292/310 (removed 18) transitions.
[2021-05-09 02:37:22] [INFO ] Flow matrix only has 228 transitions (discarded 64 similar events)
// Phase 1: matrix 228 rows 135 cols
[2021-05-09 02:37:22] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-09 02:37:22] [INFO ] Implicit Places using invariants in 25 ms returned []
[2021-05-09 02:37:22] [INFO ] Flow matrix only has 228 transitions (discarded 64 similar events)
// Phase 1: matrix 228 rows 135 cols
[2021-05-09 02:37:22] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-09 02:37:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 02:37:22] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2021-05-09 02:37:22] [INFO ] Flow matrix only has 228 transitions (discarded 64 similar events)
// Phase 1: matrix 228 rows 135 cols
[2021-05-09 02:37:22] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-09 02:37:23] [INFO ] Dead Transitions using invariants and state equation in 118 ms returned []
Finished structural reductions, in 1 iterations. Remains : 135/171 places, 292/310 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-13a-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s11 1) (EQ s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-13a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-08 finished in 363 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 310/310 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 145 transition count 310
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 135 transition count 290
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 135 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 135 transition count 289
Applied a total of 47 rules in 4 ms. Remains 135 /171 variables (removed 36) and now considering 289/310 (removed 21) transitions.
[2021-05-09 02:37:23] [INFO ] Flow matrix only has 226 transitions (discarded 63 similar events)
// Phase 1: matrix 226 rows 135 cols
[2021-05-09 02:37:23] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-09 02:37:23] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-09 02:37:23] [INFO ] Flow matrix only has 226 transitions (discarded 63 similar events)
// Phase 1: matrix 226 rows 135 cols
[2021-05-09 02:37:23] [INFO ] Computed 20 place invariants in 5 ms
[2021-05-09 02:37:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 02:37:23] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2021-05-09 02:37:23] [INFO ] Flow matrix only has 226 transitions (discarded 63 similar events)
// Phase 1: matrix 226 rows 135 cols
[2021-05-09 02:37:23] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-09 02:37:23] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Finished structural reductions, in 1 iterations. Remains : 135/171 places, 289/310 transitions.
Stuttering acceptance computed with spot in 599 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DLCround-PT-13a-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s51 1) (EQ s133 1)), p1:(AND (EQ s88 1) (EQ s134 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-13a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-09 finished in 828 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 310/310 transitions.
Graph (trivial) has 302 edges and 171 vertex of which 139 / 171 are part of one of the 19 SCC in 0 ms
Free SCC test removed 120 places
Ensure Unique test removed 281 transitions
Reduce isomorphic transitions removed 281 transitions.
Graph (complete) has 74 edges and 51 vertex of which 25 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.0 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 24 transition count 27
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 20 place count 9 transition count 12
Iterating global reduction 2 with 15 rules applied. Total rules applied 35 place count 9 transition count 12
Applied a total of 35 rules in 2 ms. Remains 9 /171 variables (removed 162) and now considering 12/310 (removed 298) transitions.
[2021-05-09 02:37:23] [INFO ] Flow matrix only has 7 transitions (discarded 5 similar events)
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 02:37:23] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:37:24] [INFO ] Implicit Places using invariants in 13 ms returned []
[2021-05-09 02:37:24] [INFO ] Flow matrix only has 7 transitions (discarded 5 similar events)
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 02:37:24] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:37:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 02:37:24] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-09 02:37:24] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 02:37:24] [INFO ] Flow matrix only has 7 transitions (discarded 5 similar events)
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 02:37:24] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:37:24] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/171 places, 12/310 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-13a-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (NEQ s5 1) (NEQ s8 1)) (OR (NEQ s4 1) (NEQ s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-13a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-10 finished in 79 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((p0&&X(p1)) U (G((p0&&X(p1)))||(X(p1)&&p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 310/310 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 146 transition count 310
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 137 transition count 292
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 137 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 137 transition count 291
Applied a total of 44 rules in 4 ms. Remains 137 /171 variables (removed 34) and now considering 291/310 (removed 19) transitions.
[2021-05-09 02:37:24] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
// Phase 1: matrix 227 rows 137 cols
[2021-05-09 02:37:24] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-09 02:37:24] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-09 02:37:24] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
// Phase 1: matrix 227 rows 137 cols
[2021-05-09 02:37:24] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-09 02:37:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 02:37:24] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2021-05-09 02:37:24] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
// Phase 1: matrix 227 rows 137 cols
[2021-05-09 02:37:24] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-09 02:37:24] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Finished structural reductions, in 1 iterations. Remains : 137/171 places, 291/310 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1)]
Running random walk in product with property : DLCround-PT-13a-11 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 0}, { cond=(OR p2 p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (OR (NEQ s91 1) (NEQ s134 1)) (OR (NEQ s39 1) (NEQ s136 1))), p0:(OR (NEQ s39 1) (NEQ s136 1)), p1:(AND (OR (NEQ s33 1) (NEQ s135 1)) (OR (NEQ s91 1) (NEQ s134 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 407 ms.
Product exploration explored 100000 steps with 50000 reset in 382 ms.
Graph (complete) has 311 edges and 137 vertex of which 134 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Knowledge obtained : [p2, p0, p1]
Stuttering acceptance computed with spot in 55 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 314 ms.
Product exploration explored 100000 steps with 50000 reset in 279 ms.
[2021-05-09 02:37:26] [INFO ] Flatten gal took : 12 ms
[2021-05-09 02:37:26] [INFO ] Flatten gal took : 10 ms
[2021-05-09 02:37:26] [INFO ] Time to serialize gal into /tmp/LTL3082257931281516331.gal : 5 ms
[2021-05-09 02:37:26] [INFO ] Time to serialize properties into /tmp/LTL6488095772445091740.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3082257931281516331.gal, -t, CGAL, -LTL, /tmp/LTL6488095772445091740.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3082257931281516331.gal -t CGAL -LTL /tmp/LTL6488095772445091740.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(((X("(((p45!=1)||(p305!=1))&&((p116!=1)||(p240!=1)))"))&&("((p52!=1)||(p307!=1))"))U((G(("((p52!=1)||(p307!=1))")&&(X("(((p45!=1)||(p305!=1))&&((p116!=1)||(p240!=1)))"))))||(((X("(((p45!=1)||(p305!=1))&&((p116!=1)||(p240!=1)))"))&&("((p116!=1)||(p240!=1))"))&&("((p52!=1)||(p307!=1))"))))))
Formula 0 simplified : !F(("((p52!=1)||(p307!=1))" & X"(((p45!=1)||(p305!=1))&&((p116!=1)||(p240!=1)))") U (G("((p52!=1)||(p307!=1))" & X"(((p45!=1)||(p305!=1))&&((p116!=1)||(p240!=1)))") | ("((p52!=1)||(p307!=1))" & "((p116!=1)||(p240!=1))" & X"(((p45!=1)||(p305!=1))&&((p116!=1)||(p240!=1)))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.128273,20844,1,0,6,20610,33,0,3127,1904,19
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DLCround-PT-13a-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DLCround-PT-13a-11 finished in 2154 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 310/310 transitions.
Graph (trivial) has 306 edges and 171 vertex of which 140 / 171 are part of one of the 18 SCC in 1 ms
Free SCC test removed 122 places
Ensure Unique test removed 287 transitions
Reduce isomorphic transitions removed 287 transitions.
Graph (complete) has 68 edges and 49 vertex of which 22 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.0 ms
Discarding 27 places :
Also discarding 0 output transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 18 place count 6 transition count 7
Iterating global reduction 0 with 16 rules applied. Total rules applied 34 place count 6 transition count 7
Applied a total of 34 rules in 4 ms. Remains 6 /171 variables (removed 165) and now considering 7/310 (removed 303) transitions.
[2021-05-09 02:37:26] [INFO ] Flow matrix only has 5 transitions (discarded 2 similar events)
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 02:37:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 02:37:26] [INFO ] Implicit Places using invariants in 6 ms returned []
[2021-05-09 02:37:26] [INFO ] Flow matrix only has 5 transitions (discarded 2 similar events)
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 02:37:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 02:37:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 02:37:26] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-09 02:37:26] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 02:37:26] [INFO ] Flow matrix only has 5 transitions (discarded 2 similar events)
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 02:37:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 02:37:26] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/171 places, 7/310 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-13a-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-13a-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-12 finished in 76 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p0 U p1)||X((X(p2)||(!p0 U (p3||G(!p0))))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 310/310 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 146 transition count 310
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 33 place count 138 transition count 294
Iterating global reduction 1 with 8 rules applied. Total rules applied 41 place count 138 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 138 transition count 293
Applied a total of 42 rules in 5 ms. Remains 138 /171 variables (removed 33) and now considering 293/310 (removed 17) transitions.
[2021-05-09 02:37:26] [INFO ] Flow matrix only has 228 transitions (discarded 65 similar events)
// Phase 1: matrix 228 rows 138 cols
[2021-05-09 02:37:26] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-09 02:37:26] [INFO ] Implicit Places using invariants in 26 ms returned []
[2021-05-09 02:37:26] [INFO ] Flow matrix only has 228 transitions (discarded 65 similar events)
// Phase 1: matrix 228 rows 138 cols
[2021-05-09 02:37:26] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-09 02:37:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 02:37:26] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2021-05-09 02:37:26] [INFO ] Flow matrix only has 228 transitions (discarded 65 similar events)
// Phase 1: matrix 228 rows 138 cols
[2021-05-09 02:37:26] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-09 02:37:26] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 1 iterations. Remains : 138/171 places, 293/310 transitions.
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) p0 (NOT p3) (NOT p2)), (AND (NOT p2) p0 (NOT p3)), (AND (NOT p1) p0 (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p3) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (AND p0 (NOT p3)), (NOT p1)]
Running random walk in product with property : DLCround-PT-13a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(AND (EQ s95 1) (EQ s137 1)), p0:(EQ s98 1), p3:(AND (NEQ s98 1) (OR (NEQ s15 1) (NEQ s135 1))), p2:(OR (NEQ s118 1) (NEQ s136 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4691 steps with 327 reset in 37 ms.
FORMULA DLCround-PT-13a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-15 finished in 510 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620527847695

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="DLCround-PT-13a"
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-4028"
echo " Executing tool itstools"
echo " Input is DLCround-PT-13a, 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 r064-tall-162038397200437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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