Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r263-smll-167863538000259.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is NoC3x3-PT-3A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538000259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.1K Feb 26 10:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 10:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 10:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 10:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 10:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 133K Mar 5 18:23 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 NoC3x3-PT-3A-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678754576133

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 00:42:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 00:42:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 00:42:59] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2023-03-14 00:42:59] [INFO ] Transformed 370 places.
[2023-03-14 00:42:59] [INFO ] Transformed 450 transitions.
[2023-03-14 00:42:59] [INFO ] Found NUPN structural information;
[2023-03-14 00:42:59] [INFO ] Parsed PT model containing 370 places and 450 transitions and 1773 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA NoC3x3-PT-3A-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 449/449 transitions.
Ensure Unique test removed 18 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 352 transition count 449
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 111 place count 259 transition count 332
Ensure Unique test removed 26 places
Iterating global reduction 1 with 119 rules applied. Total rules applied 230 place count 233 transition count 332
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 282 place count 233 transition count 280
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 306 place count 233 transition count 256
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 314 place count 225 transition count 256
Applied a total of 314 rules in 115 ms. Remains 225 /370 variables (removed 145) and now considering 256/449 (removed 193) transitions.
[2023-03-14 00:43:00] [INFO ] Flow matrix only has 247 transitions (discarded 9 similar events)
// Phase 1: matrix 247 rows 225 cols
[2023-03-14 00:43:00] [INFO ] Computed 75 place invariants in 36 ms
[2023-03-14 00:43:00] [INFO ] Implicit Places using invariants in 429 ms returned [20, 49, 69, 90, 95, 99, 132, 178, 179, 182, 208, 209, 212]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 494 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/370 places, 256/449 transitions.
Applied a total of 0 rules in 5 ms. Remains 212 /212 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 615 ms. Remains : 212/370 places, 256/449 transitions.
Support contains 47 out of 212 places after structural reductions.
[2023-03-14 00:43:00] [INFO ] Flatten gal took : 76 ms
[2023-03-14 00:43:01] [INFO ] Flatten gal took : 42 ms
[2023-03-14 00:43:01] [INFO ] Input system was already deterministic with 256 transitions.
Finished random walk after 7346 steps, including 2 resets, run visited all 28 properties in 251 ms. (steps per millisecond=29 )
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 629 edges and 212 vertex of which 211 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 256/256 transitions.
Graph (complete) has 629 edges and 212 vertex of which 211 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 210 transition count 184
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 172 place count 131 transition count 163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 172 place count 131 transition count 162
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 175 place count 129 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 175 place count 129 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 177 place count 128 transition count 161
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 183 place count 122 transition count 154
Ensure Unique test removed 4 places
Iterating global reduction 2 with 10 rules applied. Total rules applied 193 place count 118 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 200 place count 118 transition count 147
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 205 place count 114 transition count 146
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 114 transition count 144
Applied a total of 207 rules in 42 ms. Remains 114 /212 variables (removed 98) and now considering 144/256 (removed 112) transitions.
// Phase 1: matrix 144 rows 114 cols
[2023-03-14 00:43:01] [INFO ] Computed 47 place invariants in 1 ms
[2023-03-14 00:43:01] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-14 00:43:01] [INFO ] Invariant cache hit.
[2023-03-14 00:43:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-14 00:43:02] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-14 00:43:02] [INFO ] Redundant transitions in 112 ms returned [24, 30, 31, 45, 56, 57, 58, 59, 60, 67, 68, 71, 81, 94, 95, 97, 101, 104, 105, 106, 113, 114, 115, 122, 125, 128, 131, 132, 133, 134, 140]
Found 31 redundant transitions using SMT.
Drop transitions removed 31 transitions
Redundant transitions reduction (with SMT) removed 31 transitions.
// Phase 1: matrix 113 rows 114 cols
[2023-03-14 00:43:02] [INFO ] Computed 47 place invariants in 2 ms
[2023-03-14 00:43:02] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/212 places, 113/256 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 114 transition count 103
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 94 transition count 103
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 94 transition count 101
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 49 edges and 90 vertex of which 16 / 90 are part of one of the 8 SCC in 3 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 39 place count 82 transition count 99
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 49 place count 81 transition count 90
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 79 place count 61 transition count 80
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 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 84 place count 58 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 39 edges and 58 vertex of which 16 / 58 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 87 place count 50 transition count 76
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 95 place count 50 transition count 68
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 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 98 place count 48 transition count 67
Graph (trivial) has 31 edges and 48 vertex of which 2 / 48 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 5 with 1 rules applied. Total rules applied 99 place count 47 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 100 place count 47 transition count 66
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 118 place count 47 transition count 48
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 119 place count 46 transition count 48
Applied a total of 119 rules in 26 ms. Remains 46 /114 variables (removed 68) and now considering 48/113 (removed 65) transitions.
// Phase 1: matrix 48 rows 46 cols
[2023-03-14 00:43:02] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 00:43:02] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-14 00:43:02] [INFO ] Invariant cache hit.
[2023-03-14 00:43:02] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/212 places, 48/256 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 732 ms. Remains : 46/212 places, 48/256 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s34 0) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-3A-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLCardinality-00 finished in 1032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 256/256 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 256
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 190 transition count 234
Ensure Unique test removed 4 places
Iterating global reduction 1 with 25 rules applied. Total rules applied 47 place count 186 transition count 234
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 65 place count 186 transition count 216
Applied a total of 65 rules in 10 ms. Remains 186 /212 variables (removed 26) and now considering 216/256 (removed 40) transitions.
[2023-03-14 00:43:02] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 186 cols
[2023-03-14 00:43:02] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-14 00:43:02] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-14 00:43:02] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2023-03-14 00:43:02] [INFO ] Invariant cache hit.
[2023-03-14 00:43:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-14 00:43:03] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2023-03-14 00:43:03] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2023-03-14 00:43:03] [INFO ] Invariant cache hit.
[2023-03-14 00:43:03] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/212 places, 216/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 625 ms. Remains : 186/212 places, 216/256 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s35 0) (EQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 150 steps with 0 reset in 4 ms.
FORMULA NoC3x3-PT-3A-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLCardinality-01 finished in 737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(((!p1&&X(F(p2)))||G(F(p2))))&&p0)))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 256/256 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 256
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 193 transition count 237
Ensure Unique test removed 3 places
Iterating global reduction 1 with 21 rules applied. Total rules applied 40 place count 190 transition count 237
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 55 place count 190 transition count 222
Applied a total of 55 rules in 11 ms. Remains 190 /212 variables (removed 22) and now considering 222/256 (removed 34) transitions.
[2023-03-14 00:43:03] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
// Phase 1: matrix 214 rows 190 cols
[2023-03-14 00:43:03] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-14 00:43:03] [INFO ] Implicit Places using invariants in 116 ms returned [121]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 189/212 places, 222/256 transitions.
Applied a total of 0 rules in 3 ms. Remains 189 /189 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 134 ms. Remains : 189/212 places, 222/256 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s52 0) (EQ s122 1)), p2:(OR (EQ s44 0) (EQ s39 1)), p1:(OR (EQ s122 0) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLCardinality-02 finished in 435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 256/256 transitions.
Graph (complete) has 629 edges and 212 vertex of which 211 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 210 transition count 187
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 161 place count 136 transition count 169
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 167 place count 130 transition count 162
Ensure Unique test removed 4 places
Iterating global reduction 2 with 10 rules applied. Total rules applied 177 place count 126 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 8 rules applied. Total rules applied 185 place count 126 transition count 154
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 191 place count 121 transition count 153
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 193 place count 121 transition count 151
Applied a total of 193 rules in 40 ms. Remains 121 /212 variables (removed 91) and now considering 151/256 (removed 105) transitions.
// Phase 1: matrix 151 rows 121 cols
[2023-03-14 00:43:03] [INFO ] Computed 50 place invariants in 0 ms
[2023-03-14 00:43:04] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-14 00:43:04] [INFO ] Invariant cache hit.
[2023-03-14 00:43:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-14 00:43:04] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-14 00:43:04] [INFO ] Redundant transitions in 99 ms returned [36, 37, 51, 52, 63, 64, 65, 66, 67, 74, 75, 78, 88, 101, 102, 104, 108, 111, 114, 120, 121, 122, 124, 128, 131, 132, 133, 134, 141, 142, 143, 144]
Found 32 redundant transitions using SMT.
Drop transitions removed 32 transitions
Redundant transitions reduction (with SMT) removed 32 transitions.
// Phase 1: matrix 119 rows 121 cols
[2023-03-14 00:43:04] [INFO ] Computed 50 place invariants in 3 ms
[2023-03-14 00:43:04] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/212 places, 119/256 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 121 transition count 107
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 97 transition count 107
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 97 transition count 104
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 46 edges and 91 vertex of which 18 / 91 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 49 place count 82 transition count 101
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 60 place count 81 transition count 91
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 16 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 84 place count 65 transition count 83
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 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 87 place count 63 transition count 82
Graph (trivial) has 37 edges and 63 vertex of which 12 / 63 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 57 transition count 82
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 94 place count 57 transition count 76
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 110 place count 57 transition count 60
Applied a total of 110 rules in 23 ms. Remains 57 /121 variables (removed 64) and now considering 60/119 (removed 59) transitions.
// Phase 1: matrix 60 rows 57 cols
[2023-03-14 00:43:04] [INFO ] Computed 25 place invariants in 0 ms
[2023-03-14 00:43:04] [INFO ] Implicit Places using invariants in 53 ms returned [42, 56]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/212 places, 60/256 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 612 ms. Remains : 55/212 places, 60/256 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s36 0) (EQ s35 1)), p1:(OR (EQ s19 0) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 359 steps with 9 reset in 8 ms.
FORMULA NoC3x3-PT-3A-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLCardinality-04 finished in 713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&G(F(p1))))&&X(p2))))'
Support contains 6 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 256/256 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 256
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 193 transition count 237
Ensure Unique test removed 4 places
Iterating global reduction 1 with 22 rules applied. Total rules applied 41 place count 189 transition count 237
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 56 place count 189 transition count 222
Applied a total of 56 rules in 13 ms. Remains 189 /212 variables (removed 23) and now considering 222/256 (removed 34) transitions.
[2023-03-14 00:43:04] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
// Phase 1: matrix 214 rows 189 cols
[2023-03-14 00:43:04] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-14 00:43:04] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-14 00:43:04] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
[2023-03-14 00:43:04] [INFO ] Invariant cache hit.
[2023-03-14 00:43:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-14 00:43:05] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2023-03-14 00:43:05] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
[2023-03-14 00:43:05] [INFO ] Invariant cache hit.
[2023-03-14 00:43:05] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/212 places, 222/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 608 ms. Remains : 189/212 places, 222/256 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=p2, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s53 0) (EQ s101 1)), p2:(AND (OR (EQ s188 0) (EQ s67 1)) (OR (EQ s53 0) (EQ s101 1))), p1:(OR (EQ s108 0) (EQ s179 1))], 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, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLCardinality-05 finished in 937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X((!p1||X(!p1)))) U p2))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 256/256 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 256
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 192 transition count 236
Ensure Unique test removed 3 places
Iterating global reduction 1 with 22 rules applied. Total rules applied 42 place count 189 transition count 236
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 58 place count 189 transition count 220
Applied a total of 58 rules in 10 ms. Remains 189 /212 variables (removed 23) and now considering 220/256 (removed 36) transitions.
[2023-03-14 00:43:05] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
// Phase 1: matrix 212 rows 189 cols
[2023-03-14 00:43:05] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-14 00:43:05] [INFO ] Implicit Places using invariants in 141 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/212 places, 220/256 transitions.
Applied a total of 0 rules in 12 ms. Remains 188 /188 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 188/212 places, 220/256 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), p1, p1, true]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s22 1), p0:(NEQ s115 1), p1:(OR (EQ s48 0) (EQ s125 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLCardinality-06 finished in 348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((F(X((p0 U F(p1))))&&X(p2)) U !p0)))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 256/256 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 192 transition count 235
Ensure Unique test removed 4 places
Iterating global reduction 0 with 24 rules applied. Total rules applied 44 place count 188 transition count 235
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 61 place count 188 transition count 218
Applied a total of 61 rules in 8 ms. Remains 188 /212 variables (removed 24) and now considering 218/256 (removed 38) transitions.
[2023-03-14 00:43:05] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2023-03-14 00:43:05] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-14 00:43:06] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-14 00:43:06] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2023-03-14 00:43:06] [INFO ] Invariant cache hit.
[2023-03-14 00:43:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-14 00:43:06] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2023-03-14 00:43:06] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2023-03-14 00:43:06] [INFO ] Invariant cache hit.
[2023-03-14 00:43:06] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/212 places, 218/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 729 ms. Remains : 188/212 places, 218/256 transitions.
Stuttering acceptance computed with spot in 371 ms :[p0, (NOT p1), p0, p0, true, p0, (OR (NOT p2) (NOT p1) p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=6 dest: 1}, { cond=(NOT p2), acceptance={0} source=6 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p0:(EQ s12 1), p1:(OR (EQ s87 0) (EQ s186 1)), p2:(EQ s117 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 801 ms.
Product exploration explored 100000 steps with 25000 reset in 1096 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 536 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[p0, (NOT p1), (OR (NOT p2) (NOT p1) p0), p0, p0, true, p0]
Finished random walk after 453 steps, including 0 resets, run visited all 5 properties in 13 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), true]
False Knowledge obtained : [(F p2), (F (AND p0 p2)), (F p0), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 280 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[p0, (NOT p1), (OR (NOT p2) (NOT p1) p0), p0, p0, true, p0]
Stuttering acceptance computed with spot in 326 ms :[p0, (NOT p1), (OR (NOT p2) (NOT p1) p0), p0, p0, true, p0]
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 218/218 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2023-03-14 00:43:10] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2023-03-14 00:43:10] [INFO ] Invariant cache hit.
[2023-03-14 00:43:10] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-14 00:43:10] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2023-03-14 00:43:10] [INFO ] Invariant cache hit.
[2023-03-14 00:43:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-14 00:43:10] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2023-03-14 00:43:10] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2023-03-14 00:43:10] [INFO ] Invariant cache hit.
[2023-03-14 00:43:11] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 624 ms. Remains : 188/188 places, 218/218 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 536 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 349 ms :[p0, (NOT p1), (OR (NOT p2) (NOT p1) p0), p0, p0, true, p0]
Finished random walk after 1402 steps, including 0 resets, run visited all 5 properties in 30 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), true]
False Knowledge obtained : [(F p2), (F (AND p0 p2)), (F p0), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 407 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[p0, (NOT p1), (OR (NOT p2) (NOT p1) p0), p0, p0, true, p0]
Stuttering acceptance computed with spot in 348 ms :[p0, (NOT p1), (OR (NOT p2) (NOT p1) p0), p0, p0, true, p0]
Stuttering acceptance computed with spot in 326 ms :[p0, (NOT p1), (OR (NOT p2) (NOT p1) p0), p0, p0, true, p0]
Product exploration explored 100000 steps with 25000 reset in 992 ms.
Product exploration explored 100000 steps with 25000 reset in 677 ms.
Applying partial POR strategy [false, true, true, false, false, true, false]
Stuttering acceptance computed with spot in 291 ms :[p0, (NOT p1), (OR (NOT p2) (NOT p1) p0), p0, p0, true, p0]
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 218/218 transitions.
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 188 transition count 218
Deduced a syphon composed of 61 places in 0 ms
Applied a total of 61 rules in 16 ms. Remains 188 /188 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2023-03-14 00:43:15] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-14 00:43:15] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2023-03-14 00:43:15] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-14 00:43:15] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 188/188 places, 218/218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 211 ms. Remains : 188/188 places, 218/218 transitions.
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 218/218 transitions.
Applied a total of 0 rules in 3 ms. Remains 188 /188 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2023-03-14 00:43:15] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2023-03-14 00:43:15] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-14 00:43:15] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-14 00:43:15] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2023-03-14 00:43:15] [INFO ] Invariant cache hit.
[2023-03-14 00:43:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-14 00:43:15] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2023-03-14 00:43:15] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2023-03-14 00:43:15] [INFO ] Invariant cache hit.
[2023-03-14 00:43:15] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 188/188 places, 218/218 transitions.
Treatment of property NoC3x3-PT-3A-LTLCardinality-07 finished in 10062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((p0 U (p1||G(p0)))) U p2))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 256/256 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 256
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 191 transition count 235
Ensure Unique test removed 3 places
Iterating global reduction 1 with 23 rules applied. Total rules applied 44 place count 188 transition count 235
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 61 place count 188 transition count 218
Applied a total of 61 rules in 7 ms. Remains 188 /212 variables (removed 24) and now considering 218/256 (removed 38) transitions.
[2023-03-14 00:43:16] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2023-03-14 00:43:16] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-14 00:43:16] [INFO ] Implicit Places using invariants in 157 ms returned [114]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 160 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/212 places, 218/256 transitions.
Applied a total of 0 rules in 3 ms. Remains 187 /187 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 171 ms. Remains : 187/212 places, 218/256 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s179 0) (EQ s128 1)), p1:(AND (NEQ s100 1) (NEQ s160 1)), p0:(NEQ s160 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLCardinality-09 finished in 403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 256/256 transitions.
Graph (complete) has 629 edges and 212 vertex of which 211 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 211 transition count 185
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 157 place count 140 transition count 171
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 164 place count 133 transition count 163
Ensure Unique test removed 4 places
Iterating global reduction 2 with 11 rules applied. Total rules applied 175 place count 129 transition count 163
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 8 rules applied. Total rules applied 183 place count 129 transition count 155
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 187 place count 125 transition count 155
Applied a total of 187 rules in 19 ms. Remains 125 /212 variables (removed 87) and now considering 155/256 (removed 101) transitions.
[2023-03-14 00:43:16] [INFO ] Flow matrix only has 147 transitions (discarded 8 similar events)
// Phase 1: matrix 147 rows 125 cols
[2023-03-14 00:43:16] [INFO ] Computed 57 place invariants in 1 ms
[2023-03-14 00:43:16] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-14 00:43:16] [INFO ] Flow matrix only has 147 transitions (discarded 8 similar events)
[2023-03-14 00:43:16] [INFO ] Invariant cache hit.
[2023-03-14 00:43:16] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-14 00:43:16] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-14 00:43:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 00:43:16] [INFO ] Flow matrix only has 147 transitions (discarded 8 similar events)
[2023-03-14 00:43:16] [INFO ] Invariant cache hit.
[2023-03-14 00:43:16] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/212 places, 155/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 542 ms. Remains : 125/212 places, 155/256 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s94 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLCardinality-10 finished in 601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)&&X(p1)))||X(G(p1))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 256/256 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 256
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 191 transition count 235
Ensure Unique test removed 4 places
Iterating global reduction 1 with 24 rules applied. Total rules applied 45 place count 187 transition count 235
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 62 place count 187 transition count 218
Applied a total of 62 rules in 8 ms. Remains 187 /212 variables (removed 25) and now considering 218/256 (removed 38) transitions.
[2023-03-14 00:43:17] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 187 cols
[2023-03-14 00:43:17] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-14 00:43:17] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-14 00:43:17] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2023-03-14 00:43:17] [INFO ] Invariant cache hit.
[2023-03-14 00:43:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-14 00:43:17] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-14 00:43:17] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2023-03-14 00:43:17] [INFO ] Invariant cache hit.
[2023-03-14 00:43:17] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/212 places, 218/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 523 ms. Remains : 187/212 places, 218/256 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s73 0) (EQ s65 1)), p1:(OR (EQ s90 0) (EQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 837 ms.
Product exploration explored 100000 steps with 50000 reset in 879 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 163 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-3A-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-3A-LTLCardinality-11 finished in 2600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G(p1)))'
Support contains 3 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 256/256 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 256
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 193 transition count 237
Ensure Unique test removed 3 places
Iterating global reduction 1 with 21 rules applied. Total rules applied 40 place count 190 transition count 237
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 55 place count 190 transition count 222
Applied a total of 55 rules in 5 ms. Remains 190 /212 variables (removed 22) and now considering 222/256 (removed 34) transitions.
[2023-03-14 00:43:19] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
// Phase 1: matrix 214 rows 190 cols
[2023-03-14 00:43:19] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-14 00:43:19] [INFO ] Implicit Places using invariants in 115 ms returned [116]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 189/212 places, 222/256 transitions.
Applied a total of 0 rules in 2 ms. Remains 189 /189 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 189/212 places, 222/256 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (NEQ s134 0) (NEQ s96 1)), p0:(EQ s90 0)], 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]]
Product exploration explored 100000 steps with 0 reset in 524 ms.
Product exploration explored 100000 steps with 0 reset in 606 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 10 factoid took 568 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 3474 steps, including 1 resets, run visited all 1 properties in 31 ms. (steps per millisecond=112 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 745 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 189 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 222/222 transitions.
Applied a total of 0 rules in 2 ms. Remains 189 /189 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-14 00:43:22] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
// Phase 1: matrix 214 rows 189 cols
[2023-03-14 00:43:22] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-14 00:43:23] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-14 00:43:23] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
[2023-03-14 00:43:23] [INFO ] Invariant cache hit.
[2023-03-14 00:43:23] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-14 00:43:23] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2023-03-14 00:43:23] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
[2023-03-14 00:43:23] [INFO ] Invariant cache hit.
[2023-03-14 00:43:23] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 973 ms. Remains : 189/189 places, 222/222 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 295 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=73 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 236 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 127 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-3A-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLCardinality-12 finished in 5176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&X(X(G(p1)))))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 256/256 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 256
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 192 transition count 236
Ensure Unique test removed 4 places
Iterating global reduction 1 with 23 rules applied. Total rules applied 43 place count 188 transition count 236
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 59 place count 188 transition count 220
Applied a total of 59 rules in 8 ms. Remains 188 /212 variables (removed 24) and now considering 220/256 (removed 36) transitions.
[2023-03-14 00:43:24] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
// Phase 1: matrix 212 rows 188 cols
[2023-03-14 00:43:24] [INFO ] Computed 57 place invariants in 1 ms
[2023-03-14 00:43:24] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-14 00:43:24] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2023-03-14 00:43:25] [INFO ] Invariant cache hit.
[2023-03-14 00:43:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-14 00:43:25] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2023-03-14 00:43:25] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2023-03-14 00:43:25] [INFO ] Invariant cache hit.
[2023-03-14 00:43:25] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/212 places, 220/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 547 ms. Remains : 188/212 places, 220/256 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s169 0) (EQ s187 1)), p1:(AND (EQ s46 0) (EQ s173 1))], 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, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLCardinality-13 finished in 902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 256/256 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 256
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 192 transition count 236
Ensure Unique test removed 3 places
Iterating global reduction 1 with 22 rules applied. Total rules applied 42 place count 189 transition count 236
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 58 place count 189 transition count 220
Applied a total of 58 rules in 9 ms. Remains 189 /212 variables (removed 23) and now considering 220/256 (removed 36) transitions.
[2023-03-14 00:43:25] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
// Phase 1: matrix 212 rows 189 cols
[2023-03-14 00:43:25] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-14 00:43:25] [INFO ] Implicit Places using invariants in 144 ms returned [114]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/212 places, 220/256 transitions.
Applied a total of 0 rules in 3 ms. Remains 188 /188 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 188/212 places, 220/256 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s167 0) (EQ s40 1) (AND (EQ s132 0) (EQ s43 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1730 steps with 0 reset in 14 ms.
FORMULA NoC3x3-PT-3A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLCardinality-14 finished in 272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 256/256 transitions.
Graph (complete) has 629 edges and 212 vertex of which 211 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 210 transition count 185
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 169 place count 132 transition count 165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 169 place count 132 transition count 164
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 172 place count 130 transition count 164
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 172 place count 130 transition count 163
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 174 place count 129 transition count 163
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 180 place count 123 transition count 157
Ensure Unique test removed 4 places
Iterating global reduction 2 with 10 rules applied. Total rules applied 190 place count 119 transition count 157
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 197 place count 119 transition count 150
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 206 place count 114 transition count 146
Applied a total of 206 rules in 27 ms. Remains 114 /212 variables (removed 98) and now considering 146/256 (removed 110) transitions.
[2023-03-14 00:43:25] [INFO ] Flow matrix only has 145 transitions (discarded 1 similar events)
// Phase 1: matrix 145 rows 114 cols
[2023-03-14 00:43:25] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-14 00:43:26] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-14 00:43:26] [INFO ] Flow matrix only has 145 transitions (discarded 1 similar events)
[2023-03-14 00:43:26] [INFO ] Invariant cache hit.
[2023-03-14 00:43:26] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-14 00:43:26] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-14 00:43:26] [INFO ] Redundant transitions in 84 ms returned [24, 30, 31, 42, 43, 55, 56, 57, 58, 59, 69, 73, 83, 96, 97, 99, 103, 106, 107, 108, 114, 115, 116, 118, 123, 126, 130, 133, 134, 135, 136, 142]
Found 32 redundant transitions using SMT.
Drop transitions removed 32 transitions
Redundant transitions reduction (with SMT) removed 32 transitions.
[2023-03-14 00:43:26] [INFO ] Flow matrix only has 113 transitions (discarded 1 similar events)
// Phase 1: matrix 113 rows 114 cols
[2023-03-14 00:43:26] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-14 00:43:26] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/212 places, 114/256 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 114 transition count 103
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 33 rules applied. Total rules applied 33 place count 92 transition count 103
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 35 place count 92 transition count 101
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 50 edges and 88 vertex of which 18 / 88 are part of one of the 9 SCC in 1 ms
Free SCC test removed 9 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 42 place count 79 transition count 99
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 51 place count 79 transition count 90
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 18 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 78 place count 61 transition count 81
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 3 with 2 rules applied. Total rules applied 80 place count 60 transition count 80
Graph (trivial) has 40 edges and 60 vertex of which 16 / 60 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 52 transition count 80
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 89 place count 52 transition count 72
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 107 place count 52 transition count 54
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 108 place count 51 transition count 54
Applied a total of 108 rules in 18 ms. Remains 51 /114 variables (removed 63) and now considering 54/114 (removed 60) transitions.
[2023-03-14 00:43:26] [INFO ] Flow matrix only has 53 transitions (discarded 1 similar events)
// Phase 1: matrix 53 rows 51 cols
[2023-03-14 00:43:26] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-14 00:43:26] [INFO ] Implicit Places using invariants in 60 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/212 places, 54/256 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 631 ms. Remains : 50/212 places, 54/256 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s20 0) (EQ s26 1) (AND (NEQ s38 0) (NEQ s31 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLCardinality-15 finished in 695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((F(X((p0 U F(p1))))&&X(p2)) U !p0)))))'
[2023-03-14 00:43:26] [INFO ] Flatten gal took : 24 ms
[2023-03-14 00:43:26] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2023-03-14 00:43:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 212 places, 256 transitions and 853 arcs took 4 ms.
Total runtime 27467 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT NoC3x3-PT-3A
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
LTLCardinality

FORMULA NoC3x3-PT-3A-LTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678754607876

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:421
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:346
lola: rewrite Frontend/Parser/formula_rewrite.k:524
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 NoC3x3-PT-3A-LTLCardinality-07
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for NoC3x3-PT-3A-LTLCardinality-07
lola: result : true
lola: markings : 483
lola: fired transitions : 1139
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-3A-LTLCardinality-07: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="NoC3x3-PT-3A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is NoC3x3-PT-3A, 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 r263-smll-167863538000259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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