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.r041-tajo-167813694800491.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 ltsminxred
Input is BusinessProcesses-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694800491
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 8.0K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:50 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 3.6K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 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 85K 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-06-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678640374785

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:59:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:59:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:59:36] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-12 16:59:36] [INFO ] Transformed 376 places.
[2023-03-12 16:59:36] [INFO ] Transformed 297 transitions.
[2023-03-12 16:59:36] [INFO ] Found NUPN structural information;
[2023-03-12 16:59:36] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 296
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 38 place count 337 transition count 260
Iterating global reduction 1 with 36 rules applied. Total rules applied 74 place count 337 transition count 260
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 89 place count 322 transition count 245
Iterating global reduction 1 with 15 rules applied. Total rules applied 104 place count 322 transition count 245
Applied a total of 104 rules in 66 ms. Remains 322 /375 variables (removed 53) and now considering 245/296 (removed 51) transitions.
// Phase 1: matrix 245 rows 322 cols
[2023-03-12 16:59:36] [INFO ] Computed 79 place invariants in 20 ms
[2023-03-12 16:59:37] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-12 16:59:37] [INFO ] Invariant cache hit.
[2023-03-12 16:59:37] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2023-03-12 16:59:37] [INFO ] Invariant cache hit.
[2023-03-12 16:59:37] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 322/375 places, 245/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 873 ms. Remains : 322/375 places, 245/296 transitions.
Support contains 35 out of 322 places after structural reductions.
[2023-03-12 16:59:37] [INFO ] Flatten gal took : 63 ms
[2023-03-12 16:59:37] [INFO ] Flatten gal took : 22 ms
[2023-03-12 16:59:38] [INFO ] Input system was already deterministic with 245 transitions.
Incomplete random walk after 10000 steps, including 103 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 20) seen :17
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 16:59:38] [INFO ] Invariant cache hit.
[2023-03-12 16:59:38] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-12 16:59:38] [INFO ] [Real]Absence check using 34 positive and 45 generalized place invariants in 35 ms returned sat
[2023-03-12 16:59:38] [INFO ] After 135ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-12 16:59:38] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 6 ms to minimize.
[2023-03-12 16:59:39] [INFO ] Deduced a trap composed of 20 places in 277 ms of which 30 ms to minimize.
[2023-03-12 16:59:39] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2023-03-12 16:59:39] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2023-03-12 16:59:39] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 0 ms to minimize.
[2023-03-12 16:59:39] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 0 ms to minimize.
[2023-03-12 16:59:39] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2023-03-12 16:59:39] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2023-03-12 16:59:39] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2023-03-12 16:59:39] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2023-03-12 16:59:39] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2023-03-12 16:59:39] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1191 ms
[2023-03-12 16:59:40] [INFO ] After 1375ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:59:40] [INFO ] After 1561ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:59:40] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2023-03-12 16:59:40] [INFO ] [Nat]Absence check using 34 positive and 45 generalized place invariants in 23 ms returned sat
[2023-03-12 16:59:40] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:59:40] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2023-03-12 16:59:40] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2023-03-12 16:59:40] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2023-03-12 16:59:40] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2023-03-12 16:59:40] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 3 ms to minimize.
[2023-03-12 16:59:40] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2023-03-12 16:59:40] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2023-03-12 16:59:41] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2023-03-12 16:59:41] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2023-03-12 16:59:41] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2023-03-12 16:59:41] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2023-03-12 16:59:41] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2023-03-12 16:59:41] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2023-03-12 16:59:41] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2023-03-12 16:59:41] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2023-03-12 16:59:41] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2023-03-12 16:59:41] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2023-03-12 16:59:41] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2023-03-12 16:59:41] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1381 ms
[2023-03-12 16:59:41] [INFO ] After 1559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-12 16:59:41] [INFO ] After 1737ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 245/245 transitions.
Graph (trivial) has 142 edges and 322 vertex of which 6 / 322 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 626 edges and 317 vertex of which 316 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 316 transition count 203
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 283 transition count 203
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 68 place count 283 transition count 138
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 208 place count 208 transition count 138
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 214 place count 202 transition count 132
Iterating global reduction 2 with 6 rules applied. Total rules applied 220 place count 202 transition count 132
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 386 place count 118 transition count 50
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 387 place count 118 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 388 place count 117 transition count 49
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 389 place count 117 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 390 place count 116 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 391 place count 115 transition count 48
Applied a total of 391 rules in 83 ms. Remains 115 /322 variables (removed 207) and now considering 48/245 (removed 197) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 115/322 places, 48/245 transitions.
Finished random walk after 47 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=9 )
FORMULA BusinessProcesses-PT-06-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-06-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 315 stabilizing places and 236 stable transitions
Graph (complete) has 633 edges and 322 vertex of which 321 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 245/245 transitions.
Graph (trivial) has 143 edges and 322 vertex of which 6 / 322 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 627 edges and 317 vertex of which 316 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 315 transition count 204
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 282 transition count 204
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 68 place count 282 transition count 138
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 210 place count 206 transition count 138
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 217 place count 199 transition count 131
Iterating global reduction 2 with 7 rules applied. Total rules applied 224 place count 199 transition count 131
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 388 place count 116 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 389 place count 115 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 390 place count 114 transition count 49
Applied a total of 390 rules in 34 ms. Remains 114 /322 variables (removed 208) and now considering 49/245 (removed 196) transitions.
// Phase 1: matrix 49 rows 114 cols
[2023-03-12 16:59:42] [INFO ] Computed 66 place invariants in 2 ms
[2023-03-12 16:59:42] [INFO ] Implicit Places using invariants in 95 ms returned [98, 100, 102, 104, 106, 108]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 97 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/322 places, 49/245 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 135 ms. Remains : 108/322 places, 49/245 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s93 0) (EQ s26 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 1 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-01 finished in 414 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)))))'
Support contains 2 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 245/245 transitions.
Graph (trivial) has 143 edges and 322 vertex of which 6 / 322 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 627 edges and 317 vertex of which 316 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 315 transition count 204
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 282 transition count 204
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 68 place count 282 transition count 138
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 210 place count 206 transition count 138
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 217 place count 199 transition count 131
Iterating global reduction 2 with 7 rules applied. Total rules applied 224 place count 199 transition count 131
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 394 place count 110 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 109 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 396 place count 108 transition count 49
Applied a total of 396 rules in 28 ms. Remains 108 /322 variables (removed 214) and now considering 49/245 (removed 196) transitions.
// Phase 1: matrix 49 rows 108 cols
[2023-03-12 16:59:42] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-12 16:59:42] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-12 16:59:42] [INFO ] Invariant cache hit.
[2023-03-12 16:59:42] [INFO ] Implicit Places using invariants and state equation in 130 ms returned [6, 7, 8, 9, 10, 12, 14, 16, 18, 20, 22, 24, 26, 35, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76]
Discarding 35 places :
Implicit Place search using SMT with State Equation took 197 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/322 places, 49/245 transitions.
Graph (complete) has 151 edges and 73 vertex of which 65 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 65 transition count 38
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 55 transition count 38
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 44 place count 40 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 39 transition count 29
Applied a total of 46 rules in 15 ms. Remains 39 /73 variables (removed 34) and now considering 29/49 (removed 20) transitions.
// Phase 1: matrix 29 rows 39 cols
[2023-03-12 16:59:42] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-12 16:59:42] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-12 16:59:42] [INFO ] Invariant cache hit.
[2023-03-12 16:59:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 16:59:42] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/322 places, 29/245 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 344 ms. Remains : 39/322 places, 29/245 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s36 1), p1:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-02 finished in 482 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 4 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 245/245 transitions.
Graph (trivial) has 139 edges and 322 vertex of which 6 / 322 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 627 edges and 317 vertex of which 316 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 315 transition count 206
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 284 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 283 transition count 205
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 66 place count 283 transition count 141
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 137 rules applied. Total rules applied 203 place count 210 transition count 141
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 208 place count 205 transition count 136
Iterating global reduction 3 with 5 rules applied. Total rules applied 213 place count 205 transition count 136
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 389 place count 113 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 390 place count 112 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 391 place count 111 transition count 51
Applied a total of 391 rules in 36 ms. Remains 111 /322 variables (removed 211) and now considering 51/245 (removed 194) transitions.
// Phase 1: matrix 51 rows 111 cols
[2023-03-12 16:59:43] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-12 16:59:43] [INFO ] Implicit Places using invariants in 99 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 100 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/322 places, 51/245 transitions.
Applied a total of 0 rules in 3 ms. Remains 110 /110 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 110/322 places, 51/245 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s52 0) (EQ s85 1)), p0:(AND (EQ s7 0) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 566 steps with 168 reset in 4 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-03 finished in 239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 3 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 245/245 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 314 transition count 237
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 314 transition count 237
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 310 transition count 233
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 310 transition count 233
Applied a total of 24 rules in 14 ms. Remains 310 /322 variables (removed 12) and now considering 233/245 (removed 12) transitions.
// Phase 1: matrix 233 rows 310 cols
[2023-03-12 16:59:43] [INFO ] Computed 79 place invariants in 13 ms
[2023-03-12 16:59:43] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-12 16:59:43] [INFO ] Invariant cache hit.
[2023-03-12 16:59:43] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2023-03-12 16:59:43] [INFO ] Invariant cache hit.
[2023-03-12 16:59:44] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 310/322 places, 233/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 708 ms. Remains : 310/322 places, 233/245 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s272 0), p1:(OR (EQ s16 0) (EQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 393 ms.
Product exploration explored 100000 steps with 50000 reset in 322 ms.
Computed a total of 303 stabilizing places and 224 stable transitions
Graph (complete) has 619 edges and 310 vertex of which 309 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 303 stabilizing places and 224 stable transitions
Detected a total of 303/310 stabilizing places and 224/233 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 157 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-06-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-06-LTLCardinality-05 finished in 1706 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((F(p1)&&p0))))'
Support contains 4 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 245/245 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 315 transition count 238
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 315 transition count 238
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 310 transition count 233
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 310 transition count 233
Applied a total of 24 rules in 22 ms. Remains 310 /322 variables (removed 12) and now considering 233/245 (removed 12) transitions.
// Phase 1: matrix 233 rows 310 cols
[2023-03-12 16:59:45] [INFO ] Computed 79 place invariants in 5 ms
[2023-03-12 16:59:45] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-12 16:59:45] [INFO ] Invariant cache hit.
[2023-03-12 16:59:45] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-12 16:59:45] [INFO ] Invariant cache hit.
[2023-03-12 16:59:45] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 310/322 places, 233/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 629 ms. Remains : 310/322 places, 233/245 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (NEQ s214 0) (NEQ s252 1) (OR (EQ s18 0) (EQ s69 1))), p0:(AND (NEQ s214 0) (NEQ s252 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 5 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-06 finished in 813 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)||X(G((p1&&X(X(p2)))))))'
Support contains 5 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 245/245 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 316 transition count 239
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 316 transition count 239
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 312 transition count 235
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 312 transition count 235
Applied a total of 20 rules in 17 ms. Remains 312 /322 variables (removed 10) and now considering 235/245 (removed 10) transitions.
// Phase 1: matrix 235 rows 312 cols
[2023-03-12 16:59:45] [INFO ] Computed 79 place invariants in 3 ms
[2023-03-12 16:59:46] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-12 16:59:46] [INFO ] Invariant cache hit.
[2023-03-12 16:59:46] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2023-03-12 16:59:46] [INFO ] Invariant cache hit.
[2023-03-12 16:59:46] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/322 places, 235/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 769 ms. Remains : 312/322 places, 235/245 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s218 0) (EQ s257 1) (EQ s103 0) (EQ s91 1)), p1:(OR (EQ s257 0) (EQ s218 1)), p2:(EQ s57 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 114 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-07 finished in 1022 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(p1))))'
Support contains 4 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 245/245 transitions.
Graph (trivial) has 141 edges and 322 vertex of which 6 / 322 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 627 edges and 317 vertex of which 316 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 315 transition count 205
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 283 transition count 203
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 281 transition count 203
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 70 place count 281 transition count 140
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 204 place count 210 transition count 140
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 212 place count 202 transition count 132
Iterating global reduction 3 with 8 rules applied. Total rules applied 220 place count 202 transition count 132
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 390 place count 113 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 391 place count 112 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 392 place count 111 transition count 50
Applied a total of 392 rules in 50 ms. Remains 111 /322 variables (removed 211) and now considering 50/245 (removed 195) transitions.
// Phase 1: matrix 50 rows 111 cols
[2023-03-12 16:59:46] [INFO ] Computed 62 place invariants in 2 ms
[2023-03-12 16:59:47] [INFO ] Implicit Places using invariants in 170 ms returned [84, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 172 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/322 places, 50/245 transitions.
Applied a total of 0 rules in 9 ms. Remains 109 /109 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 231 ms. Remains : 109/322 places, 50/245 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s2 1)), p1:(OR (EQ s35 0) (EQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 94 steps with 16 reset in 2 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-11 finished in 427 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)))'
Support contains 3 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 245/245 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 314 transition count 237
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 314 transition count 237
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 309 transition count 232
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 309 transition count 232
Applied a total of 26 rules in 26 ms. Remains 309 /322 variables (removed 13) and now considering 232/245 (removed 13) transitions.
// Phase 1: matrix 232 rows 309 cols
[2023-03-12 16:59:47] [INFO ] Computed 79 place invariants in 3 ms
[2023-03-12 16:59:47] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-12 16:59:47] [INFO ] Invariant cache hit.
[2023-03-12 16:59:47] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2023-03-12 16:59:47] [INFO ] Invariant cache hit.
[2023-03-12 16:59:47] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/322 places, 232/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 671 ms. Remains : 309/322 places, 232/245 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s241 0) (EQ s200 1) (EQ s253 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 290 ms.
Product exploration explored 100000 steps with 50000 reset in 290 ms.
Computed a total of 302 stabilizing places and 223 stable transitions
Graph (complete) has 617 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 302 stabilizing places and 223 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-06-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-06-LTLCardinality-13 finished in 1449 ms.
All properties solved by simple procedures.
Total runtime 12218 ms.
ITS solved all properties within timeout

BK_STOP 1678640388992

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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-06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694800491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-06.tgz
mv BusinessProcesses-PT-06 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;