About the Execution of ITS-Tools for FlexibleBarrier-PT-18a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 318.680 | 27220.00 | 48743.00 | 241.30 | TTFFFFFFFFFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r096-smll-165260575800116.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FlexibleBarrier-PT-18a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260575800116
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 8.0K Apr 29 13:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 29 13:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 13:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 13:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 265K May 10 09:33 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-18a-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652649156045
Running Version 202205111006
[2022-05-15 21:12:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 21:12:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 21:12:38] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2022-05-15 21:12:38] [INFO ] Transformed 219 places.
[2022-05-15 21:12:38] [INFO ] Transformed 886 transitions.
[2022-05-15 21:12:38] [INFO ] Found NUPN structural information;
[2022-05-15 21:12:38] [INFO ] Parsed PT model containing 219 places and 886 transitions in 400 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 290 transitions
Reduce redundant transitions removed 290 transitions.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 596/596 transitions.
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 219 transition count 578
Applied a total of 18 rules in 54 ms. Remains 219 /219 variables (removed 0) and now considering 578/596 (removed 18) transitions.
// Phase 1: matrix 578 rows 219 cols
[2022-05-15 21:12:38] [INFO ] Computed 20 place invariants in 30 ms
[2022-05-15 21:12:39] [INFO ] Implicit Places using invariants in 388 ms returned []
// Phase 1: matrix 578 rows 219 cols
[2022-05-15 21:12:39] [INFO ] Computed 20 place invariants in 9 ms
[2022-05-15 21:12:39] [INFO ] State equation strengthened by 397 read => feed constraints.
[2022-05-15 21:12:39] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 1047 ms to find 0 implicit places.
// Phase 1: matrix 578 rows 219 cols
[2022-05-15 21:12:39] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-15 21:12:40] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 219/219 places, 578/596 transitions.
Finished structural reductions, in 1 iterations. Remains : 219/219 places, 578/596 transitions.
Support contains 34 out of 219 places after structural reductions.
[2022-05-15 21:12:40] [INFO ] Flatten gal took : 102 ms
[2022-05-15 21:12:40] [INFO ] Flatten gal took : 58 ms
[2022-05-15 21:12:40] [INFO ] Input system was already deterministic with 578 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 31) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 578 rows 219 cols
[2022-05-15 21:12:41] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-15 21:12:41] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 3 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(X((F(p0) U !p1)))))'
Support contains 5 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 17 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
// Phase 1: matrix 578 rows 219 cols
[2022-05-15 21:12:41] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-15 21:12:41] [INFO ] Implicit Places using invariants in 203 ms returned [218]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 209 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/219 places, 578/578 transitions.
Applied a total of 0 rules in 9 ms. Remains 218 /218 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 218/219 places, 578/578 transitions.
Stuttering acceptance computed with spot in 442 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s47 1) (EQ s120 1) (EQ s217 1)), p0:(AND (EQ s108 1) (EQ s203 1) (EQ s217 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2460 ms.
Product exploration explored 100000 steps with 50000 reset in 2269 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-00 finished in 5753 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !(X(p1)||p0)))'
Support contains 5 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 6 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
// Phase 1: matrix 578 rows 219 cols
[2022-05-15 21:12:47] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-15 21:12:47] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 578 rows 219 cols
[2022-05-15 21:12:47] [INFO ] Computed 20 place invariants in 7 ms
[2022-05-15 21:12:47] [INFO ] State equation strengthened by 397 read => feed constraints.
[2022-05-15 21:12:47] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
// Phase 1: matrix 578 rows 219 cols
[2022-05-15 21:12:47] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-15 21:12:48] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 219/219 places, 578/578 transitions.
Stuttering acceptance computed with spot in 117 ms :[p1, true, (OR p0 p1)]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (EQ s127 1) (EQ s218 1)), p0:(AND (EQ s59 1) (EQ s204 1) (EQ s217 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2128 ms.
Product exploration explored 100000 steps with 50000 reset in 2235 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 5 factoid took 135 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-01 finished in 5942 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)||p1)))'
Support contains 5 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Graph (trivial) has 170 edges and 219 vertex of which 42 / 219 are part of one of the 14 SCC in 4 ms
Free SCC test removed 28 places
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 137 transition count 418
Drop transitions removed 199 transitions
Redundant transition composition rules discarded 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 308 place count 137 transition count 219
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 310 place count 137 transition count 219
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 312 place count 135 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 314 place count 135 transition count 217
Applied a total of 314 rules in 104 ms. Remains 135 /219 variables (removed 84) and now considering 217/578 (removed 361) transitions.
[2022-05-15 21:12:53] [INFO ] Flow matrix only has 186 transitions (discarded 31 similar events)
// Phase 1: matrix 186 rows 135 cols
[2022-05-15 21:12:53] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-15 21:12:53] [INFO ] Implicit Places using invariants in 150 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 157 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/219 places, 217/578 transitions.
Graph (trivial) has 176 edges and 134 vertex of which 42 / 134 are part of one of the 14 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 106 transition count 143
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 88 transition count 143
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 37 place count 88 transition count 125
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 73 place count 70 transition count 125
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 117 place count 48 transition count 103
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 135 place count 48 transition count 85
Applied a total of 135 rules in 31 ms. Remains 48 /134 variables (removed 86) and now considering 85/217 (removed 132) transitions.
[2022-05-15 21:12:53] [INFO ] Flow matrix only has 64 transitions (discarded 21 similar events)
// Phase 1: matrix 64 rows 48 cols
[2022-05-15 21:12:53] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-15 21:12:53] [INFO ] Implicit Places using invariants in 51 ms returned []
[2022-05-15 21:12:53] [INFO ] Flow matrix only has 64 transitions (discarded 21 similar events)
// Phase 1: matrix 64 rows 48 cols
[2022-05-15 21:12:53] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-15 21:12:53] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-05-15 21:12:53] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/219 places, 85/578 transitions.
Finished structural reductions, in 2 iterations. Remains : 48/219 places, 85/578 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s18 1) (EQ s36 1) (EQ s47 1)), p1:(AND (EQ s11 1) (EQ s28 1) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-02 finished in 528 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G((G(p0)&&p1)))))'
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Graph (trivial) has 172 edges and 219 vertex of which 45 / 219 are part of one of the 15 SCC in 1 ms
Free SCC test removed 30 places
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 0 with 106 rules applied. Total rules applied 107 place count 136 transition count 404
Drop transitions removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 0 with 192 rules applied. Total rules applied 299 place count 136 transition count 212
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 301 place count 136 transition count 212
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 303 place count 134 transition count 210
Iterating global reduction 0 with 2 rules applied. Total rules applied 305 place count 134 transition count 210
Applied a total of 305 rules in 153 ms. Remains 134 /219 variables (removed 85) and now considering 210/578 (removed 368) transitions.
[2022-05-15 21:12:53] [INFO ] Flow matrix only has 178 transitions (discarded 32 similar events)
// Phase 1: matrix 178 rows 134 cols
[2022-05-15 21:12:53] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-15 21:12:54] [INFO ] Implicit Places using invariants in 378 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 421 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/219 places, 210/578 transitions.
Graph (trivial) has 178 edges and 133 vertex of which 45 / 133 are part of one of the 15 SCC in 0 ms
Free SCC test removed 30 places
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 103 transition count 132
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 85 transition count 132
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 37 place count 85 transition count 114
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 73 place count 67 transition count 114
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 115 place count 46 transition count 93
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 133 place count 46 transition count 75
Applied a total of 133 rules in 37 ms. Remains 46 /133 variables (removed 87) and now considering 75/210 (removed 135) transitions.
[2022-05-15 21:12:54] [INFO ] Flow matrix only has 55 transitions (discarded 20 similar events)
// Phase 1: matrix 55 rows 46 cols
[2022-05-15 21:12:54] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-15 21:12:54] [INFO ] Implicit Places using invariants in 113 ms returned []
[2022-05-15 21:12:54] [INFO ] Flow matrix only has 55 transitions (discarded 20 similar events)
// Phase 1: matrix 55 rows 46 cols
[2022-05-15 21:12:54] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-15 21:12:54] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-15 21:12:54] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/219 places, 75/578 transitions.
Finished structural reductions, in 2 iterations. Remains : 46/219 places, 75/578 transitions.
Stuttering acceptance computed with spot in 42 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s9 0) (EQ s23 0) (EQ s45 0)), p1:(OR (EQ s9 0) (EQ s32 0) (EQ s45 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-04 finished in 898 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(X(!p0))))'
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Graph (trivial) has 178 edges and 219 vertex of which 51 / 219 are part of one of the 17 SCC in 1 ms
Free SCC test removed 34 places
Ensure Unique test removed 154 transitions
Reduce isomorphic transitions removed 154 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 16 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 130 transition count 369
Drop transitions removed 169 transitions
Redundant transition composition rules discarded 169 transitions
Iterating global reduction 0 with 169 rules applied. Total rules applied 280 place count 130 transition count 200
Applied a total of 280 rules in 63 ms. Remains 130 /219 variables (removed 89) and now considering 200/578 (removed 378) transitions.
[2022-05-15 21:12:54] [INFO ] Flow matrix only has 166 transitions (discarded 34 similar events)
// Phase 1: matrix 166 rows 130 cols
[2022-05-15 21:12:54] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-15 21:12:54] [INFO ] Implicit Places using invariants in 294 ms returned [129]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 297 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/219 places, 200/578 transitions.
Graph (trivial) has 178 edges and 129 vertex of which 51 / 129 are part of one of the 17 SCC in 0 ms
Free SCC test removed 34 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 95 transition count 114
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 77 transition count 114
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 37 place count 77 transition count 96
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 73 place count 59 transition count 96
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 111 place count 40 transition count 77
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 129 place count 40 transition count 59
Applied a total of 129 rules in 77 ms. Remains 40 /129 variables (removed 89) and now considering 59/200 (removed 141) transitions.
[2022-05-15 21:12:55] [INFO ] Flow matrix only has 41 transitions (discarded 18 similar events)
// Phase 1: matrix 41 rows 40 cols
[2022-05-15 21:12:55] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-15 21:12:55] [INFO ] Implicit Places using invariants in 68 ms returned []
[2022-05-15 21:12:55] [INFO ] Flow matrix only has 41 transitions (discarded 18 similar events)
// Phase 1: matrix 41 rows 40 cols
[2022-05-15 21:12:55] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-15 21:12:55] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-05-15 21:12:55] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/219 places, 59/578 transitions.
Finished structural reductions, in 2 iterations. Remains : 40/219 places, 59/578 transitions.
Stuttering acceptance computed with spot in 125 ms :[p0, true, p0]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(AND (EQ s25 1) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-05 finished in 779 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((G(p0)||p1))))))'
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
// Phase 1: matrix 578 rows 219 cols
[2022-05-15 21:12:55] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-15 21:12:55] [INFO ] Implicit Places using invariants in 208 ms returned [218]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 212 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/219 places, 578/578 transitions.
Applied a total of 0 rules in 4 ms. Remains 218 /218 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 218/219 places, 578/578 transitions.
Stuttering acceptance computed with spot in 320 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (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-18a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(AND (EQ s198 1) (EQ s217 1)), p1:(AND (EQ s72 1) (EQ s167 1) (EQ s217 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-06 finished in 560 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(X((G(p0)&&p1))))))'
Support contains 5 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
// Phase 1: matrix 578 rows 219 cols
[2022-05-15 21:12:55] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-15 21:12:56] [INFO ] Implicit Places using invariants in 379 ms returned [218]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 383 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/219 places, 578/578 transitions.
Applied a total of 0 rules in 3 ms. Remains 218 /218 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 218/219 places, 578/578 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s108 0) (EQ s131 0) (EQ s217 0)), p1:(OR (EQ s155 0) (EQ s168 0) (EQ s217 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-09 finished in 633 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(F(X(F(p0))))))||F(p1)))'
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
// Phase 1: matrix 578 rows 219 cols
[2022-05-15 21:12:56] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-15 21:12:56] [INFO ] Implicit Places using invariants in 337 ms returned [218]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 342 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/219 places, 578/578 transitions.
Applied a total of 0 rules in 3 ms. Remains 218 /218 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 218/219 places, 578/578 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=2, aps=[p1:(EQ s145 1), p0:(AND (EQ s36 1) (EQ s203 1) (EQ s217 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 2916 reset in 1041 ms.
Stack based approach found an accepted trace after 170 steps with 6 reset with depth 112 and stack size 112 in 3 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-10 finished in 1597 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((X((G(p0)||(p1 U p2)))||p2))||p3))))'
Support contains 8 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
// Phase 1: matrix 578 rows 219 cols
[2022-05-15 21:12:58] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-15 21:12:58] [INFO ] Implicit Places using invariants in 249 ms returned [218]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 251 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/219 places, 578/578 transitions.
Applied a total of 0 rules in 11 ms. Remains 218 /218 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 218/219 places, 578/578 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), false, (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={1} source=0 dest: 0}, { cond=(NOT p3), acceptance={1, 2} source=0 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 1}], [{ cond=(AND p3 (NOT p2) (NOT p0) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={1, 2} source=1 dest: 0}, { cond=(AND p3 (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 2} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p0) p1), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={1, 2} source=1 dest: 2}, { cond=(AND p3 (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={2} source=1 dest: 3}], [{ cond=(AND p3 (NOT p2) p0 (NOT p1)), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={1, 2} source=2 dest: 0}, { cond=(AND p3 (NOT p2) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p3 (NOT p2) p0 p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={1, 2} source=2 dest: 2}], [{ cond=(AND p3 (NOT p0)), acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={1, 2} source=3 dest: 0}, { cond=(AND p3 (NOT p2) p0), acceptance={0} source=3 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 2} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p3 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={2} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s47 1) (EQ s60 1) (EQ s217 1)), p2:(AND (EQ s96 1) (EQ s179 1) (EQ s217 1)), p0:(AND (EQ s35 1) (EQ s204 1) (EQ s217 1)), p1:(EQ s92 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1659 reset in 1073 ms.
Stack based approach found an accepted trace after 277 steps with 6 reset with depth 12 and stack size 12 in 4 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-11 finished in 1570 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X(F(G(X((F(p0)||X(p1))))))))))'
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Graph (trivial) has 175 edges and 219 vertex of which 48 / 219 are part of one of the 16 SCC in 0 ms
Free SCC test removed 32 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 133 transition count 387
Drop transitions removed 182 transitions
Redundant transition composition rules discarded 182 transitions
Iterating global reduction 0 with 182 rules applied. Total rules applied 291 place count 133 transition count 205
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 292 place count 133 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 293 place count 132 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 294 place count 132 transition count 204
Applied a total of 294 rules in 35 ms. Remains 132 /219 variables (removed 87) and now considering 204/578 (removed 374) transitions.
[2022-05-15 21:12:59] [INFO ] Flow matrix only has 171 transitions (discarded 33 similar events)
// Phase 1: matrix 171 rows 132 cols
[2022-05-15 21:12:59] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-15 21:13:00] [INFO ] Implicit Places using invariants in 244 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 245 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/219 places, 204/578 transitions.
Graph (trivial) has 178 edges and 131 vertex of which 48 / 131 are part of one of the 16 SCC in 0 ms
Free SCC test removed 32 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 99 transition count 122
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 81 transition count 122
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 37 place count 81 transition count 104
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 73 place count 63 transition count 104
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 113 place count 43 transition count 84
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 131 place count 43 transition count 66
Applied a total of 131 rules in 8 ms. Remains 43 /131 variables (removed 88) and now considering 66/204 (removed 138) transitions.
[2022-05-15 21:13:00] [INFO ] Flow matrix only has 47 transitions (discarded 19 similar events)
// Phase 1: matrix 47 rows 43 cols
[2022-05-15 21:13:00] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-15 21:13:00] [INFO ] Implicit Places using invariants in 33 ms returned []
[2022-05-15 21:13:00] [INFO ] Flow matrix only has 47 transitions (discarded 19 similar events)
// Phase 1: matrix 47 rows 43 cols
[2022-05-15 21:13:00] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-15 21:13:00] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-05-15 21:13:00] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/219 places, 66/578 transitions.
Finished structural reductions, in 2 iterations. Remains : 43/219 places, 66/578 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s0 0), p0:(OR (EQ s19 0) (EQ s28 0) (EQ s42 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 317 ms.
Product exploration explored 100000 steps with 0 reset in 424 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/43 stabilizing places and 1/66 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 224 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-15 21:13:01] [INFO ] Flow matrix only has 47 transitions (discarded 19 similar events)
// Phase 1: matrix 47 rows 43 cols
[2022-05-15 21:13:01] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-15 21:13:01] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:13:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2022-05-15 21:13:01] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 203 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-12 finished in 2050 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Graph (trivial) has 175 edges and 219 vertex of which 48 / 219 are part of one of the 16 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 133 transition count 387
Drop transitions removed 182 transitions
Redundant transition composition rules discarded 182 transitions
Iterating global reduction 0 with 182 rules applied. Total rules applied 291 place count 133 transition count 205
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 292 place count 133 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 293 place count 132 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 294 place count 132 transition count 204
Applied a total of 294 rules in 30 ms. Remains 132 /219 variables (removed 87) and now considering 204/578 (removed 374) transitions.
[2022-05-15 21:13:01] [INFO ] Flow matrix only has 171 transitions (discarded 33 similar events)
// Phase 1: matrix 171 rows 132 cols
[2022-05-15 21:13:01] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-15 21:13:01] [INFO ] Implicit Places using invariants in 180 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 186 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/219 places, 204/578 transitions.
Graph (trivial) has 178 edges and 131 vertex of which 48 / 131 are part of one of the 16 SCC in 0 ms
Free SCC test removed 32 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 99 transition count 122
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 81 transition count 122
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 37 place count 81 transition count 104
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 73 place count 63 transition count 104
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 113 place count 43 transition count 84
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 131 place count 43 transition count 66
Applied a total of 131 rules in 10 ms. Remains 43 /131 variables (removed 88) and now considering 66/204 (removed 138) transitions.
[2022-05-15 21:13:02] [INFO ] Flow matrix only has 47 transitions (discarded 19 similar events)
// Phase 1: matrix 47 rows 43 cols
[2022-05-15 21:13:02] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-15 21:13:02] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-05-15 21:13:02] [INFO ] Flow matrix only has 47 transitions (discarded 19 similar events)
// Phase 1: matrix 47 rows 43 cols
[2022-05-15 21:13:02] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-15 21:13:02] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-05-15 21:13:02] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/219 places, 66/578 transitions.
Finished structural reductions, in 2 iterations. Remains : 43/219 places, 66/578 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-13 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:(AND (EQ s15 1) (EQ s26 1) (EQ s42 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 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-13 finished in 434 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((F(G((G(p0)||p0)))&&p1)))))'
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Graph (trivial) has 173 edges and 219 vertex of which 45 / 219 are part of one of the 15 SCC in 0 ms
Free SCC test removed 30 places
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 134 transition count 402
Drop transitions removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 0 with 192 rules applied. Total rules applied 303 place count 134 transition count 210
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 304 place count 134 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 305 place count 133 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 306 place count 133 transition count 209
Applied a total of 306 rules in 28 ms. Remains 133 /219 variables (removed 86) and now considering 209/578 (removed 369) transitions.
[2022-05-15 21:13:02] [INFO ] Flow matrix only has 177 transitions (discarded 32 similar events)
// Phase 1: matrix 177 rows 133 cols
[2022-05-15 21:13:02] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-15 21:13:02] [INFO ] Implicit Places using invariants in 164 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 165 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/219 places, 209/578 transitions.
Graph (trivial) has 176 edges and 132 vertex of which 45 / 132 are part of one of the 15 SCC in 0 ms
Free SCC test removed 30 places
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 102 transition count 131
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 84 transition count 131
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 37 place count 84 transition count 113
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 73 place count 66 transition count 113
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 115 place count 45 transition count 92
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 133 place count 45 transition count 74
Applied a total of 133 rules in 10 ms. Remains 45 /132 variables (removed 87) and now considering 74/209 (removed 135) transitions.
[2022-05-15 21:13:02] [INFO ] Flow matrix only has 54 transitions (discarded 20 similar events)
// Phase 1: matrix 54 rows 45 cols
[2022-05-15 21:13:02] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-15 21:13:02] [INFO ] Implicit Places using invariants in 39 ms returned []
[2022-05-15 21:13:02] [INFO ] Flow matrix only has 54 transitions (discarded 20 similar events)
// Phase 1: matrix 54 rows 45 cols
[2022-05-15 21:13:02] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-15 21:13:02] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-15 21:13:02] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/219 places, 74/578 transitions.
Finished structural reductions, in 2 iterations. Remains : 45/219 places, 74/578 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s29 1) (EQ s44 1)), p1:(OR (AND (EQ s3 1) (EQ s29 1) (EQ s44 1)) (AND (EQ s11 1) (EQ s29 1) (EQ s44 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 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-14 finished in 489 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(p0))))'
Support contains 3 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Graph (trivial) has 175 edges and 219 vertex of which 48 / 219 are part of one of the 16 SCC in 0 ms
Free SCC test removed 32 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 133 transition count 387
Drop transitions removed 182 transitions
Redundant transition composition rules discarded 182 transitions
Iterating global reduction 0 with 182 rules applied. Total rules applied 291 place count 133 transition count 205
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 292 place count 133 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 293 place count 132 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 294 place count 132 transition count 204
Applied a total of 294 rules in 21 ms. Remains 132 /219 variables (removed 87) and now considering 204/578 (removed 374) transitions.
[2022-05-15 21:13:02] [INFO ] Flow matrix only has 171 transitions (discarded 33 similar events)
// Phase 1: matrix 171 rows 132 cols
[2022-05-15 21:13:02] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-15 21:13:02] [INFO ] Implicit Places using invariants in 257 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 259 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/219 places, 204/578 transitions.
Graph (trivial) has 178 edges and 131 vertex of which 48 / 131 are part of one of the 16 SCC in 0 ms
Free SCC test removed 32 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 99 transition count 122
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 81 transition count 122
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 37 place count 81 transition count 104
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 73 place count 63 transition count 104
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 113 place count 43 transition count 84
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 131 place count 43 transition count 66
Applied a total of 131 rules in 8 ms. Remains 43 /131 variables (removed 88) and now considering 66/204 (removed 138) transitions.
[2022-05-15 21:13:02] [INFO ] Flow matrix only has 47 transitions (discarded 19 similar events)
// Phase 1: matrix 47 rows 43 cols
[2022-05-15 21:13:02] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-15 21:13:03] [INFO ] Implicit Places using invariants in 34 ms returned []
[2022-05-15 21:13:03] [INFO ] Flow matrix only has 47 transitions (discarded 19 similar events)
// Phase 1: matrix 47 rows 43 cols
[2022-05-15 21:13:03] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-15 21:13:03] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-05-15 21:13:03] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/219 places, 66/578 transitions.
Finished structural reductions, in 2 iterations. Remains : 43/219 places, 66/578 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s38 1) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-15 finished in 458 ms.
All properties solved by simple procedures.
Total runtime 25114 ms.
BK_STOP 1652649183265
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-18a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-18a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r096-smll-165260575800116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-18a.tgz
mv FlexibleBarrier-PT-18a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;