Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r039-tajo-167813692700572.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is BusinessProcesses-PT-16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692700572
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.8K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 159K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678503451304

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:57:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 02:57:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:57:33] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-11 02:57:33] [INFO ] Transformed 638 places.
[2023-03-11 02:57:33] [INFO ] Transformed 578 transitions.
[2023-03-11 02:57:33] [INFO ] Found NUPN structural information;
[2023-03-11 02:57:33] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 91 places :
Symmetric choice reduction at 1 with 91 rule applications. Total rules 96 place count 534 transition count 479
Iterating global reduction 1 with 91 rules applied. Total rules applied 187 place count 534 transition count 479
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 238 place count 483 transition count 428
Iterating global reduction 1 with 51 rules applied. Total rules applied 289 place count 483 transition count 428
Applied a total of 289 rules in 104 ms. Remains 483 /630 variables (removed 147) and now considering 428/570 (removed 142) transitions.
// Phase 1: matrix 428 rows 483 cols
[2023-03-11 02:57:33] [INFO ] Computed 95 place invariants in 27 ms
[2023-03-11 02:57:33] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-11 02:57:33] [INFO ] Invariant cache hit.
[2023-03-11 02:57:34] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
[2023-03-11 02:57:34] [INFO ] Invariant cache hit.
[2023-03-11 02:57:34] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/630 places, 428/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1215 ms. Remains : 483/630 places, 428/570 transitions.
Support contains 36 out of 483 places after structural reductions.
[2023-03-11 02:57:34] [INFO ] Flatten gal took : 60 ms
[2023-03-11 02:57:34] [INFO ] Flatten gal took : 23 ms
[2023-03-11 02:57:34] [INFO ] Input system was already deterministic with 428 transitions.
Support contains 34 out of 483 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 31) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-11 02:57:35] [INFO ] Invariant cache hit.
[2023-03-11 02:57:35] [INFO ] [Real]Absence check using 56 positive place invariants in 16 ms returned sat
[2023-03-11 02:57:35] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 12 ms returned sat
[2023-03-11 02:57:36] [INFO ] After 482ms SMT Verify possible using state equation in real domain returned unsat :2 sat :17 real:1
[2023-03-11 02:57:36] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 4 ms to minimize.
[2023-03-11 02:57:36] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2023-03-11 02:57:36] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2023-03-11 02:57:36] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2023-03-11 02:57:37] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2023-03-11 02:57:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 547 ms
[2023-03-11 02:57:37] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2023-03-11 02:57:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-11 02:57:37] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2023-03-11 02:57:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-03-11 02:57:37] [INFO ] Deduced a trap composed of 82 places in 165 ms of which 1 ms to minimize.
[2023-03-11 02:57:37] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2023-03-11 02:57:37] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2023-03-11 02:57:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 330 ms
[2023-03-11 02:57:38] [INFO ] After 2119ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:18
[2023-03-11 02:57:38] [INFO ] After 2532ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:18
[2023-03-11 02:57:38] [INFO ] [Nat]Absence check using 56 positive place invariants in 16 ms returned sat
[2023-03-11 02:57:38] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 12 ms returned sat
[2023-03-11 02:57:38] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :18
[2023-03-11 02:57:39] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2023-03-11 02:57:39] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2023-03-11 02:57:39] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 0 ms to minimize.
[2023-03-11 02:57:39] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2023-03-11 02:57:39] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 0 ms to minimize.
[2023-03-11 02:57:39] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 0 ms to minimize.
[2023-03-11 02:57:39] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2023-03-11 02:57:39] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 0 ms to minimize.
[2023-03-11 02:57:39] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 0 ms to minimize.
[2023-03-11 02:57:39] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2023-03-11 02:57:39] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2023-03-11 02:57:39] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 997 ms
[2023-03-11 02:57:40] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 0 ms to minimize.
[2023-03-11 02:57:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-11 02:57:40] [INFO ] After 2042ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :18
Attempting to minimize the solution found.
Minimization took 325 ms.
[2023-03-11 02:57:40] [INFO ] After 2729ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :18
Fused 20 Parikh solutions to 16 different solutions.
Parikh walk visited 4 properties in 249 ms.
Support contains 15 out of 483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 428/428 transitions.
Graph (trivial) has 213 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1086 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 477 transition count 369
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 426 transition count 369
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 104 place count 426 transition count 273
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 311 place count 315 transition count 273
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 317 place count 309 transition count 267
Ensure Unique test removed 1 places
Iterating global reduction 2 with 7 rules applied. Total rules applied 324 place count 308 transition count 267
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 564 place count 186 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 566 place count 185 transition count 153
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 568 place count 185 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 570 place count 183 transition count 151
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 571 place count 183 transition count 151
Applied a total of 571 rules in 76 ms. Remains 183 /483 variables (removed 300) and now considering 151/428 (removed 277) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 183/483 places, 151/428 transitions.
Incomplete random walk after 10000 steps, including 331 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :13
Finished Best-First random walk after 128 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=64 )
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-16-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 130 stabilizing places and 123 stable transitions
Graph (complete) has 1093 edges and 483 vertex of which 482 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1&&(p2 U p3)))))))'
Support contains 4 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Graph (trivial) has 221 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1087 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 476 transition count 367
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 423 transition count 367
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 108 place count 423 transition count 270
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 318 place count 310 transition count 270
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 324 place count 304 transition count 264
Ensure Unique test removed 1 places
Iterating global reduction 2 with 7 rules applied. Total rules applied 331 place count 303 transition count 264
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 585 place count 174 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 587 place count 173 transition count 143
Applied a total of 587 rules in 48 ms. Remains 173 /483 variables (removed 310) and now considering 143/428 (removed 285) transitions.
// Phase 1: matrix 143 rows 173 cols
[2023-03-11 02:57:41] [INFO ] Computed 74 place invariants in 3 ms
[2023-03-11 02:57:41] [INFO ] Implicit Places using invariants in 138 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51, 52]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 140 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/483 places, 143/428 transitions.
Applied a total of 0 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 195 ms. Remains : 152/483 places, 143/428 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (OR (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s76 1), p1:(EQ s118 1), p3:(EQ s48 1), p2:(EQ s62 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-00 finished in 576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p1) U p2)))'
Support contains 3 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Graph (trivial) has 227 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 477 transition count 365
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 421 transition count 365
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 113 place count 421 transition count 265
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 330 place count 304 transition count 265
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 339 place count 295 transition count 256
Ensure Unique test removed 1 places
Iterating global reduction 2 with 10 rules applied. Total rules applied 349 place count 294 transition count 256
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 593 place count 170 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 595 place count 169 transition count 140
Applied a total of 595 rules in 45 ms. Remains 169 /483 variables (removed 314) and now considering 140/428 (removed 288) transitions.
// Phase 1: matrix 140 rows 169 cols
[2023-03-11 02:57:42] [INFO ] Computed 73 place invariants in 2 ms
[2023-03-11 02:57:42] [INFO ] Implicit Places using invariants in 122 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 48, 49, 50, 51, 52]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 124 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/483 places, 140/428 transitions.
Applied a total of 0 rules in 7 ms. Remains 149 /149 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 176 ms. Remains : 149/483 places, 140/428 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p1:(NEQ s34 1), p2:(EQ s36 1), p0:(NEQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-01 finished in 314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&((F(p1) U p2) U (G((F(p1) U p2))||(p3&&(F(p1) U p2))))))'
Support contains 3 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 472 transition count 417
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 471 transition count 416
Applied a total of 24 rules in 37 ms. Remains 471 /483 variables (removed 12) and now considering 416/428 (removed 12) transitions.
// Phase 1: matrix 416 rows 471 cols
[2023-03-11 02:57:42] [INFO ] Computed 95 place invariants in 4 ms
[2023-03-11 02:57:42] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-11 02:57:42] [INFO ] Invariant cache hit.
[2023-03-11 02:57:43] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2023-03-11 02:57:43] [INFO ] Invariant cache hit.
[2023-03-11 02:57:43] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/483 places, 416/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 910 ms. Remains : 471/483 places, 416/428 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(NOT p3), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(NOT p3), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s299 1), p1:(EQ s443 1), p3:(NEQ s335 1), p0:(EQ s299 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 97 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-02 finished in 1140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Graph (trivial) has 225 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1087 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 476 transition count 365
Reduce places removed 55 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 421 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 420 transition count 364
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 114 place count 420 transition count 263
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 333 place count 302 transition count 263
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 340 place count 295 transition count 256
Ensure Unique test removed 1 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 348 place count 294 transition count 256
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 592 place count 170 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 594 place count 169 transition count 140
Applied a total of 594 rules in 50 ms. Remains 169 /483 variables (removed 314) and now considering 140/428 (removed 288) transitions.
// Phase 1: matrix 140 rows 169 cols
[2023-03-11 02:57:43] [INFO ] Computed 73 place invariants in 1 ms
[2023-03-11 02:57:43] [INFO ] Implicit Places using invariants in 105 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 107 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/483 places, 140/428 transitions.
Applied a total of 0 rules in 5 ms. Remains 149 /149 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 163 ms. Remains : 149/483 places, 140/428 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s114 1) (EQ s82 0) (EQ s109 0)), p1:(NEQ s82 1)], nbAcceptance=2, 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 20 steps with 3 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-05 finished in 211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p0)))||F(p1))))'
Support contains 2 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 474 transition count 419
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 474 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 473 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 473 transition count 418
Applied a total of 20 rules in 22 ms. Remains 473 /483 variables (removed 10) and now considering 418/428 (removed 10) transitions.
// Phase 1: matrix 418 rows 473 cols
[2023-03-11 02:57:43] [INFO ] Computed 95 place invariants in 4 ms
[2023-03-11 02:57:44] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-11 02:57:44] [INFO ] Invariant cache hit.
[2023-03-11 02:57:44] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
[2023-03-11 02:57:44] [INFO ] Invariant cache hit.
[2023-03-11 02:57:44] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/483 places, 418/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 799 ms. Remains : 473/483 places, 418/428 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s325 1), p0:(AND (EQ s325 1) (EQ s143 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 142 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-06 finished in 973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)||(p1&&G(F(p2)))))))'
Support contains 3 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 473 transition count 418
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 473 transition count 418
Applied a total of 20 rules in 18 ms. Remains 473 /483 variables (removed 10) and now considering 418/428 (removed 10) transitions.
// Phase 1: matrix 418 rows 473 cols
[2023-03-11 02:57:44] [INFO ] Computed 95 place invariants in 5 ms
[2023-03-11 02:57:45] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-11 02:57:45] [INFO ] Invariant cache hit.
[2023-03-11 02:57:45] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2023-03-11 02:57:45] [INFO ] Invariant cache hit.
[2023-03-11 02:57:45] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/483 places, 418/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 807 ms. Remains : 473/483 places, 418/428 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(EQ s411 1), p1:(NEQ s67 1), p2:(NEQ s31 1)], 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 666 reset in 313 ms.
Product exploration explored 100000 steps with 666 reset in 323 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1083 edges and 473 vertex of which 472 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 286 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1032903 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 1032903 steps, saw 156152 distinct states, run finished after 3005 ms. (steps per millisecond=343 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-11 02:57:50] [INFO ] Invariant cache hit.
[2023-03-11 02:57:50] [INFO ] [Real]Absence check using 56 positive place invariants in 15 ms returned sat
[2023-03-11 02:57:50] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 14 ms returned sat
[2023-03-11 02:57:50] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:57:50] [INFO ] [Nat]Absence check using 56 positive place invariants in 15 ms returned sat
[2023-03-11 02:57:50] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 14 ms returned sat
[2023-03-11 02:57:50] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:57:50] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 0 ms to minimize.
[2023-03-11 02:57:51] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 0 ms to minimize.
[2023-03-11 02:57:51] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2023-03-11 02:57:51] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2023-03-11 02:57:51] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2023-03-11 02:57:51] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2023-03-11 02:57:51] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2023-03-11 02:57:51] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2023-03-11 02:57:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 643 ms
[2023-03-11 02:57:51] [INFO ] After 804ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-11 02:57:51] [INFO ] After 921ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 418/418 transitions.
Graph (trivial) has 212 edges and 473 vertex of which 6 / 473 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1076 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 467 transition count 365
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 422 transition count 365
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 92 place count 422 transition count 264
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 311 place count 304 transition count 264
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 570 place count 172 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 572 place count 171 transition count 141
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 574 place count 171 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 576 place count 169 transition count 139
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 577 place count 169 transition count 139
Applied a total of 577 rules in 39 ms. Remains 169 /473 variables (removed 304) and now considering 139/418 (removed 279) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 169/473 places, 139/418 transitions.
Incomplete random walk after 10000 steps, including 405 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Finished Best-First random walk after 172 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=86 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) p1)), (F p0), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 317 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 3 out of 473 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 473/473 places, 418/418 transitions.
Applied a total of 0 rules in 5 ms. Remains 473 /473 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2023-03-11 02:57:52] [INFO ] Invariant cache hit.
[2023-03-11 02:57:52] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-11 02:57:52] [INFO ] Invariant cache hit.
[2023-03-11 02:57:52] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2023-03-11 02:57:52] [INFO ] Invariant cache hit.
[2023-03-11 02:57:52] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 744 ms. Remains : 473/473 places, 418/418 transitions.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1083 edges and 473 vertex of which 472 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 204 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1095901 steps, run timeout after 3001 ms. (steps per millisecond=365 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 1095901 steps, saw 163859 distinct states, run finished after 3001 ms. (steps per millisecond=365 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-11 02:57:56] [INFO ] Invariant cache hit.
[2023-03-11 02:57:56] [INFO ] [Real]Absence check using 56 positive place invariants in 15 ms returned sat
[2023-03-11 02:57:56] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 12 ms returned sat
[2023-03-11 02:57:56] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:57:56] [INFO ] [Nat]Absence check using 56 positive place invariants in 16 ms returned sat
[2023-03-11 02:57:56] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 14 ms returned sat
[2023-03-11 02:57:56] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:57:56] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2023-03-11 02:57:56] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 14 ms to minimize.
[2023-03-11 02:57:57] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 14 ms to minimize.
[2023-03-11 02:57:57] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2023-03-11 02:57:57] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2023-03-11 02:57:57] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 0 ms to minimize.
[2023-03-11 02:57:57] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2023-03-11 02:57:57] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 2 ms to minimize.
[2023-03-11 02:57:57] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 689 ms
[2023-03-11 02:57:57] [INFO ] After 869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-11 02:57:57] [INFO ] After 1008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 418/418 transitions.
Graph (trivial) has 212 edges and 473 vertex of which 6 / 473 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1076 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 467 transition count 365
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 422 transition count 365
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 92 place count 422 transition count 264
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 311 place count 304 transition count 264
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 570 place count 172 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 572 place count 171 transition count 141
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 574 place count 171 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 576 place count 169 transition count 139
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 577 place count 169 transition count 139
Applied a total of 577 rules in 47 ms. Remains 169 /473 variables (removed 304) and now considering 139/418 (removed 279) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 169/473 places, 139/418 transitions.
Incomplete random walk after 10000 steps, including 408 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Finished Best-First random walk after 114 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=114 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 481 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 667 reset in 162 ms.
Product exploration explored 100000 steps with 671 reset in 206 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 473 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 473/473 places, 418/418 transitions.
Graph (trivial) has 212 edges and 473 vertex of which 6 / 473 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1077 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 467 transition count 411
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 72 Pre rules applied. Total rules applied 46 place count 467 transition count 464
Deduced a syphon composed of 116 places in 1 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 118 place count 467 transition count 464
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 132 place count 453 transition count 438
Deduced a syphon composed of 102 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 146 place count 453 transition count 438
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 258 places in 0 ms
Iterating global reduction 1 with 156 rules applied. Total rules applied 302 place count 453 transition count 438
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 337 place count 418 transition count 403
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 372 place count 418 transition count 403
Deduced a syphon composed of 223 places in 0 ms
Applied a total of 372 rules in 109 ms. Remains 418 /473 variables (removed 55) and now considering 403/418 (removed 15) transitions.
[2023-03-11 02:57:59] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 403 rows 418 cols
[2023-03-11 02:57:59] [INFO ] Computed 95 place invariants in 15 ms
[2023-03-11 02:57:59] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 418/473 places, 403/418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 613 ms. Remains : 418/473 places, 403/418 transitions.
Support contains 3 out of 473 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 473/473 places, 418/418 transitions.
Applied a total of 0 rules in 8 ms. Remains 473 /473 variables (removed 0) and now considering 418/418 (removed 0) transitions.
// Phase 1: matrix 418 rows 473 cols
[2023-03-11 02:57:59] [INFO ] Computed 95 place invariants in 4 ms
[2023-03-11 02:57:59] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-11 02:57:59] [INFO ] Invariant cache hit.
[2023-03-11 02:58:00] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
[2023-03-11 02:58:00] [INFO ] Invariant cache hit.
[2023-03-11 02:58:00] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1286 ms. Remains : 473/473 places, 418/418 transitions.
Treatment of property BusinessProcesses-PT-16-LTLFireability-08 finished in 16139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&X((p2 U p0)))))'
Support contains 3 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 473 transition count 418
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 473 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 472 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 472 transition count 417
Applied a total of 22 rules in 24 ms. Remains 472 /483 variables (removed 11) and now considering 417/428 (removed 11) transitions.
// Phase 1: matrix 417 rows 472 cols
[2023-03-11 02:58:01] [INFO ] Computed 95 place invariants in 3 ms
[2023-03-11 02:58:02] [INFO ] Implicit Places using invariants in 1302 ms returned []
[2023-03-11 02:58:02] [INFO ] Invariant cache hit.
[2023-03-11 02:58:02] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 1833 ms to find 0 implicit places.
[2023-03-11 02:58:02] [INFO ] Invariant cache hit.
[2023-03-11 02:58:03] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/483 places, 417/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2078 ms. Remains : 472/483 places, 417/428 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s111 1), p0:(EQ s40 1), p2:(NEQ s206 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-09 finished in 2199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||F(p1)))&&F(p2)))'
Support contains 4 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 472 transition count 417
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 471 transition count 416
Applied a total of 24 rules in 16 ms. Remains 471 /483 variables (removed 12) and now considering 416/428 (removed 12) transitions.
// Phase 1: matrix 416 rows 471 cols
[2023-03-11 02:58:03] [INFO ] Computed 95 place invariants in 3 ms
[2023-03-11 02:58:03] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-11 02:58:03] [INFO ] Invariant cache hit.
[2023-03-11 02:58:03] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2023-03-11 02:58:03] [INFO ] Invariant cache hit.
[2023-03-11 02:58:04] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/483 places, 416/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 907 ms. Remains : 471/483 places, 416/428 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s48 1) (EQ s286 1) (EQ s392 1)), p0:(EQ s32 0), p1:(EQ s32 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 146 steps with 2 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-10 finished in 1124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p0)))))'
Support contains 1 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Graph (trivial) has 227 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1087 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 476 transition count 365
Reduce places removed 55 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 421 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 420 transition count 364
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 114 place count 420 transition count 264
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 330 place count 304 transition count 264
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 339 place count 295 transition count 255
Ensure Unique test removed 1 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 349 place count 294 transition count 255
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 597 place count 168 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 599 place count 167 transition count 137
Applied a total of 599 rules in 43 ms. Remains 167 /483 variables (removed 316) and now considering 137/428 (removed 291) transitions.
// Phase 1: matrix 137 rows 167 cols
[2023-03-11 02:58:04] [INFO ] Computed 74 place invariants in 1 ms
[2023-03-11 02:58:04] [INFO ] Implicit Places using invariants in 120 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 22, 23, 24, 25, 26, 49, 50, 51, 52, 53, 131]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 121 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/483 places, 137/428 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 168 ms. Remains : 146/483 places, 137/428 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-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 s11 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 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-12 finished in 265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 472 transition count 417
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 471 transition count 416
Applied a total of 24 rules in 25 ms. Remains 471 /483 variables (removed 12) and now considering 416/428 (removed 12) transitions.
// Phase 1: matrix 416 rows 471 cols
[2023-03-11 02:58:04] [INFO ] Computed 95 place invariants in 3 ms
[2023-03-11 02:58:04] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-11 02:58:04] [INFO ] Invariant cache hit.
[2023-03-11 02:58:05] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2023-03-11 02:58:05] [INFO ] Invariant cache hit.
[2023-03-11 02:58:05] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/483 places, 416/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 918 ms. Remains : 471/483 places, 416/428 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s114 0) (EQ s193 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-13 finished in 999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Graph (trivial) has 227 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1087 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 476 transition count 364
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 114 place count 420 transition count 364
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 114 place count 420 transition count 263
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 333 place count 302 transition count 263
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 341 place count 294 transition count 255
Ensure Unique test removed 1 places
Iterating global reduction 2 with 9 rules applied. Total rules applied 350 place count 293 transition count 255
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 598 place count 167 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 600 place count 166 transition count 137
Applied a total of 600 rules in 25 ms. Remains 166 /483 variables (removed 317) and now considering 137/428 (removed 291) transitions.
// Phase 1: matrix 137 rows 166 cols
[2023-03-11 02:58:05] [INFO ] Computed 73 place invariants in 1 ms
[2023-03-11 02:58:05] [INFO ] Implicit Places using invariants in 106 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 107 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/483 places, 137/428 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 136 ms. Remains : 146/483 places, 137/428 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s114 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-14 finished in 251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Graph (trivial) has 227 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1087 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 476 transition count 364
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 114 place count 420 transition count 364
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 114 place count 420 transition count 264
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 331 place count 303 transition count 264
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 339 place count 295 transition count 256
Iterating global reduction 2 with 8 rules applied. Total rules applied 347 place count 295 transition count 256
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 597 place count 168 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 599 place count 167 transition count 137
Applied a total of 599 rules in 25 ms. Remains 167 /483 variables (removed 316) and now considering 137/428 (removed 291) transitions.
// Phase 1: matrix 137 rows 167 cols
[2023-03-11 02:58:05] [INFO ] Computed 74 place invariants in 1 ms
[2023-03-11 02:58:06] [INFO ] Implicit Places using invariants in 201 ms returned [1, 2, 3, 6, 7, 8, 9, 16, 17, 21, 22, 23, 24, 25, 26, 49, 50, 51, 52, 53, 124]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 204 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/483 places, 137/428 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 232 ms. Remains : 146/483 places, 137/428 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 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 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-15 finished in 301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)||(p1&&G(F(p2)))))))'
Found a Shortening insensitive property : BusinessProcesses-PT-16-LTLFireability-08
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 483 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Graph (trivial) has 222 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1087 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 476 transition count 367
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 423 transition count 367
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 108 place count 423 transition count 266
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 327 place count 305 transition count 266
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 335 place count 297 transition count 258
Ensure Unique test removed 1 places
Iterating global reduction 2 with 9 rules applied. Total rules applied 344 place count 296 transition count 258
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 588 place count 172 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 590 place count 171 transition count 142
Applied a total of 590 rules in 54 ms. Remains 171 /483 variables (removed 312) and now considering 142/428 (removed 286) transitions.
// Phase 1: matrix 142 rows 171 cols
[2023-03-11 02:58:06] [INFO ] Computed 73 place invariants in 2 ms
[2023-03-11 02:58:06] [INFO ] Implicit Places using invariants in 201 ms returned [4, 5, 6, 7, 8, 9, 18, 19, 23, 24, 25, 26, 27, 28, 51, 52, 53, 54, 55]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 204 ms to find 19 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 152/483 places, 142/428 transitions.
Applied a total of 0 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 265 ms. Remains : 152/483 places, 142/428 transitions.
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(EQ s116 1), p1:(NEQ s4 1), p2:(NEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 21944 reset in 248 ms.
Product exploration explored 100000 steps with 21681 reset in 226 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 312 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2492 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 764 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 747 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 777 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Finished probabilistic random walk after 306 steps, run visited all 3 properties in 8 ms. (steps per millisecond=38 )
Probabilistic random walk after 306 steps, saw 193 distinct states, run finished after 8 ms. (steps per millisecond=38 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) p1)), (F p0), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 313 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 3 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 142/142 transitions.
Applied a total of 0 rules in 1 ms. Remains 152 /152 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 152 cols
[2023-03-11 02:58:08] [INFO ] Computed 54 place invariants in 1 ms
[2023-03-11 02:58:08] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-11 02:58:08] [INFO ] Invariant cache hit.
[2023-03-11 02:58:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:58:08] [INFO ] Implicit Places using invariants and state equation in 313 ms returned [1, 6, 8, 12, 15, 38, 40, 42, 44, 45, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 70, 72, 74, 76, 78, 80, 82, 84, 92, 94, 96, 98, 100]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 460 ms to find 34 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/152 places, 142/142 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 112 transition count 134
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 112 transition count 134
Applied a total of 12 rules in 4 ms. Remains 112 /118 variables (removed 6) and now considering 134/142 (removed 8) transitions.
// Phase 1: matrix 134 rows 112 cols
[2023-03-11 02:58:08] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-11 02:58:08] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-11 02:58:08] [INFO ] Invariant cache hit.
[2023-03-11 02:58:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:58:09] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/152 places, 134/142 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 676 ms. Remains : 112/152 places, 134/142 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 368 edges and 112 vertex of which 97 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 286 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2500 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 776 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 768 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 774 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Finished probabilistic random walk after 328 steps, run visited all 3 properties in 5 ms. (steps per millisecond=65 )
Probabilistic random walk after 328 steps, saw 195 distinct states, run finished after 5 ms. (steps per millisecond=65 ) properties seen :3
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 193 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 21884 reset in 117 ms.
Product exploration explored 100000 steps with 21740 reset in 123 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 134/134 transitions.
Graph (complete) has 368 edges and 112 vertex of which 101 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 101 transition count 129
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 22 place count 92 transition count 93
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 31 place count 92 transition count 93
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 92 transition count 99
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 40 rules in 4 ms. Remains 92 /112 variables (removed 20) and now considering 99/134 (removed 35) transitions.
[2023-03-11 02:58:10] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 99 rows 92 cols
[2023-03-11 02:58:10] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-11 02:58:10] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/112 places, 99/134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 92/112 places, 99/134 transitions.
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 134/134 transitions.
Applied a total of 0 rules in 0 ms. Remains 112 /112 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 112 cols
[2023-03-11 02:58:10] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-11 02:58:10] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-11 02:58:10] [INFO ] Invariant cache hit.
[2023-03-11 02:58:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:58:10] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-11 02:58:10] [INFO ] Invariant cache hit.
[2023-03-11 02:58:11] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 360 ms. Remains : 112/112 places, 134/134 transitions.
Treatment of property BusinessProcesses-PT-16-LTLFireability-08 finished in 4907 ms.
[2023-03-11 02:58:11] [INFO ] Flatten gal took : 55 ms
[2023-03-11 02:58:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 02:58:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 483 places, 428 transitions and 1389 arcs took 15 ms.
Total runtime 38087 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-16
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

BK_STOP 1678503551599

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 BusinessProcesses-PT-16-LTLFireability-08
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-16-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 4/32 BusinessProcesses-PT-16-LTLFireability-08 376637 m, 75327 m/sec, 2045580 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-16-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 7/32 BusinessProcesses-PT-16-LTLFireability-08 719516 m, 68575 m/sec, 4116489 t fired, .

Time elapsed: 10 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-16-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 9/32 BusinessProcesses-PT-16-LTLFireability-08 1057983 m, 67693 m/sec, 6221182 t fired, .

Time elapsed: 15 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-16-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 12/32 BusinessProcesses-PT-16-LTLFireability-08 1372321 m, 62867 m/sec, 8221874 t fired, .

Time elapsed: 20 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-16-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 15/32 BusinessProcesses-PT-16-LTLFireability-08 1691379 m, 63811 m/sec, 10254197 t fired, .

Time elapsed: 25 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-16-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 18/32 BusinessProcesses-PT-16-LTLFireability-08 2006462 m, 63016 m/sec, 12244589 t fired, .

Time elapsed: 30 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-16-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 20/32 BusinessProcesses-PT-16-LTLFireability-08 2311237 m, 60955 m/sec, 14312293 t fired, .

Time elapsed: 35 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-16-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 23/32 BusinessProcesses-PT-16-LTLFireability-08 2622711 m, 62294 m/sec, 16423280 t fired, .

Time elapsed: 40 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-16-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 26/32 BusinessProcesses-PT-16-LTLFireability-08 2972180 m, 69893 m/sec, 18689863 t fired, .

Time elapsed: 45 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-16-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 28/32 BusinessProcesses-PT-16-LTLFireability-08 3249442 m, 55452 m/sec, 20703107 t fired, .

Time elapsed: 50 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-16-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3600 31/32 BusinessProcesses-PT-16-LTLFireability-08 3556804 m, 61472 m/sec, 22841421 t fired, .

Time elapsed: 55 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for BusinessProcesses-PT-16-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-16-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-16-LTLFireability-08: LTL unknown AGGR


Time elapsed: 60 secs. Pages in use: 32

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="BusinessProcesses-PT-16"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is BusinessProcesses-PT-16, 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 r039-tajo-167813692700572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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