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.r042-smll-165252095700412.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 DES-PT-01b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095700412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 6.7K Apr 29 15:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 15:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 15:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 15:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:22 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 68K 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 DES-PT-01b-LTLFireability-00
FORMULA_NAME DES-PT-01b-LTLFireability-01
FORMULA_NAME DES-PT-01b-LTLFireability-02
FORMULA_NAME DES-PT-01b-LTLFireability-03
FORMULA_NAME DES-PT-01b-LTLFireability-04
FORMULA_NAME DES-PT-01b-LTLFireability-05
FORMULA_NAME DES-PT-01b-LTLFireability-06
FORMULA_NAME DES-PT-01b-LTLFireability-07
FORMULA_NAME DES-PT-01b-LTLFireability-08
FORMULA_NAME DES-PT-01b-LTLFireability-09
FORMULA_NAME DES-PT-01b-LTLFireability-10
FORMULA_NAME DES-PT-01b-LTLFireability-11
FORMULA_NAME DES-PT-01b-LTLFireability-12
FORMULA_NAME DES-PT-01b-LTLFireability-13
FORMULA_NAME DES-PT-01b-LTLFireability-14
FORMULA_NAME DES-PT-01b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652712639249

Running Version 202205111006
[2022-05-16 14:50:41] [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-16 14:50:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 14:50:42] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2022-05-16 14:50:42] [INFO ] Transformed 284 places.
[2022-05-16 14:50:42] [INFO ] Transformed 235 transitions.
[2022-05-16 14:50:42] [INFO ] Found NUPN structural information;
[2022-05-16 14:50:42] [INFO ] Parsed PT model containing 284 places and 235 transitions in 484 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DES-PT-01b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 235/235 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 281 transition count 235
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 259 transition count 213
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 259 transition count 213
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 62 place count 244 transition count 198
Iterating global reduction 1 with 15 rules applied. Total rules applied 77 place count 244 transition count 198
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 88 place count 244 transition count 187
Applied a total of 88 rules in 150 ms. Remains 244 /284 variables (removed 40) and now considering 187/235 (removed 48) transitions.
// Phase 1: matrix 187 rows 244 cols
[2022-05-16 14:50:43] [INFO ] Computed 62 place invariants in 61 ms
[2022-05-16 14:50:43] [INFO ] Implicit Places using invariants in 752 ms returned []
// Phase 1: matrix 187 rows 244 cols
[2022-05-16 14:50:43] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-16 14:50:44] [INFO ] Implicit Places using invariants and state equation in 717 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1546 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 243/284 places, 187/235 transitions.
Applied a total of 0 rules in 11 ms. Remains 243 /243 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 243/284 places, 187/235 transitions.
Support contains 34 out of 243 places after structural reductions.
[2022-05-16 14:50:44] [INFO ] Flatten gal took : 107 ms
[2022-05-16 14:50:44] [INFO ] Flatten gal took : 51 ms
[2022-05-16 14:50:45] [INFO ] Input system was already deterministic with 187 transitions.
Support contains 32 out of 243 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 102 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 26) seen :25
Finished Best-First random walk after 6847 steps, including 9 resets, run visited all 1 properties in 18 ms. (steps per millisecond=380 )
FORMULA DES-PT-01b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 61 stabilizing places and 54 stable transitions
Graph (complete) has 431 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.15 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((G(p0)&&!F(p1)&&p0))) U G(p0)))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 187/187 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 240 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 240 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 239 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 239 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 239 transition count 182
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 238 transition count 181
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 238 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 238 transition count 180
Applied a total of 12 rules in 39 ms. Remains 238 /243 variables (removed 5) and now considering 180/187 (removed 7) transitions.
// Phase 1: matrix 180 rows 238 cols
[2022-05-16 14:50:46] [INFO ] Computed 61 place invariants in 9 ms
[2022-05-16 14:50:46] [INFO ] Implicit Places using invariants in 259 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 262 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 237/243 places, 180/187 transitions.
Applied a total of 0 rules in 19 ms. Remains 237 /237 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 237/243 places, 180/187 transitions.
Stuttering acceptance computed with spot in 454 ms :[true, (NOT p0), (OR (NOT p0) p1), (NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s29 1), p1:(AND (EQ s35 1) (EQ s200 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DES-PT-01b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-00 finished in 886 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))&&p1)))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 187/187 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 239 transition count 183
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 239 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 239 transition count 182
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 238 transition count 181
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 238 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 238 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 237 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 237 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 237 transition count 178
Applied a total of 15 rules in 33 ms. Remains 237 /243 variables (removed 6) and now considering 178/187 (removed 9) transitions.
// Phase 1: matrix 178 rows 237 cols
[2022-05-16 14:50:46] [INFO ] Computed 61 place invariants in 4 ms
[2022-05-16 14:50:47] [INFO ] Implicit Places using invariants in 266 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 268 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 236/243 places, 178/187 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 236/243 places, 178/187 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s127 1) (NEQ s156 1)), p0:(EQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, 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 8837 reset in 597 ms.
Product exploration explored 100000 steps with 8732 reset in 384 ms.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 416 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Detected a total of 51/236 stabilizing places and 47/178 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 326 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 338 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
// Phase 1: matrix 178 rows 236 cols
[2022-05-16 14:50:49] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-16 14:50:49] [INFO ] [Real]Absence check using 33 positive place invariants in 20 ms returned sat
[2022-05-16 14:50:49] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 43 ms returned sat
[2022-05-16 14:50:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:50:49] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2022-05-16 14:50:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:50:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 23 ms returned sat
[2022-05-16 14:50:50] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 36 ms returned sat
[2022-05-16 14:50:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:50:50] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2022-05-16 14:50:50] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 5 ms to minimize.
[2022-05-16 14:50:50] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2022-05-16 14:50:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 326 ms
[2022-05-16 14:50:51] [INFO ] Computed and/alt/rep : 176/289/176 causal constraints (skipped 1 transitions) in 34 ms.
[2022-05-16 14:50:52] [INFO ] Added : 125 causal constraints over 25 iterations in 1335 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 236 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 178/178 transitions.
Graph (complete) has 416 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 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 230 transition count 156
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 212 transition count 156
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 37 place count 212 transition count 143
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 63 place count 199 transition count 143
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 205 place count 128 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 209 place count 126 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 211 place count 124 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 212 place count 123 transition count 72
Applied a total of 212 rules in 78 ms. Remains 123 /236 variables (removed 113) and now considering 72/178 (removed 106) transitions.
// Phase 1: matrix 72 rows 123 cols
[2022-05-16 14:50:52] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-16 14:50:52] [INFO ] Implicit Places using invariants in 211 ms returned []
// Phase 1: matrix 72 rows 123 cols
[2022-05-16 14:50:52] [INFO ] Computed 57 place invariants in 7 ms
[2022-05-16 14:50:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 14:50:52] [INFO ] Implicit Places using invariants and state equation in 319 ms returned [7, 31, 35, 36, 40, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 97, 118]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 536 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/236 places, 72/178 transitions.
Graph (complete) has 250 edges and 105 vertex of which 103 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 101 transition count 61
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 19 rules applied. Total rules applied 20 place count 90 transition count 61
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 54 place count 67 transition count 50
Applied a total of 54 rules in 25 ms. Remains 67 /105 variables (removed 38) and now considering 50/72 (removed 22) transitions.
// Phase 1: matrix 50 rows 67 cols
[2022-05-16 14:50:53] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 14:50:53] [INFO ] Implicit Places using invariants in 109 ms returned [37, 41, 44, 47, 53, 56]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 113 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/236 places, 50/178 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 60 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 60 transition count 48
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 4 place count 59 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 58 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 58 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 57 transition count 45
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 57 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 55 transition count 43
Applied a total of 12 rules in 25 ms. Remains 55 /61 variables (removed 6) and now considering 43/50 (removed 7) transitions.
// Phase 1: matrix 43 rows 55 cols
[2022-05-16 14:50:53] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 14:50:53] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 43 rows 55 cols
[2022-05-16 14:50:53] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 14:50:53] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 55/236 places, 43/178 transitions.
Finished structural reductions, in 3 iterations. Remains : 55/236 places, 43/178 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Detected a total of 5/55 stabilizing places and 5/43 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 222 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
// Phase 1: matrix 43 rows 55 cols
[2022-05-16 14:50:53] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 14:50:53] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-05-16 14:50:54] [INFO ] [Real]Absence check using 10 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-16 14:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:50:54] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2022-05-16 14:50:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:50:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-05-16 14:50:54] [INFO ] [Nat]Absence check using 10 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-16 14:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:50:54] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-05-16 14:50:54] [INFO ] Computed and/alt/rep : 33/132/33 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 14:50:54] [INFO ] Added : 17 causal constraints over 4 iterations in 68 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19771 reset in 382 ms.
Product exploration explored 100000 steps with 19813 reset in 608 ms.
Built C files in :
/tmp/ltsmin14710793714354035224
[2022-05-16 14:50:55] [INFO ] Computing symmetric may disable matrix : 43 transitions.
[2022-05-16 14:50:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:50:55] [INFO ] Computing symmetric may enable matrix : 43 transitions.
[2022-05-16 14:50:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:50:55] [INFO ] Computing Do-Not-Accords matrix : 43 transitions.
[2022-05-16 14:50:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:50:55] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14710793714354035224
Running compilation step : cd /tmp/ltsmin14710793714354035224;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 379 ms.
Running link step : cd /tmp/ltsmin14710793714354035224;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin14710793714354035224;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9456131461007137163.hoa' '--buchi-type=spotba'
LTSmin run took 140 ms.
FORMULA DES-PT-01b-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLFireability-02 finished in 9138 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(F(p0) U G(X(p1))))&&X(p2)))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 187/187 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 239 transition count 183
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 239 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 239 transition count 182
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 238 transition count 181
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 238 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 238 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 237 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 237 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 237 transition count 178
Applied a total of 15 rules in 28 ms. Remains 237 /243 variables (removed 6) and now considering 178/187 (removed 9) transitions.
// Phase 1: matrix 178 rows 237 cols
[2022-05-16 14:50:56] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 14:50:56] [INFO ] Implicit Places using invariants in 325 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 326 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 236/243 places, 178/187 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 236/243 places, 178/187 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1, false, (AND p1 p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(AND p2 p0), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s35 0), p0:(AND (EQ s68 1) (EQ s70 1)), p1:(NEQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 44534 steps with 667 reset in 193 ms.
FORMULA DES-PT-01b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-03 finished in 895 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 187/187 transitions.
Graph (complete) has 431 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 238 transition count 165
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 219 transition count 165
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 39 place count 219 transition count 153
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 63 place count 207 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 205 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 205 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 205 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 68 place count 205 transition count 149
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 70 place count 204 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 203 transition count 148
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 203 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 203 transition count 146
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 76 place count 202 transition count 145
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 228 place count 126 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 232 place count 124 transition count 71
Applied a total of 232 rules in 87 ms. Remains 124 /243 variables (removed 119) and now considering 71/187 (removed 116) transitions.
// Phase 1: matrix 71 rows 124 cols
[2022-05-16 14:50:56] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 14:50:57] [INFO ] Implicit Places using invariants in 222 ms returned [2, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 225 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/243 places, 71/187 transitions.
Applied a total of 0 rules in 19 ms. Remains 122 /122 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 122/243 places, 71/187 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 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]]
Product exploration explored 100000 steps with 50000 reset in 849 ms.
Product exploration explored 100000 steps with 50000 reset in 822 ms.
Computed a total of 15 stabilizing places and 12 stable transitions
Computed a total of 15 stabilizing places and 12 stable transitions
Detected a total of 15/122 stabilizing places and 12/71 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DES-PT-01b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-01b-LTLFireability-04 finished in 2199 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&F(G(X(G(p1))))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 187/187 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 240 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 240 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 240 transition count 183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 239 transition count 182
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 239 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 239 transition count 181
Applied a total of 10 rules in 14 ms. Remains 239 /243 variables (removed 4) and now considering 181/187 (removed 6) transitions.
// Phase 1: matrix 181 rows 239 cols
[2022-05-16 14:50:59] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 14:50:59] [INFO ] Implicit Places using invariants in 303 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 304 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 238/243 places, 181/187 transitions.
Applied a total of 0 rules in 7 ms. Remains 238 /238 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 238/243 places, 181/187 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-01b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s206 0), p1:(OR (EQ s155 0) (EQ s185 0) (EQ s28 0))], nbAcceptance=1, 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 1010 reset in 520 ms.
Product exploration explored 100000 steps with 1002 reset in 216 ms.
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 419 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 52 stabilizing places and 48 stable transitions
Detected a total of 52/238 stabilizing places and 48/181 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 233 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 100 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Finished Best-First random walk after 9203 steps, including 14 resets, run visited all 1 properties in 23 ms. (steps per millisecond=400 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 284 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Support contains 3 out of 238 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 181/181 transitions.
Graph (complete) has 419 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 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 232 transition count 159
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 214 transition count 159
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 37 place count 214 transition count 146
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 63 place count 201 transition count 146
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 205 place count 130 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 207 place count 129 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 209 place count 127 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 211 place count 125 transition count 73
Applied a total of 211 rules in 59 ms. Remains 125 /238 variables (removed 113) and now considering 73/181 (removed 108) transitions.
// Phase 1: matrix 73 rows 125 cols
[2022-05-16 14:51:01] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-16 14:51:01] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 73 rows 125 cols
[2022-05-16 14:51:01] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-16 14:51:01] [INFO ] Implicit Places using invariants and state equation in 285 ms returned [7, 31, 35, 39, 43, 45, 47, 49, 51, 53, 55, 57, 71, 73, 75, 98, 120]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 474 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/238 places, 73/181 transitions.
Graph (complete) has 248 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 104 transition count 65
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 99 transition count 65
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 39 place count 83 transition count 53
Applied a total of 39 rules in 15 ms. Remains 83 /108 variables (removed 25) and now considering 53/73 (removed 20) transitions.
// Phase 1: matrix 53 rows 83 cols
[2022-05-16 14:51:01] [INFO ] Computed 34 place invariants in 3 ms
[2022-05-16 14:51:01] [INFO ] Implicit Places using invariants in 123 ms returned [47, 59, 62, 69, 72]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 124 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/238 places, 53/181 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 78 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 77 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 76 transition count 51
Applied a total of 4 rules in 7 ms. Remains 76 /78 variables (removed 2) and now considering 51/53 (removed 2) transitions.
// Phase 1: matrix 51 rows 76 cols
[2022-05-16 14:51:01] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-16 14:51:01] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 51 rows 76 cols
[2022-05-16 14:51:01] [INFO ] Computed 29 place invariants in 2 ms
[2022-05-16 14:51:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 14:51:02] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 76/238 places, 51/181 transitions.
Finished structural reductions, in 3 iterations. Remains : 76/238 places, 51/181 transitions.
Computed a total of 11 stabilizing places and 8 stable transitions
Computed a total of 11 stabilizing places and 8 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 53 ms :[(NOT p1)]
Finished random walk after 5566 steps, including 411 resets, run visited all 1 properties in 77 ms. (steps per millisecond=72 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Product exploration explored 100000 steps with 7220 reset in 307 ms.
Product exploration explored 100000 steps with 7199 reset in 351 ms.
Built C files in :
/tmp/ltsmin17994056001687335487
[2022-05-16 14:51:03] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2022-05-16 14:51:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:51:03] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2022-05-16 14:51:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:51:03] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2022-05-16 14:51:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:51:03] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17994056001687335487
Running compilation step : cd /tmp/ltsmin17994056001687335487;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 305 ms.
Running link step : cd /tmp/ltsmin17994056001687335487;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17994056001687335487;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1392668405772383139.hoa' '--buchi-type=spotba'
LTSmin run took 896 ms.
FORMULA DES-PT-01b-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLFireability-06 finished in 5728 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!F(G(p0))||p1) U p2))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 187/187 transitions.
Graph (complete) has 431 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 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 238 transition count 166
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 220 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 219 transition count 165
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 39 place count 219 transition count 154
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 61 place count 208 transition count 154
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 63 place count 206 transition count 152
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 206 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 206 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 66 place count 206 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 68 place count 205 transition count 150
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 204 transition count 149
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 204 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 72 place count 204 transition count 147
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 74 place count 203 transition count 146
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 6 with 144 rules applied. Total rules applied 218 place count 131 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 222 place count 129 transition count 76
Applied a total of 222 rules in 39 ms. Remains 129 /243 variables (removed 114) and now considering 76/187 (removed 111) transitions.
// Phase 1: matrix 76 rows 129 cols
[2022-05-16 14:51:04] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 14:51:04] [INFO ] Implicit Places using invariants in 146 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 147 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/243 places, 76/187 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 128/243 places, 76/187 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p2), p0, p0]
Running random walk in product with property : DES-PT-01b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NEQ s1 1) (EQ s100 1) (EQ s113 1)), p1:(EQ s1 1), p0:(OR (AND (EQ s3 1) (EQ s38 1)) (AND (EQ s100 1) (EQ s113 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 58344 steps with 3703 reset in 235 ms.
FORMULA DES-PT-01b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-07 finished in 570 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!F(X(F(X(p0))))||p0) U (F(p0)&&p1)))'
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 187/187 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 239 transition count 183
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 239 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 239 transition count 182
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 238 transition count 181
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 238 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 238 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 237 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 237 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 237 transition count 178
Applied a total of 15 rules in 22 ms. Remains 237 /243 variables (removed 6) and now considering 178/187 (removed 9) transitions.
// Phase 1: matrix 178 rows 237 cols
[2022-05-16 14:51:05] [INFO ] Computed 61 place invariants in 4 ms
[2022-05-16 14:51:05] [INFO ] Implicit Places using invariants in 291 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 293 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 236/243 places, 178/187 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 236/243 places, 178/187 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, p0, true]
Running random walk in product with property : DES-PT-01b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s170 1), p1:(EQ s115 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-09 finished in 587 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!X(p0)) U (G(p1) U !p0))))'
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 187/187 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 239 transition count 183
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 239 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 239 transition count 182
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 238 transition count 181
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 238 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 238 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 237 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 237 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 237 transition count 178
Applied a total of 15 rules in 22 ms. Remains 237 /243 variables (removed 6) and now considering 178/187 (removed 9) transitions.
// Phase 1: matrix 178 rows 237 cols
[2022-05-16 14:51:05] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 14:51:06] [INFO ] Implicit Places using invariants in 283 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 285 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 236/243 places, 178/187 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 236/243 places, 178/187 transitions.
Stuttering acceptance computed with spot in 365 ms :[p0, p0, p0, (AND p0 (NOT p1)), p0, true, (NOT p1)]
Running random walk in product with property : DES-PT-01b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(NEQ s24 1), p1:(EQ s225 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-10 finished in 709 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((X((F(p0)||p1))||p2)))))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 187/187 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 240 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 240 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 240 transition count 183
Applied a total of 7 rules in 10 ms. Remains 240 /243 variables (removed 3) and now considering 183/187 (removed 4) transitions.
// Phase 1: matrix 183 rows 240 cols
[2022-05-16 14:51:06] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 14:51:06] [INFO ] Implicit Places using invariants in 289 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 291 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 239/243 places, 183/187 transitions.
Applied a total of 0 rules in 4 ms. Remains 239 /239 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 239/243 places, 183/187 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-01b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s112 1), p1:(EQ s143 1), p0:(EQ s26 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33199 reset in 266 ms.
Product exploration explored 100000 steps with 33183 reset in 287 ms.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 423 edges and 239 vertex of which 234 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Detected a total of 51/239 stabilizing places and 47/183 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 777 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Finished random walk after 5802 steps, including 56 resets, run visited all 5 properties in 141 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 9 factoid took 662 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 183/183 transitions.
Graph (complete) has 423 edges and 239 vertex of which 234 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 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 233 transition count 161
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 215 transition count 161
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 215 transition count 149
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 61 place count 203 transition count 149
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 205 place count 131 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 206 place count 131 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 210 place count 129 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 212 place count 127 transition count 79
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 214 place count 125 transition count 79
Applied a total of 214 rules in 44 ms. Remains 125 /239 variables (removed 114) and now considering 79/183 (removed 104) transitions.
// Phase 1: matrix 79 rows 125 cols
[2022-05-16 14:51:09] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-16 14:51:10] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 79 rows 125 cols
[2022-05-16 14:51:10] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-16 14:51:10] [INFO ] Implicit Places using invariants and state equation in 402 ms returned [7, 31, 35, 39, 45, 47, 49, 51, 53, 55, 57, 59, 99, 120]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 649 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/239 places, 79/183 transitions.
Graph (complete) has 272 edges and 111 vertex of which 109 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 107 transition count 74
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 105 transition count 74
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 29 place count 93 transition count 62
Applied a total of 29 rules in 11 ms. Remains 93 /111 variables (removed 18) and now considering 62/79 (removed 17) transitions.
// Phase 1: matrix 62 rows 93 cols
[2022-05-16 14:51:10] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-16 14:51:10] [INFO ] Implicit Places using invariants in 190 ms returned [73, 79, 82]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 192 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/239 places, 62/183 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 88 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 88 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 87 transition count 58
Applied a total of 6 rules in 8 ms. Remains 87 /90 variables (removed 3) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 87 cols
[2022-05-16 14:51:10] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-16 14:51:10] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 58 rows 87 cols
[2022-05-16 14:51:10] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-16 14:51:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 14:51:11] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 87/239 places, 58/183 transitions.
Finished structural reductions, in 3 iterations. Remains : 87/239 places, 58/183 transitions.
Computed a total of 15 stabilizing places and 7 stable transitions
Computed a total of 15 stabilizing places and 7 stable transitions
Detected a total of 15/87 stabilizing places and 7/58 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 10 factoid took 657 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Finished random walk after 134 steps, including 8 resets, run visited all 5 properties in 7 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 10 factoid took 789 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 28593 reset in 468 ms.
Product exploration explored 100000 steps with 28419 reset in 508 ms.
Built C files in :
/tmp/ltsmin4124545752170960419
[2022-05-16 14:51:14] [INFO ] Computing symmetric may disable matrix : 58 transitions.
[2022-05-16 14:51:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:51:14] [INFO ] Computing symmetric may enable matrix : 58 transitions.
[2022-05-16 14:51:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:51:14] [INFO ] Computing Do-Not-Accords matrix : 58 transitions.
[2022-05-16 14:51:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:51:14] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4124545752170960419
Running compilation step : cd /tmp/ltsmin4124545752170960419;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 359 ms.
Running link step : cd /tmp/ltsmin4124545752170960419;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4124545752170960419;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10819001263558868153.hoa' '--buchi-type=spotba'
LTSmin run took 5909 ms.
FORMULA DES-PT-01b-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLFireability-11 finished in 13844 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 187/187 transitions.
Graph (complete) has 431 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 237 transition count 166
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 220 transition count 166
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 220 transition count 154
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 208 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 206 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 206 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 206 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 64 place count 206 transition count 150
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 66 place count 205 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 204 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 204 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 204 transition count 147
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 72 place count 203 transition count 146
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 222 place count 128 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 226 place count 126 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 228 place count 124 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 230 place count 122 transition count 71
Applied a total of 230 rules in 24 ms. Remains 122 /243 variables (removed 121) and now considering 71/187 (removed 116) transitions.
// Phase 1: matrix 71 rows 122 cols
[2022-05-16 14:51:20] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-16 14:51:20] [INFO ] Implicit Places using invariants in 140 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/243 places, 71/187 transitions.
Applied a total of 0 rules in 10 ms. Remains 121 /121 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 121/243 places, 71/187 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s30 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 9 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-12 finished in 241 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U ((F(p0)&&p1) U X(!p2))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 187/187 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 240 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 240 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 240 transition count 183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 239 transition count 182
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 239 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 239 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 238 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 238 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 238 transition count 179
Applied a total of 13 rules in 16 ms. Remains 238 /243 variables (removed 5) and now considering 179/187 (removed 8) transitions.
// Phase 1: matrix 179 rows 238 cols
[2022-05-16 14:51:20] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 14:51:21] [INFO ] Implicit Places using invariants in 278 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 279 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 237/243 places, 179/187 transitions.
Applied a total of 0 rules in 5 ms. Remains 237 /237 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 237/243 places, 179/187 transitions.
Stuttering acceptance computed with spot in 435 ms :[p2, p2, (AND (NOT p0) p2), p2, (AND (NOT p0) p2), p2, true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=p2, acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 6}, { cond=(AND p0 p2), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=3 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(EQ s210 1), p0:(EQ s173 1), p2:(OR (EQ s61 1) (EQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 373 ms.
Product exploration explored 100000 steps with 50000 reset in 393 ms.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 417 edges and 237 vertex of which 232 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 p2))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 19 factoid took 477 ms. Reduced automaton from 9 states, 21 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DES-PT-01b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-01b-LTLFireability-13 finished in 2016 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(F(p0))||X(p1)))))'
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 187/187 transitions.
Graph (complete) has 431 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 237 transition count 164
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 218 transition count 164
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 39 place count 218 transition count 152
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 63 place count 206 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 204 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 204 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 204 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 68 place count 204 transition count 148
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 70 place count 203 transition count 148
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 202 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 202 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 202 transition count 145
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 76 place count 201 transition count 144
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 220 place count 129 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 224 place count 127 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 125 transition count 72
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 228 place count 123 transition count 72
Applied a total of 228 rules in 35 ms. Remains 123 /243 variables (removed 120) and now considering 72/187 (removed 115) transitions.
// Phase 1: matrix 72 rows 123 cols
[2022-05-16 14:51:22] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-16 14:51:23] [INFO ] Implicit Places using invariants in 238 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 240 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/243 places, 72/187 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 122/243 places, 72/187 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-01b-LTLFireability-15 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 s20 0), p0:(EQ s59 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 6793 reset in 353 ms.
Product exploration explored 100000 steps with 6731 reset in 326 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Detected a total of 14/122 stabilizing places and 12/72 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 249 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 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 22 steps, including 1 resets, run visited all 2 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 4 factoid took 301 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 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 122 cols
[2022-05-16 14:51:24] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-16 14:51:24] [INFO ] Implicit Places using invariants in 223 ms returned []
// Phase 1: matrix 72 rows 122 cols
[2022-05-16 14:51:24] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-16 14:51:25] [INFO ] Implicit Places using invariants and state equation in 283 ms returned [7, 30, 34, 38, 42, 44, 46, 48, 50, 52, 54, 56, 70, 72, 74, 96, 117]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 508 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/122 places, 72/72 transitions.
Graph (complete) has 247 edges and 105 vertex of which 103 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 101 transition count 64
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 96 transition count 64
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 39 place count 80 transition count 52
Applied a total of 39 rules in 7 ms. Remains 80 /105 variables (removed 25) and now considering 52/72 (removed 20) transitions.
// Phase 1: matrix 52 rows 80 cols
[2022-05-16 14:51:25] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-16 14:51:25] [INFO ] Implicit Places using invariants in 119 ms returned [46, 57, 60, 66, 69]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 120 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/122 places, 52/72 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 74 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 74 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 73 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 73 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 72 transition count 48
Applied a total of 6 rules in 6 ms. Remains 72 /75 variables (removed 3) and now considering 48/52 (removed 4) transitions.
// Phase 1: matrix 48 rows 72 cols
[2022-05-16 14:51:25] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-16 14:51:25] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 48 rows 72 cols
[2022-05-16 14:51:25] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-16 14:51:25] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-16 14:51:25] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 72/122 places, 48/72 transitions.
Finished structural reductions, in 3 iterations. Remains : 72/122 places, 48/72 transitions.
Computed a total of 10 stabilizing places and 5 stable transitions
Computed a total of 10 stabilizing places and 5 stable transitions
Detected a total of 10/72 stabilizing places and 5/48 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 329 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 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 4 factoid took 347 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 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 8773 reset in 309 ms.
Product exploration explored 100000 steps with 8817 reset in 357 ms.
Built C files in :
/tmp/ltsmin13841365543256581995
[2022-05-16 14:51:27] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2022-05-16 14:51:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:51:27] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2022-05-16 14:51:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:51:27] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2022-05-16 14:51:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:51:27] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13841365543256581995
Running compilation step : cd /tmp/ltsmin13841365543256581995;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 319 ms.
Running link step : cd /tmp/ltsmin13841365543256581995;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin13841365543256581995;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15069773230474610396.hoa' '--buchi-type=spotba'
LTSmin run took 4997 ms.
FORMULA DES-PT-01b-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLFireability-15 finished in 10066 ms.
All properties solved by simple procedures.
Total runtime 50979 ms.

BK_STOP 1652712693010

--------------------
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="DES-PT-01b"
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 DES-PT-01b, 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 r042-smll-165252095700412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-01b.tgz
mv DES-PT-01b 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;