About the Execution of LoLa+red for FlexibleBarrier-PT-06b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 606.071 | 34053.00 | 55735.00 | 613.40 | FTTFTFFTFFFFFFTT | normal |
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.r167-tall-167838853100467.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 FlexibleBarrier-PT-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853100467
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 12:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 12:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 141K Mar 5 18:22 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 FlexibleBarrier-PT-06b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678484873903
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=FlexibleBarrier-PT-06b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 21:47:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 21:47:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 21:47:55] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-10 21:47:55] [INFO ] Transformed 542 places.
[2023-03-10 21:47:55] [INFO ] Transformed 621 transitions.
[2023-03-10 21:47:55] [INFO ] Found NUPN structural information;
[2023-03-10 21:47:55] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 621/621 transitions.
Discarding 172 places :
Symmetric choice reduction at 0 with 172 rule applications. Total rules 172 place count 370 transition count 449
Iterating global reduction 0 with 172 rules applied. Total rules applied 344 place count 370 transition count 449
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 412 place count 302 transition count 381
Iterating global reduction 0 with 68 rules applied. Total rules applied 480 place count 302 transition count 381
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 515 place count 267 transition count 346
Iterating global reduction 0 with 35 rules applied. Total rules applied 550 place count 267 transition count 346
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 565 place count 267 transition count 331
Applied a total of 565 rules in 104 ms. Remains 267 /542 variables (removed 275) and now considering 331/621 (removed 290) transitions.
// Phase 1: matrix 331 rows 267 cols
[2023-03-10 21:47:56] [INFO ] Computed 8 place invariants in 14 ms
[2023-03-10 21:47:56] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-10 21:47:56] [INFO ] Invariant cache hit.
[2023-03-10 21:47:56] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2023-03-10 21:47:56] [INFO ] Invariant cache hit.
[2023-03-10 21:47:56] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/542 places, 331/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1102 ms. Remains : 267/542 places, 331/621 transitions.
Support contains 31 out of 267 places after structural reductions.
[2023-03-10 21:47:56] [INFO ] Flatten gal took : 48 ms
[2023-03-10 21:47:57] [INFO ] Flatten gal took : 20 ms
[2023-03-10 21:47:57] [INFO ] Input system was already deterministic with 331 transitions.
Incomplete random walk after 10000 steps, including 185 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 19) seen :11
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :1
Running SMT prover for 6 properties.
[2023-03-10 21:47:57] [INFO ] Invariant cache hit.
[2023-03-10 21:47:57] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 21:47:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-10 21:47:58] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-10 21:47:58] [INFO ] After 330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-10 21:47:58] [INFO ] After 617ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 3 properties in 26 ms.
Support contains 6 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 331/331 transitions.
Graph (trivial) has 238 edges and 267 vertex of which 37 / 267 are part of one of the 6 SCC in 3 ms
Free SCC test removed 31 places
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 236 transition count 258
Reduce places removed 35 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 201 transition count 256
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 199 transition count 256
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 75 place count 199 transition count 241
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 105 place count 184 transition count 241
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 130 place count 159 transition count 216
Iterating global reduction 3 with 25 rules applied. Total rules applied 155 place count 159 transition count 216
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 155 place count 159 transition count 215
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 157 place count 158 transition count 215
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 162 place count 153 transition count 210
Iterating global reduction 3 with 5 rules applied. Total rules applied 167 place count 153 transition count 210
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 171 place count 153 transition count 206
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 247 place count 115 transition count 168
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 257 place count 115 transition count 158
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 267 place count 105 transition count 148
Iterating global reduction 5 with 10 rules applied. Total rules applied 277 place count 105 transition count 148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 281 place count 105 transition count 144
Free-agglomeration rule applied 64 times.
Iterating global reduction 6 with 64 rules applied. Total rules applied 345 place count 105 transition count 80
Reduce places removed 64 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 106 edges and 41 vertex of which 36 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 89 rules applied. Total rules applied 434 place count 36 transition count 56
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 441 place count 36 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 442 place count 35 transition count 48
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 25 edges and 34 vertex of which 10 / 34 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 445 place count 29 transition count 47
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 456 place count 28 transition count 37
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 5 Pre rules applied. Total rules applied 456 place count 28 transition count 32
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 466 place count 23 transition count 32
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 470 place count 23 transition count 28
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 478 place count 19 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 479 place count 19 transition count 23
Free-agglomeration rule applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 484 place count 19 transition count 18
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 495 place count 12 transition count 14
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 496 place count 12 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 497 place count 11 transition count 13
Applied a total of 497 rules in 55 ms. Remains 11 /267 variables (removed 256) and now considering 13/331 (removed 318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 11/267 places, 13/331 transitions.
Finished random walk after 67 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=33 )
Computed a total of 9 stabilizing places and 9 stable transitions
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||X(p1))))'
Support contains 3 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 331/331 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 247 transition count 311
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 247 transition count 311
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 233 transition count 297
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 233 transition count 297
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 76 place count 233 transition count 289
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 229 transition count 285
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 229 transition count 285
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 86 place count 229 transition count 283
Applied a total of 86 rules in 18 ms. Remains 229 /267 variables (removed 38) and now considering 283/331 (removed 48) transitions.
// Phase 1: matrix 283 rows 229 cols
[2023-03-10 21:47:58] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-10 21:47:59] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-10 21:47:59] [INFO ] Invariant cache hit.
[2023-03-10 21:47:59] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-10 21:47:59] [INFO ] Invariant cache hit.
[2023-03-10 21:47:59] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/267 places, 283/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 386 ms. Remains : 229/267 places, 283/331 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s182 1), p1:(OR (EQ s212 0) (EQ s202 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 340 ms.
Product exploration explored 100000 steps with 50000 reset in 238 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-06b-LTLCardinality-01 finished in 1308 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(G((p0||X(F((p0&&F(p1))))))) U (!p2||X(F(p3))))))'
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 331/331 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 251 transition count 315
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 251 transition count 315
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 45 place count 238 transition count 302
Iterating global reduction 0 with 13 rules applied. Total rules applied 58 place count 238 transition count 302
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 64 place count 238 transition count 296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 236 transition count 294
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 236 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 236 transition count 293
Applied a total of 69 rules in 21 ms. Remains 236 /267 variables (removed 31) and now considering 293/331 (removed 38) transitions.
// Phase 1: matrix 293 rows 236 cols
[2023-03-10 21:48:00] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-10 21:48:00] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-10 21:48:00] [INFO ] Invariant cache hit.
[2023-03-10 21:48:00] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-10 21:48:00] [INFO ] Invariant cache hit.
[2023-03-10 21:48:00] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/267 places, 293/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 452 ms. Remains : 236/267 places, 293/331 transitions.
Stuttering acceptance computed with spot in 334 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(NOT p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s10 0) (EQ s170 1)), p0:(EQ s203 1), p1:(OR (EQ s110 0) (EQ s229 1)), p3:(OR (EQ s148 0) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 199 ms.
Product exploration explored 100000 steps with 33333 reset in 181 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1 p3), (X p2), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p3)), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p3))
Knowledge based reduction with 11 factoid took 320 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-06b-LTLCardinality-02 finished in 1522 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(((p0 U p1)&&F(p2)))))'
Support contains 6 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 331/331 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 250 transition count 314
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 250 transition count 314
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 47 place count 237 transition count 301
Iterating global reduction 0 with 13 rules applied. Total rules applied 60 place count 237 transition count 301
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 66 place count 237 transition count 295
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 233 transition count 291
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 233 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 76 place count 233 transition count 289
Applied a total of 76 rules in 14 ms. Remains 233 /267 variables (removed 34) and now considering 289/331 (removed 42) transitions.
// Phase 1: matrix 289 rows 233 cols
[2023-03-10 21:48:01] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-10 21:48:01] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-10 21:48:01] [INFO ] Invariant cache hit.
[2023-03-10 21:48:01] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-10 21:48:01] [INFO ] Invariant cache hit.
[2023-03-10 21:48:02] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/267 places, 289/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 233/267 places, 289/331 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(OR (EQ s142 0) (EQ s10 1)), p1:(OR (EQ s183 0) (EQ s85 1)), p0:(OR (EQ s48 0) (EQ s181 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 165 ms.
Product exploration explored 100000 steps with 33333 reset in 169 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 p1 p0)
Knowledge based reduction with 5 factoid took 239 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-06b-LTLCardinality-04 finished in 1167 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 1 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 331/331 transitions.
Graph (trivial) has 246 edges and 267 vertex of which 37 / 267 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 235 transition count 259
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 196 transition count 259
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 79 place count 196 transition count 243
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 111 place count 180 transition count 243
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 140 place count 151 transition count 214
Iterating global reduction 2 with 29 rules applied. Total rules applied 169 place count 151 transition count 214
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 151 transition count 213
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 171 place count 150 transition count 213
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 176 place count 145 transition count 208
Iterating global reduction 2 with 5 rules applied. Total rules applied 181 place count 145 transition count 208
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 185 place count 145 transition count 204
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 257 place count 109 transition count 168
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 262 place count 104 transition count 163
Iterating global reduction 3 with 5 rules applied. Total rules applied 267 place count 104 transition count 163
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 272 place count 104 transition count 158
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 278 place count 104 transition count 152
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 280 place count 102 transition count 150
Applied a total of 280 rules in 54 ms. Remains 102 /267 variables (removed 165) and now considering 150/331 (removed 181) transitions.
[2023-03-10 21:48:02] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
// Phase 1: matrix 139 rows 102 cols
[2023-03-10 21:48:02] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-10 21:48:03] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-10 21:48:03] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2023-03-10 21:48:03] [INFO ] Invariant cache hit.
[2023-03-10 21:48:03] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-10 21:48:03] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 21:48:03] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2023-03-10 21:48:03] [INFO ] Invariant cache hit.
[2023-03-10 21:48:03] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/267 places, 150/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 282 ms. Remains : 102/267 places, 150/331 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLCardinality-06 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:(EQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLCardinality-06 finished in 379 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((p0||G(F(p1)))))'
Support contains 2 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 331/331 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 246 transition count 310
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 246 transition count 310
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 57 place count 231 transition count 295
Iterating global reduction 0 with 15 rules applied. Total rules applied 72 place count 231 transition count 295
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 79 place count 231 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 83 place count 227 transition count 284
Iterating global reduction 1 with 4 rules applied. Total rules applied 87 place count 227 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 89 place count 227 transition count 282
Applied a total of 89 rules in 20 ms. Remains 227 /267 variables (removed 40) and now considering 282/331 (removed 49) transitions.
// Phase 1: matrix 282 rows 227 cols
[2023-03-10 21:48:03] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-10 21:48:03] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-10 21:48:03] [INFO ] Invariant cache hit.
[2023-03-10 21:48:03] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-10 21:48:03] [INFO ] Invariant cache hit.
[2023-03-10 21:48:03] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 227/267 places, 282/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 345 ms. Remains : 227/267 places, 282/331 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s67 0), p1:(AND (EQ s67 0) (EQ s97 0))], 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 198 ms.
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 117 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-06b-LTLCardinality-07 finished in 1051 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)&&F(G(p1))))'
Support contains 3 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 331/331 transitions.
Graph (trivial) has 242 edges and 267 vertex of which 37 / 267 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 235 transition count 261
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 198 transition count 261
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 75 place count 198 transition count 245
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 107 place count 182 transition count 245
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 135 place count 154 transition count 217
Iterating global reduction 2 with 28 rules applied. Total rules applied 163 place count 154 transition count 217
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 167 place count 150 transition count 213
Iterating global reduction 2 with 4 rules applied. Total rules applied 171 place count 150 transition count 213
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 175 place count 150 transition count 209
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 251 place count 112 transition count 171
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 255 place count 108 transition count 167
Iterating global reduction 3 with 4 rules applied. Total rules applied 259 place count 108 transition count 167
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 263 place count 108 transition count 163
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 269 place count 108 transition count 157
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 271 place count 106 transition count 155
Applied a total of 271 rules in 49 ms. Remains 106 /267 variables (removed 161) and now considering 155/331 (removed 176) transitions.
[2023-03-10 21:48:04] [INFO ] Flow matrix only has 144 transitions (discarded 11 similar events)
// Phase 1: matrix 144 rows 106 cols
[2023-03-10 21:48:04] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-10 21:48:04] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-10 21:48:04] [INFO ] Flow matrix only has 144 transitions (discarded 11 similar events)
[2023-03-10 21:48:04] [INFO ] Invariant cache hit.
[2023-03-10 21:48:04] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-10 21:48:04] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 21:48:04] [INFO ] Flow matrix only has 144 transitions (discarded 11 similar events)
[2023-03-10 21:48:04] [INFO ] Invariant cache hit.
[2023-03-10 21:48:04] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/267 places, 155/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 106/267 places, 155/331 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s90 0), p1:(AND (NEQ s66 0) (NEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLCardinality-11 finished in 405 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 U p1))))'
Support contains 4 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 331/331 transitions.
Graph (trivial) has 243 edges and 267 vertex of which 37 / 267 are part of one of the 6 SCC in 6 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 235 transition count 260
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 197 transition count 259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 196 transition count 259
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 79 place count 196 transition count 242
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 113 place count 179 transition count 242
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 140 place count 152 transition count 215
Iterating global reduction 3 with 27 rules applied. Total rules applied 167 place count 152 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 167 place count 152 transition count 214
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 169 place count 151 transition count 214
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 174 place count 146 transition count 209
Iterating global reduction 3 with 5 rules applied. Total rules applied 179 place count 146 transition count 209
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 184 place count 146 transition count 204
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 256 place count 110 transition count 168
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 259 place count 107 transition count 165
Iterating global reduction 4 with 3 rules applied. Total rules applied 262 place count 107 transition count 165
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 265 place count 107 transition count 162
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 270 place count 107 transition count 157
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 272 place count 105 transition count 155
Applied a total of 272 rules in 51 ms. Remains 105 /267 variables (removed 162) and now considering 155/331 (removed 176) transitions.
[2023-03-10 21:48:04] [INFO ] Flow matrix only has 144 transitions (discarded 11 similar events)
// Phase 1: matrix 144 rows 105 cols
[2023-03-10 21:48:04] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-10 21:48:04] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-10 21:48:04] [INFO ] Flow matrix only has 144 transitions (discarded 11 similar events)
[2023-03-10 21:48:04] [INFO ] Invariant cache hit.
[2023-03-10 21:48:04] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-10 21:48:05] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-10 21:48:05] [INFO ] Flow matrix only has 144 transitions (discarded 11 similar events)
[2023-03-10 21:48:05] [INFO ] Invariant cache hit.
[2023-03-10 21:48:05] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/267 places, 155/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 342 ms. Remains : 105/267 places, 155/331 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s14 0) (EQ s50 1)), p0:(OR (EQ s89 0) (EQ s2 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 14409 steps with 1130 reset in 122 ms.
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLCardinality-12 finished in 569 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)||X(X(G(p1))))))'
Support contains 4 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 331/331 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 247 transition count 311
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 247 transition count 311
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 233 transition count 297
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 233 transition count 297
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 76 place count 233 transition count 289
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 230 transition count 286
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 230 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 230 transition count 285
Applied a total of 83 rules in 14 ms. Remains 230 /267 variables (removed 37) and now considering 285/331 (removed 46) transitions.
// Phase 1: matrix 285 rows 230 cols
[2023-03-10 21:48:05] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-10 21:48:05] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-10 21:48:05] [INFO ] Invariant cache hit.
[2023-03-10 21:48:05] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-10 21:48:05] [INFO ] Invariant cache hit.
[2023-03-10 21:48:05] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/267 places, 285/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 340 ms. Remains : 230/267 places, 285/331 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(EQ s56 1), p1:(AND (EQ s201 0) (EQ s41 1) (EQ s96 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLCardinality-13 finished in 571 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(p0)))))'
Support contains 2 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 331/331 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 247 transition count 311
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 247 transition count 311
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 233 transition count 297
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 233 transition count 297
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 75 place count 233 transition count 290
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 79 place count 229 transition count 286
Iterating global reduction 1 with 4 rules applied. Total rules applied 83 place count 229 transition count 286
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 85 place count 229 transition count 284
Applied a total of 85 rules in 12 ms. Remains 229 /267 variables (removed 38) and now considering 284/331 (removed 47) transitions.
// Phase 1: matrix 284 rows 229 cols
[2023-03-10 21:48:05] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-10 21:48:06] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-10 21:48:06] [INFO ] Invariant cache hit.
[2023-03-10 21:48:06] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-10 21:48:06] [INFO ] Invariant cache hit.
[2023-03-10 21:48:06] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/267 places, 284/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 380 ms. Remains : 229/267 places, 284/331 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s215 0) (EQ s203 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][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 151 ms.
Product exploration explored 100000 steps with 25000 reset in 168 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 187 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1909332 steps, run timeout after 3001 ms. (steps per millisecond=636 ) properties seen :{}
Probabilistic random walk after 1909332 steps, saw 462215 distinct states, run finished after 3002 ms. (steps per millisecond=636 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 21:48:10] [INFO ] Invariant cache hit.
[2023-03-10 21:48:10] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 21:48:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-10 21:48:10] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 21:48:10] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-10 21:48:10] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Applied a total of 0 rules in 2 ms. Remains 229 /229 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2023-03-10 21:48:10] [INFO ] Invariant cache hit.
[2023-03-10 21:48:10] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-10 21:48:10] [INFO ] Invariant cache hit.
[2023-03-10 21:48:10] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-10 21:48:10] [INFO ] Invariant cache hit.
[2023-03-10 21:48:11] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 229/229 places, 284/284 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 181 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1997248 steps, run timeout after 3001 ms. (steps per millisecond=665 ) properties seen :{}
Probabilistic random walk after 1997248 steps, saw 482154 distinct states, run finished after 3002 ms. (steps per millisecond=665 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 21:48:14] [INFO ] Invariant cache hit.
[2023-03-10 21:48:14] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 21:48:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-10 21:48:14] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 21:48:14] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-10 21:48:14] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 34 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 120 ms.
Product exploration explored 100000 steps with 25000 reset in 155 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Graph (trivial) has 206 edges and 229 vertex of which 37 / 229 are part of one of the 6 SCC in 0 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 198 transition count 252
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 17 Pre rules applied. Total rules applied 24 place count 198 transition count 252
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 41 place count 198 transition count 252
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 68 place count 171 transition count 225
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 95 place count 171 transition count 225
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 131 place count 171 transition count 237
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 147 place count 155 transition count 221
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 163 place count 155 transition count 221
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 169 place count 155 transition count 233
Deduced a syphon composed of 50 places in 0 ms
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 181 place count 155 transition count 221
Deduced a syphon composed of 50 places in 0 ms
Applied a total of 181 rules in 50 ms. Remains 155 /229 variables (removed 74) and now considering 221/284 (removed 63) transitions.
[2023-03-10 21:48:15] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 21:48:15] [INFO ] Flow matrix only has 210 transitions (discarded 11 similar events)
// Phase 1: matrix 210 rows 155 cols
[2023-03-10 21:48:15] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-10 21:48:16] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/229 places, 221/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 635 ms. Remains : 155/229 places, 221/284 transitions.
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Applied a total of 0 rules in 3 ms. Remains 229 /229 variables (removed 0) and now considering 284/284 (removed 0) transitions.
// Phase 1: matrix 284 rows 229 cols
[2023-03-10 21:48:16] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-10 21:48:16] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-10 21:48:16] [INFO ] Invariant cache hit.
[2023-03-10 21:48:16] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-10 21:48:16] [INFO ] Invariant cache hit.
[2023-03-10 21:48:16] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 543 ms. Remains : 229/229 places, 284/284 transitions.
Treatment of property FlexibleBarrier-PT-06b-LTLCardinality-15 finished in 11015 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(p0)))))'
Found a Shortening insensitive property : FlexibleBarrier-PT-06b-LTLCardinality-15
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 267 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 267/267 places, 331/331 transitions.
Graph (trivial) has 244 edges and 267 vertex of which 37 / 267 are part of one of the 6 SCC in 0 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 235 transition count 260
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 197 transition count 260
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 77 place count 197 transition count 244
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 109 place count 181 transition count 244
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 137 place count 153 transition count 216
Iterating global reduction 2 with 28 rules applied. Total rules applied 165 place count 153 transition count 216
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 165 place count 153 transition count 215
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 167 place count 152 transition count 215
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 171 place count 148 transition count 211
Iterating global reduction 2 with 4 rules applied. Total rules applied 175 place count 148 transition count 211
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 179 place count 148 transition count 207
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 253 place count 111 transition count 170
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 258 place count 106 transition count 165
Iterating global reduction 3 with 5 rules applied. Total rules applied 263 place count 106 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 268 place count 106 transition count 160
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 274 place count 106 transition count 154
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 276 place count 104 transition count 152
Applied a total of 276 rules in 32 ms. Remains 104 /267 variables (removed 163) and now considering 152/331 (removed 179) transitions.
[2023-03-10 21:48:17] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
// Phase 1: matrix 141 rows 104 cols
[2023-03-10 21:48:17] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-10 21:48:17] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-10 21:48:17] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
[2023-03-10 21:48:17] [INFO ] Invariant cache hit.
[2023-03-10 21:48:17] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2023-03-10 21:48:17] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
[2023-03-10 21:48:17] [INFO ] Invariant cache hit.
[2023-03-10 21:48:17] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 104/267 places, 152/331 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 603 ms. Remains : 104/267 places, 152/331 transitions.
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s94 0) (EQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 227 ms.
Product exploration explored 100000 steps with 25000 reset in 227 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 827 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2723605 steps, run visited all 1 properties in 2745 ms. (steps per millisecond=992 )
Probabilistic random walk after 2723605 steps, saw 549767 distinct states, run finished after 2747 ms. (steps per millisecond=991 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 152/152 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2023-03-10 21:48:21] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
[2023-03-10 21:48:21] [INFO ] Invariant cache hit.
[2023-03-10 21:48:21] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-10 21:48:21] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
[2023-03-10 21:48:21] [INFO ] Invariant cache hit.
[2023-03-10 21:48:22] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-10 21:48:22] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
[2023-03-10 21:48:22] [INFO ] Invariant cache hit.
[2023-03-10 21:48:22] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 104/104 places, 152/152 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 826 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2723605 steps, run visited all 1 properties in 2792 ms. (steps per millisecond=975 )
Probabilistic random walk after 2723605 steps, saw 549767 distinct states, run finished after 2793 ms. (steps per millisecond=975 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 223 ms.
Product exploration explored 100000 steps with 25000 reset in 225 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 152/152 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2023-03-10 21:48:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 21:48:26] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
[2023-03-10 21:48:26] [INFO ] Invariant cache hit.
[2023-03-10 21:48:26] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 104/104 places, 152/152 transitions.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 152/152 transitions.
Applied a total of 0 rules in 0 ms. Remains 104 /104 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2023-03-10 21:48:26] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
[2023-03-10 21:48:26] [INFO ] Invariant cache hit.
[2023-03-10 21:48:26] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-10 21:48:26] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
[2023-03-10 21:48:26] [INFO ] Invariant cache hit.
[2023-03-10 21:48:26] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-10 21:48:26] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
[2023-03-10 21:48:26] [INFO ] Invariant cache hit.
[2023-03-10 21:48:26] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 104/104 places, 152/152 transitions.
Treatment of property FlexibleBarrier-PT-06b-LTLCardinality-15 finished in 9800 ms.
[2023-03-10 21:48:26] [INFO ] Flatten gal took : 13 ms
[2023-03-10 21:48:26] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-10 21:48:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 267 places, 331 transitions and 893 arcs took 19 ms.
Total runtime 31376 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FlexibleBarrier-PT-06b
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678484907956
--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 FlexibleBarrier-PT-06b-LTLCardinality-15
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for FlexibleBarrier-PT-06b-LTLCardinality-15
lola: result : true
lola: markings : 9
lola: fired transitions : 9
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FlexibleBarrier-PT-06b-LTLCardinality-15: 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="FlexibleBarrier-PT-06b"
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 FlexibleBarrier-PT-06b, 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 r167-tall-167838853100467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-06b.tgz
mv FlexibleBarrier-PT-06b 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 '
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 ;