Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r351-tall-171679102200382.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ServersAndClients-PT-100020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679102200382
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 16:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 13 16:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 13 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 16:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.1M May 18 16:43 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-LTLCardinality-00
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-01
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-02
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-03
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-04
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-05
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-06
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-07
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-08
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-09
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-10
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-11
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-12
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-13
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-14
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716893251822

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-100020
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 10:47:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 10:47:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 10:47:33] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2024-05-28 10:47:33] [INFO ] Transformed 2421 places.
[2024-05-28 10:47:33] [INFO ] Transformed 4200 transitions.
[2024-05-28 10:47:33] [INFO ] Found NUPN structural information;
[2024-05-28 10:47:33] [INFO ] Parsed PT model containing 2421 places and 4200 transitions and 12800 arcs in 325 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ServersAndClients-PT-100020-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 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 370 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2421 cols
[2024-05-28 10:47:34] [INFO ] Computed 221 invariants in 99 ms
[2024-05-28 10:47:35] [INFO ] Implicit Places using invariants in 1126 ms returned [1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 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 100 places :
Implicit Place search using SMT only with invariants took 1161 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2321/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 148 ms. Remains 2321 /2321 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1681 ms. Remains : 2321/2421 places, 4200/4200 transitions.
Support contains 26 out of 2321 places after structural reductions.
[2024-05-28 10:47:36] [INFO ] Flatten gal took : 268 ms
[2024-05-28 10:47:36] [INFO ] Flatten gal took : 165 ms
[2024-05-28 10:47:36] [INFO ] Input system was already deterministic with 4200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4200 rows 2321 cols
[2024-05-28 10:47:37] [INFO ] Computed 121 invariants in 54 ms
[2024-05-28 10:47:38] [INFO ] [Real]Absence check using 121 positive place invariants in 124 ms returned sat
[2024-05-28 10:47:38] [INFO ] After 540ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
FORMULA ServersAndClients-PT-100020-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 2321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Drop transitions removed 1899 transitions
Trivial Post-agglo rules discarded 1899 transitions
Performed 1899 trivial Post agglomeration. Transition count delta: 1899
Iterating post reduction 0 with 1899 rules applied. Total rules applied 1899 place count 2321 transition count 2301
Reduce places removed 1917 places and 0 transitions.
Ensure Unique test removed 1700 transitions
Reduce isomorphic transitions removed 1700 transitions.
Iterating post reduction 1 with 3617 rules applied. Total rules applied 5516 place count 404 transition count 601
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 5716 place count 304 transition count 501
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 5815 place count 304 transition count 402
Applied a total of 5815 rules in 117 ms. Remains 304 /2321 variables (removed 2017) and now considering 402/4200 (removed 3798) transitions.
// Phase 1: matrix 402 rows 304 cols
[2024-05-28 10:47:38] [INFO ] Computed 103 invariants in 2 ms
[2024-05-28 10:47:38] [INFO ] Implicit Places using invariants in 159 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, 302]
Discarding 101 places :
Implicit Place search using SMT only with invariants took 163 ms to find 101 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 203/2321 places, 402/4200 transitions.
Graph (trivial) has 200 edges and 203 vertex of which 101 / 203 are part of one of the 1 SCC in 3 ms
Free SCC test removed 100 places
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 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 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 298 place count 4 transition count 5
Applied a total of 298 rules in 11 ms. Remains 4 /203 variables (removed 199) and now considering 5/402 (removed 397) transitions.
// Phase 1: matrix 5 rows 4 cols
[2024-05-28 10:47:38] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 10:47:38] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-28 10:47:38] [INFO ] Invariant cache hit.
[2024-05-28 10:47:38] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/2321 places, 5/4200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 327 ms. Remains : 4/2321 places, 5/4200 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 196 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA ServersAndClients-PT-100020-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLCardinality-04 finished in 585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 2321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Applied a total of 0 rules in 108 ms. Remains 2321 /2321 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2321 cols
[2024-05-28 10:47:38] [INFO ] Computed 121 invariants in 65 ms
[2024-05-28 10:47:41] [INFO ] Implicit Places using invariants in 2296 ms returned [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 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, 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, 301, 402, 503, 604, 705, 806, 907, 1008, 1109, 1210, 1311, 1412, 1513, 1614, 1715, 1816, 1917, 2018, 2119, 2220]
Discarding 116 places :
Implicit Place search using SMT only with invariants took 2306 ms to find 116 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2205/2321 places, 4200/4200 transitions.
Discarding 1993 places :
Symmetric choice reduction at 0 with 1993 rule applications. Total rules 1993 place count 212 transition count 2207
Iterating global reduction 0 with 1993 rules applied. Total rules applied 3986 place count 212 transition count 2207
Ensure Unique test removed 1898 transitions
Reduce isomorphic transitions removed 1898 transitions.
Iterating post reduction 0 with 1898 rules applied. Total rules applied 5884 place count 212 transition count 309
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 5979 place count 117 transition count 214
Iterating global reduction 1 with 95 rules applied. Total rules applied 6074 place count 117 transition count 214
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 6167 place count 24 transition count 121
Iterating global reduction 1 with 93 rules applied. Total rules applied 6260 place count 24 transition count 121
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 6353 place count 24 transition count 28
Applied a total of 6353 rules in 71 ms. Remains 24 /2205 variables (removed 2181) and now considering 28/4200 (removed 4172) transitions.
// Phase 1: matrix 28 rows 24 cols
[2024-05-28 10:47:41] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 10:47:41] [INFO ] Implicit Places using invariants in 26 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 27 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 20/2321 places, 28/4200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 16 transition count 24
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 16 transition count 24
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 12 transition count 20
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 12 transition count 20
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 8 transition count 16
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 8 transition count 16
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 8 transition count 12
Applied a total of 28 rules in 1 ms. Remains 8 /20 variables (removed 12) and now considering 12/28 (removed 16) transitions.
// Phase 1: matrix 12 rows 8 cols
[2024-05-28 10:47:41] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 10:47:41] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 10:47:41] [INFO ] Invariant cache hit.
[2024-05-28 10:47:41] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 8/2321 places, 12/4200 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2557 ms. Remains : 8/2321 places, 12/4200 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLCardinality-05 automaton TGBA Formula[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: 2}]], initial=3, aps=[p0:(OR (EQ s7 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 54 steps with 0 reset in 2 ms.
FORMULA ServersAndClients-PT-100020-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLCardinality-05 finished in 2711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(p1))||p0))))'
Support contains 4 out of 2321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Applied a total of 0 rules in 177 ms. Remains 2321 /2321 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2321 cols
[2024-05-28 10:47:41] [INFO ] Computed 121 invariants in 58 ms
[2024-05-28 10:47:43] [INFO ] Implicit Places using invariants in 2254 ms returned [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 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, 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, 301, 402, 503, 604, 705, 806, 907, 1008, 1109, 1210, 1311, 1412, 1513, 1614, 1715, 1816, 1917, 2018, 2119, 2220]
Discarding 116 places :
Implicit Place search using SMT only with invariants took 2266 ms to find 116 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2205/2321 places, 4200/4200 transitions.
Discarding 1991 places :
Symmetric choice reduction at 0 with 1991 rule applications. Total rules 1991 place count 214 transition count 2209
Iterating global reduction 0 with 1991 rules applied. Total rules applied 3982 place count 214 transition count 2209
Ensure Unique test removed 1896 transitions
Reduce isomorphic transitions removed 1896 transitions.
Iterating post reduction 0 with 1896 rules applied. Total rules applied 5878 place count 214 transition count 313
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 5973 place count 119 transition count 218
Iterating global reduction 1 with 95 rules applied. Total rules applied 6068 place count 119 transition count 218
Discarding 92 places :
Symmetric choice reduction at 1 with 92 rule applications. Total rules 6160 place count 27 transition count 126
Iterating global reduction 1 with 92 rules applied. Total rules applied 6252 place count 27 transition count 126
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 6344 place count 27 transition count 34
Applied a total of 6344 rules in 35 ms. Remains 27 /2205 variables (removed 2178) and now considering 34/4200 (removed 4166) transitions.
// Phase 1: matrix 34 rows 27 cols
[2024-05-28 10:47:43] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 10:47:44] [INFO ] Implicit Places using invariants in 26 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 27 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 23/2321 places, 34/4200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 19 transition count 30
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 19 transition count 30
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 15 transition count 26
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 15 transition count 26
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 12 transition count 23
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 12 transition count 23
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 12 transition count 20
Applied a total of 25 rules in 1 ms. Remains 12 /23 variables (removed 11) and now considering 20/34 (removed 14) transitions.
// Phase 1: matrix 20 rows 12 cols
[2024-05-28 10:47:44] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 10:47:44] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 10:47:44] [INFO ] Invariant cache hit.
[2024-05-28 10:47:44] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 12/2321 places, 20/4200 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2560 ms. Remains : 12/2321 places, 20/4200 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100020-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s8 1)), p1:(OR (EQ s9 0) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Product exploration explored 100000 steps with 50000 reset in 96 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 p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-100020-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100020-LTLCardinality-06 finished in 2949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p1)&&p0))))'
Support contains 4 out of 2321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Applied a total of 0 rules in 162 ms. Remains 2321 /2321 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2321 cols
[2024-05-28 10:47:44] [INFO ] Computed 121 invariants in 55 ms
[2024-05-28 10:47:46] [INFO ] Implicit Places using invariants in 2118 ms returned [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 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, 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, 301, 402, 503, 604, 705, 806, 907, 1008, 1109, 1210, 1311, 1412, 1513, 1614, 1715, 1816, 1917, 2018, 2119, 2220]
Discarding 116 places :
Implicit Place search using SMT only with invariants took 2128 ms to find 116 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2205/2321 places, 4200/4200 transitions.
Discarding 1991 places :
Symmetric choice reduction at 0 with 1991 rule applications. Total rules 1991 place count 214 transition count 2209
Iterating global reduction 0 with 1991 rules applied. Total rules applied 3982 place count 214 transition count 2209
Ensure Unique test removed 1896 transitions
Reduce isomorphic transitions removed 1896 transitions.
Iterating post reduction 0 with 1896 rules applied. Total rules applied 5878 place count 214 transition count 313
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 5973 place count 119 transition count 218
Iterating global reduction 1 with 95 rules applied. Total rules applied 6068 place count 119 transition count 218
Discarding 91 places :
Symmetric choice reduction at 1 with 91 rule applications. Total rules 6159 place count 28 transition count 127
Iterating global reduction 1 with 91 rules applied. Total rules applied 6250 place count 28 transition count 127
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 6341 place count 28 transition count 36
Applied a total of 6341 rules in 31 ms. Remains 28 /2205 variables (removed 2177) and now considering 36/4200 (removed 4164) transitions.
// Phase 1: matrix 36 rows 28 cols
[2024-05-28 10:47:46] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 10:47:46] [INFO ] Implicit Places using invariants in 34 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 35 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 24/2321 places, 36/4200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 20 transition count 32
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 20 transition count 32
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 16 transition count 28
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 16 transition count 28
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 12 transition count 24
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 12 transition count 24
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 12 transition count 20
Applied a total of 28 rules in 1 ms. Remains 12 /24 variables (removed 12) and now considering 20/36 (removed 16) transitions.
// Phase 1: matrix 20 rows 12 cols
[2024-05-28 10:47:46] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 10:47:46] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-28 10:47:46] [INFO ] Invariant cache hit.
[2024-05-28 10:47:46] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 12/2321 places, 20/4200 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2399 ms. Remains : 12/2321 places, 20/4200 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (NEQ s10 0) (NEQ s11 1)), p0:(AND (NEQ s9 0) (NEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1283 reset in 76 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ServersAndClients-PT-100020-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100020-LTLCardinality-09 finished in 2629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Drop transitions removed 1998 transitions
Trivial Post-agglo rules discarded 1998 transitions
Performed 1998 trivial Post agglomeration. Transition count delta: 1998
Iterating post reduction 0 with 1998 rules applied. Total rules applied 1998 place count 2321 transition count 2202
Reduce places removed 2016 places and 0 transitions.
Ensure Unique test removed 1700 transitions
Reduce isomorphic transitions removed 1700 transitions.
Iterating post reduction 1 with 3716 rules applied. Total rules applied 5714 place count 305 transition count 502
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 5914 place count 205 transition count 402
Drop transitions removed 198 transitions
Redundant transition composition rules discarded 198 transitions
Iterating global reduction 2 with 198 rules applied. Total rules applied 6112 place count 205 transition count 204
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 2 with 98 rules applied. Total rules applied 6210 place count 205 transition count 106
Reduce places removed 196 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 3 with 293 rules applied. Total rules applied 6503 place count 9 transition count 9
Applied a total of 6503 rules in 49 ms. Remains 9 /2321 variables (removed 2312) and now considering 9/4200 (removed 4191) transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-05-28 10:47:47] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 10:47:47] [INFO ] Implicit Places using invariants in 33 ms returned [0, 1, 5, 7]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 34 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/2321 places, 9/4200 transitions.
Graph (trivial) has 5 edges and 5 vertex of which 3 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Applied a total of 1 rules in 1 ms. Remains 3 /5 variables (removed 2) and now considering 5/9 (removed 4) transitions.
// Phase 1: matrix 5 rows 3 cols
[2024-05-28 10:47:47] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 10:47:47] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-28 10:47:47] [INFO ] Invariant cache hit.
[2024-05-28 10:47:47] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/2321 places, 5/4200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 121 ms. Remains : 3/2321 places, 5/4200 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s1 0) (NEQ s2 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 0 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100020-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLCardinality-11 finished in 185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)&&F(G(p1)))) U (p1 U p2))))'
Support contains 4 out of 2321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Applied a total of 0 rules in 128 ms. Remains 2321 /2321 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2321 cols
[2024-05-28 10:47:47] [INFO ] Computed 121 invariants in 74 ms
[2024-05-28 10:47:49] [INFO ] Implicit Places using invariants in 2080 ms returned [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 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, 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, 301, 402, 503, 604, 705, 806, 907, 1008, 1109, 1210, 1311, 1412, 1513, 1614, 1715, 1816, 1917, 2018, 2119, 2220]
Discarding 116 places :
Implicit Place search using SMT only with invariants took 2085 ms to find 116 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2205/2321 places, 4200/4200 transitions.
Discarding 1992 places :
Symmetric choice reduction at 0 with 1992 rule applications. Total rules 1992 place count 213 transition count 2208
Iterating global reduction 0 with 1992 rules applied. Total rules applied 3984 place count 213 transition count 2208
Ensure Unique test removed 1898 transitions
Reduce isomorphic transitions removed 1898 transitions.
Iterating post reduction 0 with 1898 rules applied. Total rules applied 5882 place count 213 transition count 310
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 5976 place count 119 transition count 216
Iterating global reduction 1 with 94 rules applied. Total rules applied 6070 place count 119 transition count 216
Discarding 92 places :
Symmetric choice reduction at 1 with 92 rule applications. Total rules 6162 place count 27 transition count 124
Iterating global reduction 1 with 92 rules applied. Total rules applied 6254 place count 27 transition count 124
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 6346 place count 27 transition count 32
Applied a total of 6346 rules in 27 ms. Remains 27 /2205 variables (removed 2178) and now considering 32/4200 (removed 4168) transitions.
// Phase 1: matrix 32 rows 27 cols
[2024-05-28 10:47:49] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 10:47:49] [INFO ] Implicit Places using invariants in 33 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 34 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 23/2321 places, 32/4200 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 20 transition count 29
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 20 transition count 29
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 17 transition count 26
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 17 transition count 26
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 14 transition count 23
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 14 transition count 23
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 14 transition count 20
Applied a total of 21 rules in 1 ms. Remains 14 /23 variables (removed 9) and now considering 20/32 (removed 12) transitions.
// Phase 1: matrix 20 rows 14 cols
[2024-05-28 10:47:49] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 10:47:49] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 10:47:49] [INFO ] Invariant cache hit.
[2024-05-28 10:47:49] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 14/2321 places, 20/4200 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2326 ms. Remains : 14/2321 places, 20/4200 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s7 0) (EQ s12 1)), p1:(EQ s5 1), p0:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 69 ms.
Product exploration explored 100000 steps with 50000 reset in 75 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 p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p2), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-100020-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100020-LTLCardinality-13 finished in 2700 ms.
All properties solved by simple procedures.
Total runtime 16649 ms.

BK_STOP 1716893271048

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ServersAndClients-PT-100020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ServersAndClients-PT-100020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r351-tall-171679102200382"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;