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.r219-smll-171649598200222.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 IBMB2S565S3960-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r219-smll-171649598200222
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 10K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 03:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 12 03:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 03:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 03:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 127K 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 IBMB2S565S3960-PT-none-LTLCardinality-00
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-01
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-02
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-03
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-04
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-05
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-06
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-07
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-08
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-09
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-10
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-11
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-12
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-13
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-14
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716715670242

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=IBMB2S565S3960-PT-none
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-26 09:27:52] [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-26 09:27:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 09:27:53] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-26 09:27:53] [INFO ] Transformed 273 places.
[2024-05-26 09:27:53] [INFO ] Transformed 179 transitions.
[2024-05-26 09:27:53] [INFO ] Parsed PT model containing 273 places and 179 transitions and 572 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 179/179 transitions.
Ensure Unique test removed 88 places
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 176 transition count 178
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 115 place count 159 transition count 161
Iterating global reduction 1 with 17 rules applied. Total rules applied 132 place count 159 transition count 161
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 157 transition count 159
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 157 transition count 159
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 155 transition count 157
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 155 transition count 157
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 153 transition count 155
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 153 transition count 155
Applied a total of 144 rules in 77 ms. Remains 153 /273 variables (removed 120) and now considering 155/179 (removed 24) transitions.
// Phase 1: matrix 155 rows 153 cols
[2024-05-26 09:27:53] [INFO ] Computed 9 invariants in 19 ms
[2024-05-26 09:27:53] [INFO ] Implicit Places using invariants in 261 ms returned [126, 139]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 304 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 151/273 places, 155/179 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 150 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 150 transition count 154
Applied a total of 2 rules in 18 ms. Remains 150 /151 variables (removed 1) and now considering 154/155 (removed 1) transitions.
// Phase 1: matrix 154 rows 150 cols
[2024-05-26 09:27:53] [INFO ] Computed 7 invariants in 3 ms
[2024-05-26 09:27:53] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-26 09:27:53] [INFO ] Invariant cache hit.
[2024-05-26 09:27:53] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/273 places, 154/179 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 657 ms. Remains : 150/273 places, 154/179 transitions.
Support contains 30 out of 150 places after structural reductions.
[2024-05-26 09:27:54] [INFO ] Flatten gal took : 47 ms
[2024-05-26 09:27:54] [INFO ] Flatten gal took : 20 ms
[2024-05-26 09:27:54] [INFO ] Input system was already deterministic with 154 transitions.
Support contains 28 out of 150 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10004 steps, including 37 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 21) seen :18
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-26 09:27:54] [INFO ] Invariant cache hit.
[2024-05-26 09:27:54] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 09:27:54] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-26 09:27:55] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-26 09:27:55] [INFO ] After 165ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-26 09:27:55] [INFO ] After 296ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 385 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 17 ms.
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 154/154 transitions.
Graph (trivial) has 128 edges and 150 vertex of which 18 / 150 are part of one of the 1 SCC in 6 ms
Free SCC test removed 17 places
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 157 edges and 133 vertex of which 86 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.1 ms
Discarding 47 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Ensure Unique test removed 3 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 83 transition count 30
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 56 rules applied. Total rules applied 121 place count 30 transition count 27
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 124 place count 28 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 125 place count 27 transition count 26
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 125 place count 27 transition count 17
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 19 rules applied. Total rules applied 144 place count 17 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 144 place count 17 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 147 place count 15 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 147 place count 15 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 149 place count 14 transition count 15
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 11 rules applied. Total rules applied 160 place count 8 transition count 10
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 162 place count 8 transition count 8
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 168 place count 5 transition count 5
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 170 place count 5 transition count 3
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 172 place count 3 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 2 transition count 2
Applied a total of 173 rules in 33 ms. Remains 2 /150 variables (removed 148) and now considering 2/154 (removed 152) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-26 09:27:55] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 09:27:55] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 2/150 places, 2/154 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 66 stabilizing places and 69 stable transitions
Graph (complete) has 177 edges and 150 vertex of which 103 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.5 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((p0&&(F(G(p1)) U p2))))||F(p3)))'
Support contains 5 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 147 transition count 154
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 144 transition count 151
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 144 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 144 transition count 150
Applied a total of 10 rules in 10 ms. Remains 144 /150 variables (removed 6) and now considering 150/154 (removed 4) transitions.
// Phase 1: matrix 150 rows 144 cols
[2024-05-26 09:27:55] [INFO ] Computed 4 invariants in 2 ms
[2024-05-26 09:27:55] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-26 09:27:55] [INFO ] Invariant cache hit.
[2024-05-26 09:27:55] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-26 09:27:55] [INFO ] Invariant cache hit.
[2024-05-26 09:27:55] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 144/150 places, 150/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 144/150 places, 150/154 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 394 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ 1 s39), p0:(LEQ 2 s6), p2:(LEQ 3 s11), p1:(LEQ s3 s103)], 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]]
Stuttering criterion allowed to conclude after 893 steps with 9 reset in 22 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-02 finished in 868 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))&&F((p1||X(F(p2))))))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Ensure Unique test removed 3 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 146 transition count 154
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 143 transition count 151
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 143 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 143 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 142 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 142 transition count 149
Applied a total of 13 rules in 19 ms. Remains 142 /150 variables (removed 8) and now considering 149/154 (removed 5) transitions.
// Phase 1: matrix 149 rows 142 cols
[2024-05-26 09:27:56] [INFO ] Computed 4 invariants in 2 ms
[2024-05-26 09:27:56] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-26 09:27:56] [INFO ] Invariant cache hit.
[2024-05-26 09:27:56] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-26 09:27:56] [INFO ] Invariant cache hit.
[2024-05-26 09:27:56] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 142/150 places, 149/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 391 ms. Remains : 142/150 places, 149/154 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s87 s53), p0:(LEQ 3 s136), p2:(LEQ 2 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 274 steps with 0 reset in 2 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-03 finished in 561 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(F((p0||G(p1)))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Graph (trivial) has 124 edges and 150 vertex of which 18 / 150 are part of one of the 1 SCC in 1 ms
Free SCC test removed 17 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 158 edges and 133 vertex of which 86 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.2 ms
Discarding 47 places :
Also discarding 42 output transitions
Drop transitions removed 42 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 82 transition count 49
Reduce places removed 43 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 39 transition count 46
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 36 transition count 46
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 94 place count 36 transition count 37
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 112 place count 27 transition count 37
Performed 8 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 128 place count 19 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 130 place count 19 transition count 26
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 136 place count 16 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 16 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 15 transition count 23
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 139 place count 14 transition count 23
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 140 place count 13 transition count 21
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 13 transition count 21
Applied a total of 141 rules in 34 ms. Remains 13 /150 variables (removed 137) and now considering 21/154 (removed 133) transitions.
// Phase 1: matrix 21 rows 13 cols
[2024-05-26 09:27:57] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 09:27:57] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-26 09:27:57] [INFO ] Invariant cache hit.
[2024-05-26 09:27:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-26 09:27:57] [INFO ] Implicit Places using invariants and state equation in 35 ms returned [6]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/150 places, 20/154 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 19
Applied a total of 1 rules in 3 ms. Remains 12 /12 variables (removed 0) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 12 cols
[2024-05-26 09:27:57] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 09:27:57] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-26 09:27:57] [INFO ] Invariant cache hit.
[2024-05-26 09:27:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-26 09:27:57] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/150 places, 19/154 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 162 ms. Remains : 12/150 places, 19/154 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 s5), p0:(GT s0 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 111 steps with 17 reset in 3 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-04 finished in 286 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 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Graph (trivial) has 126 edges and 150 vertex of which 18 / 150 are part of one of the 1 SCC in 1 ms
Free SCC test removed 17 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 158 edges and 133 vertex of which 86 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.1 ms
Discarding 47 places :
Also discarding 42 output transitions
Drop transitions removed 42 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 82 transition count 47
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 37 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 36 transition count 46
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 94 place count 36 transition count 36
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 114 place count 26 transition count 36
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 130 place count 18 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 131 place count 18 transition count 27
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 137 place count 15 transition count 29
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 144 place count 15 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 145 place count 14 transition count 21
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 146 place count 13 transition count 21
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 147 place count 12 transition count 19
Iterating global reduction 5 with 1 rules applied. Total rules applied 148 place count 12 transition count 19
Applied a total of 148 rules in 28 ms. Remains 12 /150 variables (removed 138) and now considering 19/154 (removed 135) transitions.
// Phase 1: matrix 19 rows 12 cols
[2024-05-26 09:27:57] [INFO ] Computed 0 invariants in 1 ms
[2024-05-26 09:27:57] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-26 09:27:57] [INFO ] Invariant cache hit.
[2024-05-26 09:27:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-26 09:27:57] [INFO ] Implicit Places using invariants and state equation in 39 ms returned [6]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 71 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/150 places, 18/154 transitions.
Applied a total of 0 rules in 4 ms. Remains 11 /11 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 104 ms. Remains : 11/150 places, 18/154 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s2 s4)], 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 33 steps with 1 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-05 finished in 168 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)||X((p0 U p2)))))'
Support contains 5 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Ensure Unique test removed 3 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 146 transition count 154
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 142 transition count 150
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 142 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 141 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 141 transition count 148
Applied a total of 15 rules in 31 ms. Remains 141 /150 variables (removed 9) and now considering 148/154 (removed 6) transitions.
// Phase 1: matrix 148 rows 141 cols
[2024-05-26 09:27:57] [INFO ] Computed 4 invariants in 2 ms
[2024-05-26 09:27:57] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-26 09:27:57] [INFO ] Invariant cache hit.
[2024-05-26 09:27:57] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-26 09:27:57] [INFO ] Invariant cache hit.
[2024-05-26 09:27:57] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/150 places, 148/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 396 ms. Remains : 141/150 places, 148/154 transitions.
Stuttering acceptance computed with spot in 242 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(LEQ s106 s71), p2:(LEQ s83 s53), p1:(LEQ s19 s71)], 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, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 558 ms.
Product exploration explored 100000 steps with 50000 reset in 293 ms.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 164 edges and 141 vertex of which 97 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.5 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Detected a total of 61/141 stabilizing places and 65/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 155 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-06 finished in 1684 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(X(G(p0)))))'
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Ensure Unique test removed 3 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 146 transition count 154
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 142 transition count 150
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 142 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 141 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 141 transition count 148
Applied a total of 15 rules in 9 ms. Remains 141 /150 variables (removed 9) and now considering 148/154 (removed 6) transitions.
[2024-05-26 09:27:59] [INFO ] Invariant cache hit.
[2024-05-26 09:27:59] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-26 09:27:59] [INFO ] Invariant cache hit.
[2024-05-26 09:27:59] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-05-26 09:27:59] [INFO ] Invariant cache hit.
[2024-05-26 09:27:59] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/150 places, 148/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 337 ms. Remains : 141/150 places, 148/154 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-08 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ 1 s9)], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-08 finished in 584 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) U ((p1&&X(p0))||X(G(p0)))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Ensure Unique test removed 3 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 146 transition count 154
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 142 transition count 150
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 142 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 141 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 141 transition count 148
Applied a total of 15 rules in 9 ms. Remains 141 /150 variables (removed 9) and now considering 148/154 (removed 6) transitions.
[2024-05-26 09:27:59] [INFO ] Invariant cache hit.
[2024-05-26 09:27:59] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-26 09:27:59] [INFO ] Invariant cache hit.
[2024-05-26 09:28:00] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-26 09:28:00] [INFO ] Invariant cache hit.
[2024-05-26 09:28:00] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/150 places, 148/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 579 ms. Remains : 141/150 places, 148/154 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s117 s34), p1:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-10 finished in 717 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 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Graph (trivial) has 128 edges and 150 vertex of which 12 / 150 are part of one of the 1 SCC in 1 ms
Free SCC test removed 11 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 165 edges and 139 vertex of which 92 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.1 ms
Discarding 47 places :
Also discarding 42 output transitions
Drop transitions removed 42 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 88 transition count 50
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 39 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 38 transition count 49
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 102 place count 38 transition count 38
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 124 place count 27 transition count 38
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 142 place count 18 transition count 29
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 145 place count 18 transition count 26
Performed 4 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 153 place count 14 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 155 place count 14 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 14 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 13 transition count 21
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 158 place count 12 transition count 21
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 159 place count 11 transition count 19
Iterating global reduction 6 with 1 rules applied. Total rules applied 160 place count 11 transition count 19
Applied a total of 160 rules in 41 ms. Remains 11 /150 variables (removed 139) and now considering 19/154 (removed 135) transitions.
// Phase 1: matrix 19 rows 11 cols
[2024-05-26 09:28:00] [INFO ] Computed 0 invariants in 1 ms
[2024-05-26 09:28:00] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-26 09:28:00] [INFO ] Invariant cache hit.
[2024-05-26 09:28:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-26 09:28:00] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [4]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 107 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/150 places, 18/154 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 17
Applied a total of 1 rules in 6 ms. Remains 10 /10 variables (removed 0) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 10 cols
[2024-05-26 09:28:00] [INFO ] Computed 0 invariants in 1 ms
[2024-05-26 09:28:00] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-26 09:28:00] [INFO ] Invariant cache hit.
[2024-05-26 09:28:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-26 09:28:00] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/150 places, 17/154 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 253 ms. Remains : 10/150 places, 17/154 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-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:(LEQ s3 s0)], 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 219 steps with 7 reset in 2 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-11 finished in 311 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) U p1))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Graph (complete) has 177 edges and 150 vertex of which 103 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.1 ms
Discarding 47 places :
Also discarding 42 output transitions
Drop transitions removed 42 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 99 transition count 53
Reduce places removed 58 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 119 place count 41 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 39 transition count 51
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 121 place count 39 transition count 39
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 145 place count 27 transition count 39
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 163 place count 18 transition count 30
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 167 place count 18 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 169 place count 17 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 170 place count 17 transition count 24
Performed 4 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 178 place count 13 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 180 place count 13 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 181 place count 13 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 182 place count 12 transition count 19
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 183 place count 11 transition count 19
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 184 place count 10 transition count 17
Iterating global reduction 7 with 1 rules applied. Total rules applied 185 place count 10 transition count 17
Applied a total of 185 rules in 31 ms. Remains 10 /150 variables (removed 140) and now considering 17/154 (removed 137) transitions.
// Phase 1: matrix 17 rows 10 cols
[2024-05-26 09:28:00] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 09:28:00] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-26 09:28:00] [INFO ] Invariant cache hit.
[2024-05-26 09:28:00] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [4]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 62 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/150 places, 16/154 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 15
Applied a total of 1 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 9 cols
[2024-05-26 09:28:00] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 09:28:00] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-26 09:28:00] [INFO ] Invariant cache hit.
[2024-05-26 09:28:00] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/150 places, 15/154 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 240 ms. Remains : 9/150 places, 15/154 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 s3), p0:(LEQ 2 s0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 59 steps with 5 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-12 finished in 384 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(p0)))'
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Ensure Unique test removed 3 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 146 transition count 154
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 143 transition count 151
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 143 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 142 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 142 transition count 150
Applied a total of 12 rules in 7 ms. Remains 142 /150 variables (removed 8) and now considering 150/154 (removed 4) transitions.
// Phase 1: matrix 150 rows 142 cols
[2024-05-26 09:28:01] [INFO ] Computed 4 invariants in 14 ms
[2024-05-26 09:28:01] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-26 09:28:01] [INFO ] Invariant cache hit.
[2024-05-26 09:28:01] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2024-05-26 09:28:01] [INFO ] Invariant cache hit.
[2024-05-26 09:28:01] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 142/150 places, 150/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 618 ms. Remains : 142/150 places, 150/154 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s133)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 172 steps with 1 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-13 finished in 744 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(p0)))'
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Ensure Unique test removed 3 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 146 transition count 154
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 142 transition count 150
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 142 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 141 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 141 transition count 148
Applied a total of 15 rules in 8 ms. Remains 141 /150 variables (removed 9) and now considering 148/154 (removed 6) transitions.
// Phase 1: matrix 148 rows 141 cols
[2024-05-26 09:28:01] [INFO ] Computed 4 invariants in 2 ms
[2024-05-26 09:28:02] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-26 09:28:02] [INFO ] Invariant cache hit.
[2024-05-26 09:28:02] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-05-26 09:28:02] [INFO ] Invariant cache hit.
[2024-05-26 09:28:02] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/150 places, 148/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 449 ms. Remains : 141/150 places, 148/154 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s28)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 302 ms.
Product exploration explored 100000 steps with 50000 reset in 425 ms.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 164 edges and 141 vertex of which 97 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.3 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Detected a total of 61/141 stabilizing places and 65/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 34 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-14 finished in 1379 ms.
All properties solved by simple procedures.
Total runtime 10428 ms.

BK_STOP 1716715684468

--------------------
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="IBMB2S565S3960-PT-none"
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 IBMB2S565S3960-PT-none, 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 r219-smll-171649598200222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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