fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r204-oct2-165281599300460
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ServersAndClients-PT-100020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
704.688 20980.00 39924.00 60.80 FTTTFFFFFTFFTFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r204-oct2-165281599300460.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ServersAndClients-PT-100020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599300460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 8.7K Apr 29 17:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 29 17:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 29 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 08:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 4.1M May 10 09:34 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 ServersAndClients-PT-100020-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652972962168

Running Version 202205111006
[2022-05-19 15:09:23] [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]
[2022-05-19 15:09:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 15:09:23] [INFO ] Load time of PNML (sax parser for PT used): 294 ms
[2022-05-19 15:09:23] [INFO ] Transformed 2421 places.
[2022-05-19 15:09:23] [INFO ] Transformed 4200 transitions.
[2022-05-19 15:09:23] [INFO ] Found NUPN structural information;
[2022-05-19 15:09:23] [INFO ] Parsed PT model containing 2421 places and 4200 transitions in 422 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ServersAndClients-PT-100020-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 2421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 299 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2421 cols
[2022-05-19 15:09:24] [INFO ] Computed 221 place invariants in 69 ms
[2022-05-19 15:09:25] [INFO ] Implicit Places using invariants in 910 ms returned [1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133, 135, 137, 139, 141, 143, 145, 147, 149, 151, 153, 155, 157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181, 183, 185, 187, 189, 191, 193, 195, 197, 199]
Discarding 99 places :
Implicit Place search using SMT only with invariants took 949 ms to find 99 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2322/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 176 ms. Remains 2322 /2322 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2322/2421 places, 4200/4200 transitions.
Support contains 38 out of 2322 places after structural reductions.
[2022-05-19 15:09:25] [INFO ] Flatten gal took : 239 ms
[2022-05-19 15:09:25] [INFO ] Flatten gal took : 161 ms
[2022-05-19 15:09:26] [INFO ] Input system was already deterministic with 4200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 598 ms. (steps per millisecond=16 ) properties (out of 26) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 4200 rows 2322 cols
[2022-05-19 15:09:27] [INFO ] Computed 122 place invariants in 71 ms
[2022-05-19 15:09:27] [INFO ] [Real]Absence check using 121 positive place invariants in 83 ms returned sat
[2022-05-19 15:09:27] [INFO ] [Real]Absence check using 121 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-19 15:09:29] [INFO ] After 1366ms SMT Verify possible using state equation in real domain returned unsat :2 sat :3
[2022-05-19 15:09:29] [INFO ] After 1897ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 272 ms.
[2022-05-19 15:09:30] [INFO ] After 2828ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 3 properties in 9 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA ServersAndClients-PT-100020-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F(p0) U (p1 U !F(p2)))))'
Support contains 4 out of 2322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2322/2322 places, 4200/4200 transitions.
Drop transitions removed 1879 transitions
Trivial Post-agglo rules discarded 1879 transitions
Performed 1879 trivial Post agglomeration. Transition count delta: 1879
Iterating post reduction 0 with 1879 rules applied. Total rules applied 1879 place count 2322 transition count 2321
Reduce places removed 1879 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 1898 rules applied. Total rules applied 3777 place count 443 transition count 2302
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 1600 transitions
Reduce isomorphic transitions removed 1600 transitions.
Iterating post reduction 2 with 1636 rules applied. Total rules applied 5413 place count 407 transition count 702
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 5611 place count 308 transition count 603
Drop transitions removed 198 transitions
Redundant transition composition rules discarded 198 transitions
Iterating global reduction 3 with 198 rules applied. Total rules applied 5809 place count 308 transition count 405
Applied a total of 5809 rules in 90 ms. Remains 308 /2322 variables (removed 2014) and now considering 405/4200 (removed 3795) transitions.
// Phase 1: matrix 405 rows 308 cols
[2022-05-19 15:09:30] [INFO ] Computed 105 place invariants in 3 ms
[2022-05-19 15:09:30] [INFO ] Implicit Places using invariants in 143 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 304, 306]
Discarding 103 places :
Implicit Place search using SMT only with invariants took 144 ms to find 103 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/2322 places, 405/4200 transitions.
Graph (trivial) has 199 edges and 205 vertex of which 101 / 205 are part of one of the 1 SCC in 3 ms
Free SCC test removed 100 places
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 100 place count 6 transition count 108
Iterating global reduction 0 with 99 rules applied. Total rules applied 199 place count 6 transition count 108
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 297 place count 6 transition count 10
Applied a total of 297 rules in 9 ms. Remains 6 /205 variables (removed 199) and now considering 10/405 (removed 395) transitions.
// Phase 1: matrix 10 rows 6 cols
[2022-05-19 15:09:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 15:09:30] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 10 rows 6 cols
[2022-05-19 15:09:30] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:09:30] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/2322 places, 10/4200 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/2322 places, 10/4200 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s4 1), p2:(AND (EQ s0 1) (EQ s2 1)), p1:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-00 finished in 593 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(p0))))'
Support contains 3 out of 2322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2322/2322 places, 4200/4200 transitions.
Applied a total of 0 rules in 139 ms. Remains 2322 /2322 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2322 cols
[2022-05-19 15:09:31] [INFO ] Computed 122 place invariants in 40 ms
[2022-05-19 15:09:33] [INFO ] Implicit Places using invariants in 1876 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 302, 403, 504, 605, 706, 807, 908, 1009, 1110, 1211, 1312, 1413, 1514, 1615, 1716, 1817, 1918, 2019, 2120, 2221]
Discarding 120 places :
Implicit Place search using SMT only with invariants took 1887 ms to find 120 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2202/2322 places, 4200/4200 transitions.
Discarding 1997 places :
Symmetric choice reduction at 0 with 1997 rule applications. Total rules 1997 place count 205 transition count 2203
Iterating global reduction 0 with 1997 rules applied. Total rules applied 3994 place count 205 transition count 2203
Ensure Unique test removed 1899 transitions
Reduce isomorphic transitions removed 1899 transitions.
Iterating post reduction 0 with 1899 rules applied. Total rules applied 5893 place count 205 transition count 304
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 5991 place count 107 transition count 206
Iterating global reduction 1 with 98 rules applied. Total rules applied 6089 place count 107 transition count 206
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 6186 place count 10 transition count 109
Iterating global reduction 1 with 97 rules applied. Total rules applied 6283 place count 10 transition count 109
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 6380 place count 10 transition count 12
Applied a total of 6380 rules in 67 ms. Remains 10 /2202 variables (removed 2192) and now considering 12/4200 (removed 4188) transitions.
// Phase 1: matrix 12 rows 10 cols
[2022-05-19 15:09:33] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:09:33] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 12 rows 10 cols
[2022-05-19 15:09:33] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:09:33] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/2322 places, 12/4200 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/2322 places, 12/4200 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s9 0) (OR (EQ s0 0) (EQ s5 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 199 ms.
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ServersAndClients-PT-100020-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100020-LTLFireability-01 finished in 2555 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 2322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2322/2322 places, 4200/4200 transitions.
Drop transitions removed 1881 transitions
Trivial Post-agglo rules discarded 1881 transitions
Performed 1881 trivial Post agglomeration. Transition count delta: 1881
Iterating post reduction 0 with 1881 rules applied. Total rules applied 1881 place count 2322 transition count 2319
Reduce places removed 1881 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 1900 rules applied. Total rules applied 3781 place count 441 transition count 2300
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1800 transitions
Reduce isomorphic transitions removed 1800 transitions.
Iterating post reduction 2 with 1838 rules applied. Total rules applied 5619 place count 403 transition count 500
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 5817 place count 304 transition count 401
Applied a total of 5817 rules in 49 ms. Remains 304 /2322 variables (removed 2018) and now considering 401/4200 (removed 3799) transitions.
// Phase 1: matrix 401 rows 304 cols
[2022-05-19 15:09:33] [INFO ] Computed 103 place invariants in 4 ms
[2022-05-19 15:09:33] [INFO ] Implicit Places using invariants in 135 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100]
Discarding 101 places :
Implicit Place search using SMT only with invariants took 136 ms to find 101 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 203/2322 places, 401/4200 transitions.
Graph (trivial) has 199 edges and 203 vertex of which 101 / 203 are part of one of the 1 SCC in 0 ms
Free SCC test removed 100 places
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 100 place count 4 transition count 104
Iterating global reduction 0 with 99 rules applied. Total rules applied 199 place count 4 transition count 104
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 297 place count 4 transition count 6
Applied a total of 297 rules in 4 ms. Remains 4 /203 variables (removed 199) and now considering 6/401 (removed 395) transitions.
// Phase 1: matrix 6 rows 4 cols
[2022-05-19 15:09:33] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:09:33] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2022-05-19 15:09:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 15:09:33] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/2322 places, 6/4200 transitions.
Finished structural reductions, in 2 iterations. Remains : 4/2322 places, 6/4200 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-04 automaton TGBA Formula[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:(AND (EQ s0 1) (EQ s2 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 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-04 finished in 290 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(true U p0)))'
Support contains 1 out of 2322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2322/2322 places, 4200/4200 transitions.
Applied a total of 0 rules in 132 ms. Remains 2322 /2322 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2322 cols
[2022-05-19 15:09:34] [INFO ] Computed 122 place invariants in 46 ms
[2022-05-19 15:09:36] [INFO ] Implicit Places using invariants in 2326 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 302, 403, 504, 605, 706, 807, 908, 1009, 1110, 1211, 1312, 1413, 1514, 1615, 1716, 1817, 1918, 2019, 2120, 2221]
Discarding 121 places :
Implicit Place search using SMT only with invariants took 2330 ms to find 121 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2201/2322 places, 4200/4200 transitions.
Discarding 1998 places :
Symmetric choice reduction at 0 with 1998 rule applications. Total rules 1998 place count 203 transition count 2202
Iterating global reduction 0 with 1998 rules applied. Total rules applied 3996 place count 203 transition count 2202
Ensure Unique test removed 1899 transitions
Reduce isomorphic transitions removed 1899 transitions.
Iterating post reduction 0 with 1899 rules applied. Total rules applied 5895 place count 203 transition count 303
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 5994 place count 104 transition count 204
Iterating global reduction 1 with 99 rules applied. Total rules applied 6093 place count 104 transition count 204
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 6191 place count 6 transition count 106
Iterating global reduction 1 with 98 rules applied. Total rules applied 6289 place count 6 transition count 106
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 6387 place count 6 transition count 8
Applied a total of 6387 rules in 26 ms. Remains 6 /2201 variables (removed 2195) and now considering 8/4200 (removed 4192) transitions.
// Phase 1: matrix 8 rows 6 cols
[2022-05-19 15:09:36] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:09:36] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2022-05-19 15:09:36] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:09:36] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 6/2322 places, 8/4200 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/2322 places, 8/4200 transitions.
Stuttering acceptance computed with spot in 61 ms :[true, p0, p0]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-05 finished in 2602 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(F(G((!(p1 U p2)||p3)))||p4))))'
Support contains 4 out of 2322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2322/2322 places, 4200/4200 transitions.
Drop transitions removed 1996 transitions
Trivial Post-agglo rules discarded 1996 transitions
Performed 1996 trivial Post agglomeration. Transition count delta: 1996
Iterating post reduction 0 with 1996 rules applied. Total rules applied 1996 place count 2322 transition count 2204
Reduce places removed 2012 places and 0 transitions.
Ensure Unique test removed 1500 transitions
Reduce isomorphic transitions removed 1500 transitions.
Iterating post reduction 1 with 3512 rules applied. Total rules applied 5508 place count 310 transition count 704
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 5706 place count 211 transition count 605
Drop transitions removed 396 transitions
Redundant transition composition rules discarded 396 transitions
Iterating global reduction 2 with 396 rules applied. Total rules applied 6102 place count 211 transition count 209
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 2 with 98 rules applied. Total rules applied 6200 place count 210 transition count 112
Reduce places removed 193 places and 0 transitions.
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Iterating post reduction 3 with 288 rules applied. Total rules applied 6488 place count 17 transition count 17
Applied a total of 6488 rules in 40 ms. Remains 17 /2322 variables (removed 2305) and now considering 17/4200 (removed 4183) transitions.
// Phase 1: matrix 17 rows 17 cols
[2022-05-19 15:09:36] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-19 15:09:36] [INFO ] Implicit Places using invariants in 22 ms returned [0, 1, 2, 3, 9, 11, 13, 15]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 23 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/2322 places, 17/4200 transitions.
Graph (trivial) has 9 edges and 9 vertex of which 5 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Applied a total of 1 rules in 0 ms. Remains 5 /9 variables (removed 4) and now considering 9/17 (removed 8) transitions.
// Phase 1: matrix 9 rows 5 cols
[2022-05-19 15:09:36] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:09:36] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2022-05-19 15:09:36] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:09:36] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/2322 places, 9/4200 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/2322 places, 9/4200 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (AND p2 (NOT p3) (NOT p4))), (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p3) (NOT p4))), (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p3) (NOT p4)))]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p4)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p4) (NOT p3) p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2)) (AND (NOT p4) p3) (AND (NOT p4) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p4) (NOT p3) p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3) p1 (NOT p2)) (AND (NOT p4) (NOT p3) p1 (NOT p2))), acceptance={1} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) p3 p2) (AND (NOT p4) p3 p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p4) (NOT p3) p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p3 p1 (NOT p2)) (AND (NOT p4) p3 p1 (NOT p2))), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p3) p1 (NOT p2)) (AND (NOT p4) (NOT p3) p1 (NOT p2))), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2 1), p4:(EQ s4 0), p3:(EQ s3 1), p1:(EQ s4 1), p2:(EQ s1 1)], nbAcceptance=2, 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 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-06 finished in 271 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(!p0 U G(p1))) U G(!p2)))'
Support contains 6 out of 2322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2322/2322 places, 4200/4200 transitions.
Drop transitions removed 1762 transitions
Trivial Post-agglo rules discarded 1762 transitions
Performed 1762 trivial Post agglomeration. Transition count delta: 1762
Iterating post reduction 0 with 1762 rules applied. Total rules applied 1762 place count 2322 transition count 2438
Reduce places removed 1762 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 1798 rules applied. Total rules applied 3560 place count 560 transition count 2402
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 1500 transitions
Reduce isomorphic transitions removed 1500 transitions.
Iterating post reduction 2 with 1552 rules applied. Total rules applied 5112 place count 508 transition count 902
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 5310 place count 409 transition count 803
Drop transitions removed 198 transitions
Redundant transition composition rules discarded 198 transitions
Iterating global reduction 3 with 198 rules applied. Total rules applied 5508 place count 409 transition count 605
Applied a total of 5508 rules in 91 ms. Remains 409 /2322 variables (removed 1913) and now considering 605/4200 (removed 3595) transitions.
// Phase 1: matrix 605 rows 409 cols
[2022-05-19 15:09:36] [INFO ] Computed 106 place invariants in 5 ms
[2022-05-19 15:09:37] [INFO ] Implicit Places using invariants in 171 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 203, 407]
Discarding 103 places :
Implicit Place search using SMT only with invariants took 175 ms to find 103 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 306/2322 places, 605/4200 transitions.
Graph (trivial) has 197 edges and 306 vertex of which 100 / 306 are part of one of the 1 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 199 place count 9 transition count 211
Iterating global reduction 0 with 198 rules applied. Total rules applied 397 place count 9 transition count 211
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 591 place count 9 transition count 17
Applied a total of 591 rules in 5 ms. Remains 9 /306 variables (removed 297) and now considering 17/605 (removed 588) transitions.
// Phase 1: matrix 17 rows 9 cols
[2022-05-19 15:09:37] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 15:09:37] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 17 rows 9 cols
[2022-05-19 15:09:37] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 15:09:37] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/2322 places, 17/4200 transitions.
Finished structural reductions, in 2 iterations. Remains : 9/2322 places, 17/4200 transitions.
Stuttering acceptance computed with spot in 101 ms :[p2, p1, (AND p1 (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s0 1) (EQ s6 1)), p1:(AND (EQ s1 1) (EQ s4 1)), p0:(OR (EQ s8 1) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3100 reset in 157 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 1 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-07 finished in 589 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G(G(!(X(X(p0)) U p1)))))))'
Support contains 3 out of 2322 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2322/2322 places, 4200/4200 transitions.
Drop transitions removed 1880 transitions
Trivial Post-agglo rules discarded 1880 transitions
Performed 1880 trivial Post agglomeration. Transition count delta: 1880
Iterating post reduction 0 with 1880 rules applied. Total rules applied 1880 place count 2322 transition count 2320
Reduce places removed 1880 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 1899 rules applied. Total rules applied 3779 place count 442 transition count 2301
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1700 transitions
Reduce isomorphic transitions removed 1700 transitions.
Iterating post reduction 2 with 1737 rules applied. Total rules applied 5516 place count 405 transition count 601
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 5714 place count 306 transition count 502
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 5813 place count 306 transition count 403
Applied a total of 5813 rules in 50 ms. Remains 306 /2322 variables (removed 2016) and now considering 403/4200 (removed 3797) transitions.
// Phase 1: matrix 403 rows 306 cols
[2022-05-19 15:09:37] [INFO ] Computed 104 place invariants in 4 ms
[2022-05-19 15:09:37] [INFO ] Implicit Places using invariants in 146 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 304]
Discarding 102 places :
Implicit Place search using SMT only with invariants took 152 ms to find 102 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 204/2322 places, 403/4200 transitions.
Graph (trivial) has 199 edges and 204 vertex of which 101 / 204 are part of one of the 1 SCC in 0 ms
Free SCC test removed 100 places
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 6 transition count 107
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 6 transition count 107
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 294 place count 6 transition count 10
Applied a total of 294 rules in 2 ms. Remains 6 /204 variables (removed 198) and now considering 10/403 (removed 393) transitions.
// Phase 1: matrix 10 rows 6 cols
[2022-05-19 15:09:37] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:09:37] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 10 rows 6 cols
[2022-05-19 15:09:37] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:09:37] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/2322 places, 10/4200 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/2322 places, 10/4200 transitions.
Stuttering acceptance computed with spot in 35 ms :[p1]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s4 1) (AND (EQ s0 1) (EQ s2 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 71 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-08 finished in 365 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||G(p1)))))'
Support contains 4 out of 2322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2322/2322 places, 4200/4200 transitions.
Applied a total of 0 rules in 124 ms. Remains 2322 /2322 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2322 cols
[2022-05-19 15:09:37] [INFO ] Computed 122 place invariants in 49 ms
[2022-05-19 15:09:39] [INFO ] Implicit Places using invariants in 1825 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 504, 605, 706, 807, 908, 1009, 1211, 1312, 1413, 1514, 1615, 1716, 1817, 1918, 2019, 2120, 2221]
Discarding 118 places :
Implicit Place search using SMT only with invariants took 1835 ms to find 118 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2204/2322 places, 4200/4200 transitions.
Discarding 1699 places :
Symmetric choice reduction at 0 with 1699 rule applications. Total rules 1699 place count 505 transition count 2501
Iterating global reduction 0 with 1699 rules applied. Total rules applied 3398 place count 505 transition count 2501
Ensure Unique test removed 1600 transitions
Reduce isomorphic transitions removed 1600 transitions.
Iterating post reduction 0 with 1600 rules applied. Total rules applied 4998 place count 505 transition count 901
Discarding 396 places :
Symmetric choice reduction at 1 with 396 rule applications. Total rules 5394 place count 109 transition count 505
Iterating global reduction 1 with 396 rules applied. Total rules applied 5790 place count 109 transition count 505
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 5887 place count 12 transition count 117
Iterating global reduction 1 with 97 rules applied. Total rules applied 5984 place count 12 transition count 117
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 6081 place count 12 transition count 20
Applied a total of 6081 rules in 38 ms. Remains 12 /2204 variables (removed 2192) and now considering 20/4200 (removed 4180) transitions.
// Phase 1: matrix 20 rows 12 cols
[2022-05-19 15:09:39] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 15:09:39] [INFO ] Implicit Places using invariants in 18 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/2322 places, 20/4200 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 19
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 10 transition count 16
Applied a total of 5 rules in 0 ms. Remains 10 /11 variables (removed 1) and now considering 16/20 (removed 4) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-19 15:09:39] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 15:09:39] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 16 rows 10 cols
[2022-05-19 15:09:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 15:09:39] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 10/2322 places, 16/4200 transitions.
Finished structural reductions, in 3 iterations. Remains : 10/2322 places, 16/4200 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (NEQ s4 1) (NEQ s8 1)), p0:(OR (EQ s3 0) (EQ s6 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 77 ms.
Product exploration explored 100000 steps with 33333 reset in 92 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ServersAndClients-PT-100020-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100020-LTLFireability-09 finished in 2408 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U !G((X(F(G((X(F(p0)) U p1)))) U p2))))'
Support contains 5 out of 2322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2322/2322 places, 4200/4200 transitions.
Drop transitions removed 1880 transitions
Trivial Post-agglo rules discarded 1880 transitions
Performed 1880 trivial Post agglomeration. Transition count delta: 1880
Iterating post reduction 0 with 1880 rules applied. Total rules applied 1880 place count 2322 transition count 2320
Reduce places removed 1880 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 1899 rules applied. Total rules applied 3779 place count 442 transition count 2301
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1700 transitions
Reduce isomorphic transitions removed 1700 transitions.
Iterating post reduction 2 with 1737 rules applied. Total rules applied 5516 place count 405 transition count 601
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 5615 place count 405 transition count 502
Applied a total of 5615 rules in 39 ms. Remains 405 /2322 variables (removed 1917) and now considering 502/4200 (removed 3698) transitions.
// Phase 1: matrix 502 rows 405 cols
[2022-05-19 15:09:40] [INFO ] Computed 104 place invariants in 4 ms
[2022-05-19 15:09:40] [INFO ] Implicit Places using invariants in 133 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 403]
Discarding 101 places :
Implicit Place search using SMT only with invariants took 134 ms to find 101 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 304/2322 places, 502/4200 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 98 place count 206 transition count 404
Iterating global reduction 0 with 98 rules applied. Total rules applied 196 place count 206 transition count 404
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 294 place count 108 transition count 306
Iterating global reduction 0 with 98 rules applied. Total rules applied 392 place count 108 transition count 306
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 488 place count 12 transition count 114
Iterating global reduction 0 with 96 rules applied. Total rules applied 584 place count 12 transition count 114
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 96 rules applied. Total rules applied 680 place count 12 transition count 18
Applied a total of 680 rules in 7 ms. Remains 12 /304 variables (removed 292) and now considering 18/502 (removed 484) transitions.
// Phase 1: matrix 18 rows 12 cols
[2022-05-19 15:09:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 15:09:40] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 18 rows 12 cols
[2022-05-19 15:09:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 15:09:40] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/2322 places, 18/4200 transitions.
Finished structural reductions, in 2 iterations. Remains : 12/2322 places, 18/4200 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s7 1) (EQ s8 1)), p1:(AND (EQ s0 1) (EQ s1 1)), p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 2388 reset in 78 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 1 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-11 finished in 470 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2322/2322 places, 4200/4200 transitions.
Applied a total of 0 rules in 109 ms. Remains 2322 /2322 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2322 cols
[2022-05-19 15:09:40] [INFO ] Computed 122 place invariants in 68 ms
[2022-05-19 15:09:42] [INFO ] Implicit Places using invariants in 2098 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 302, 403, 504, 605, 706, 807, 908, 1009, 1110, 1211, 1312, 1413, 1514, 1615, 1716, 1817, 1918, 2019, 2120, 2221]
Discarding 121 places :
Implicit Place search using SMT only with invariants took 2102 ms to find 121 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2201/2322 places, 4200/4200 transitions.
Discarding 1998 places :
Symmetric choice reduction at 0 with 1998 rule applications. Total rules 1998 place count 203 transition count 2202
Iterating global reduction 0 with 1998 rules applied. Total rules applied 3996 place count 203 transition count 2202
Ensure Unique test removed 1899 transitions
Reduce isomorphic transitions removed 1899 transitions.
Iterating post reduction 0 with 1899 rules applied. Total rules applied 5895 place count 203 transition count 303
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 5994 place count 104 transition count 204
Iterating global reduction 1 with 99 rules applied. Total rules applied 6093 place count 104 transition count 204
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 6191 place count 6 transition count 106
Iterating global reduction 1 with 98 rules applied. Total rules applied 6289 place count 6 transition count 106
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 6387 place count 6 transition count 8
Applied a total of 6387 rules in 17 ms. Remains 6 /2201 variables (removed 2195) and now considering 8/4200 (removed 4192) transitions.
// Phase 1: matrix 8 rows 6 cols
[2022-05-19 15:09:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:09:42] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2022-05-19 15:09:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:09:42] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 6/2322 places, 8/4200 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/2322 places, 8/4200 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s5 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 39 ms.
Product exploration explored 100000 steps with 50000 reset in 43 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ServersAndClients-PT-100020-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100020-LTLFireability-15 finished in 2536 ms.
All properties solved by simple procedures.
Total runtime 19686 ms.

BK_STOP 1652972983148

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="ServersAndClients-PT-100020"
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 ServersAndClients-PT-100020, 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 r204-oct2-165281599300460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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