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.r087-tall-171620521800247.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 ClientsAndServers-PT-N0002P1, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521800247
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 23:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 12 23:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 23:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 12 23:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.2K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716253003988

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=ClientsAndServers-PT-N0002P1
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 00:56:45] [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-21 00:56:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 00:56:45] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2024-05-21 00:56:45] [INFO ] Transformed 25 places.
[2024-05-21 00:56:45] [INFO ] Transformed 18 transitions.
[2024-05-21 00:56:45] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 78 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 7 formulas.
FORMULA ClientsAndServers-PT-N0002P1-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P1-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P1-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P1-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P1-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P1-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P1-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 9 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-21 00:56:45] [INFO ] Computed 6 invariants in 12 ms
[2024-05-21 00:56:46] [INFO ] Implicit Places using invariants in 484 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 507 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 518 ms. Remains : 22/25 places, 18/18 transitions.
Support contains 17 out of 22 places after structural reductions.
[2024-05-21 00:56:46] [INFO ] Flatten gal took : 16 ms
[2024-05-21 00:56:46] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:56:46] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 238 steps, including 0 resets, run visited all 19 properties in 26 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 1 ms.
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' '!(X((F(p0)&&G((p1&&F(p2))))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 18
Applied a total of 2 rules in 1 ms. Remains 20 /22 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 00:56:46] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 00:56:46] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 00:56:46] [INFO ] Invariant cache hit.
[2024-05-21 00:56:46] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-21 00:56:46] [INFO ] Invariant cache hit.
[2024-05-21 00:56:46] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 20/22 places, 18/18 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 366 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), true, (NOT p0), (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 1 s13), p0:(LEQ s13 s18), p2:(LEQ s7 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9019 steps with 22 reset in 44 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLCardinality-00 finished in 574 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))||(p1 U G(p2)))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 18
Applied a total of 2 rules in 1 ms. Remains 20 /22 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2024-05-21 00:56:47] [INFO ] Invariant cache hit.
[2024-05-21 00:56:47] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 00:56:47] [INFO ] Invariant cache hit.
[2024-05-21 00:56:47] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-21 00:56:47] [INFO ] Invariant cache hit.
[2024-05-21 00:56:47] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 20/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 401 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 2 s7), p0:(GT s13 s11), p2:(LEQ 3 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1312 reset in 175 ms.
Product exploration explored 100000 steps with 1340 reset in 153 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 (NOT p1) p0 p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p2))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 331 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 31 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p2))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p2)), (F (NOT p0)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 15 factoid took 422 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 20 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 : 20/20 places, 18/18 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 16 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 14 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 14 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 13 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 11 transition count 9
Applied a total of 18 rules in 16 ms. Remains 11 /20 variables (removed 9) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 11 cols
[2024-05-21 00:56:49] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 00:56:49] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 00:56:49] [INFO ] Invariant cache hit.
[2024-05-21 00:56:49] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-21 00:56:49] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 00:56:49] [INFO ] Invariant cache hit.
[2024-05-21 00:56:49] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/20 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 11/20 places, 9/18 transitions.
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 p0), (X p2), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 74 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 26 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0), (X p2), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 8 factoid took 160 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1398 reset in 105 ms.
Stack based approach found an accepted trace after 4132 steps with 60 reset with depth 51 and stack size 51 in 7 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLCardinality-01 finished in 2927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&X(p1))||G(p1))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 1 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 00:56:50] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 00:56:50] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 00:56:50] [INFO ] Invariant cache hit.
[2024-05-21 00:56:50] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-21 00:56:50] [INFO ] Invariant cache hit.
[2024-05-21 00:56:50] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 21/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s17 s6) (LEQ s18 s20)), p1:(GT s18 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 769 reset in 170 ms.
Stack based approach found an accepted trace after 782 steps with 6 reset with depth 126 and stack size 126 in 1 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLCardinality-03 finished in 371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||X(G(p1))))&&F(p1)))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 18
Applied a total of 2 rules in 1 ms. Remains 20 /22 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 00:56:50] [INFO ] Computed 3 invariants in 2 ms
[2024-05-21 00:56:50] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-21 00:56:50] [INFO ] Invariant cache hit.
[2024-05-21 00:56:50] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-21 00:56:50] [INFO ] Invariant cache hit.
[2024-05-21 00:56:50] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 20/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT s5 s13), p0:(GT s11 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 147 steps with 1 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLCardinality-05 finished in 303 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 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 18 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 16 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 16 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 14 transition count 10
Applied a total of 16 rules in 6 ms. Remains 14 /22 variables (removed 8) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2024-05-21 00:56:50] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 00:56:50] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 00:56:50] [INFO ] Invariant cache hit.
[2024-05-21 00:56:50] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-21 00:56:50] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 00:56:50] [INFO ] Invariant cache hit.
[2024-05-21 00:56:50] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/22 places, 10/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 14/22 places, 10/18 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLCardinality-08 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 (GT s12 s7) (GT 2 s11))], 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 112 ms.
Stack based approach found an accepted trace after 132 steps with 0 reset with depth 133 and stack size 133 in 0 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLCardinality-08 finished in 256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 18
Applied a total of 2 rules in 0 ms. Remains 20 /22 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 00:56:51] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 00:56:51] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 00:56:51] [INFO ] Invariant cache hit.
[2024-05-21 00:56:51] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-21 00:56:51] [INFO ] Invariant cache hit.
[2024-05-21 00:56:51] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 20/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (LEQ s3 s5) (LEQ 3 s12)), p0:(LEQ 2 s0)], 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 1 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLCardinality-10 finished in 209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p0))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 18
Applied a total of 2 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2024-05-21 00:56:51] [INFO ] Invariant cache hit.
[2024-05-21 00:56:51] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 00:56:51] [INFO ] Invariant cache hit.
[2024-05-21 00:56:51] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-21 00:56:51] [INFO ] Invariant cache hit.
[2024-05-21 00:56:51] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 20/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}]], initial=0, aps=[p0:(LEQ s17 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 57 ms.
Product exploration explored 100000 steps with 50000 reset in 64 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), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0002P1-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0002P1-LTLCardinality-12 finished in 353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&(p1 U (G(p1)||(p1&&G(p0))))) U p2))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 18 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 16 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 16 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 13 transition count 11
Applied a total of 16 rules in 6 ms. Remains 13 /22 variables (removed 9) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-21 00:56:51] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 00:56:51] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 00:56:51] [INFO ] Invariant cache hit.
[2024-05-21 00:56:51] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-21 00:56:51] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 00:56:51] [INFO ] Invariant cache hit.
[2024-05-21 00:56:51] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/22 places, 11/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 13/22 places, 11/18 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GT s9 s4), p0:(LEQ 3 s11), p1:(GT s12 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 58 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLCardinality-13 finished in 291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X((p0&&(p1 U X(p0)))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 18
Applied a total of 2 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 00:56:51] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 00:56:51] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 00:56:51] [INFO ] Invariant cache hit.
[2024-05-21 00:56:51] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-21 00:56:51] [INFO ] Invariant cache hit.
[2024-05-21 00:56:51] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 20/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLCardinality-15 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: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=2, aps=[p0:(LEQ 2 s12), p1:(LEQ s15 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLCardinality-15 finished in 221 ms.
All properties solved by simple procedures.
Total runtime 6648 ms.

BK_STOP 1716253013132

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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="ClientsAndServers-PT-N0002P1"
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 ClientsAndServers-PT-N0002P1, 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 r087-tall-171620521800247"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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