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-167813694900571.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-16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694900571
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678647105681

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-16
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:51:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 18:51:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:51:47] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2023-03-12 18:51:47] [INFO ] Transformed 638 places.
[2023-03-12 18:51:47] [INFO ] Transformed 578 transitions.
[2023-03-12 18:51:47] [INFO ] Found NUPN structural information;
[2023-03-12 18:51:47] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 146 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 7 formulas.
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 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 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 102 place count 528 transition count 473
Iterating global reduction 1 with 97 rules applied. Total rules applied 199 place count 528 transition count 473
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 250 place count 477 transition count 422
Iterating global reduction 1 with 51 rules applied. Total rules applied 301 place count 477 transition count 422
Applied a total of 301 rules in 116 ms. Remains 477 /630 variables (removed 153) and now considering 422/570 (removed 148) transitions.
// Phase 1: matrix 422 rows 477 cols
[2023-03-12 18:51:48] [INFO ] Computed 95 place invariants in 36 ms
[2023-03-12 18:51:48] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-03-12 18:51:48] [INFO ] Invariant cache hit.
[2023-03-12 18:51:48] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
[2023-03-12 18:51:49] [INFO ] Invariant cache hit.
[2023-03-12 18:51:49] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 477/630 places, 422/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1416 ms. Remains : 477/630 places, 422/570 transitions.
Support contains 25 out of 477 places after structural reductions.
[2023-03-12 18:51:49] [INFO ] Flatten gal took : 68 ms
[2023-03-12 18:51:49] [INFO ] Flatten gal took : 39 ms
[2023-03-12 18:51:49] [INFO ] Input system was already deterministic with 422 transitions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 12) seen :5
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 18:51:50] [INFO ] Invariant cache hit.
[2023-03-12 18:51:50] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 18:51:50] [INFO ] [Nat]Absence check using 57 positive place invariants in 21 ms returned sat
[2023-03-12 18:51:50] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 16 ms returned sat
[2023-03-12 18:51:50] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 18:51:51] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 20 ms to minimize.
[2023-03-12 18:51:51] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2023-03-12 18:51:51] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2023-03-12 18:51:51] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2023-03-12 18:51:51] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 1 ms to minimize.
[2023-03-12 18:51:51] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 1 ms to minimize.
[2023-03-12 18:51:51] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 0 ms to minimize.
[2023-03-12 18:51:52] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2023-03-12 18:51:52] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2023-03-12 18:51:52] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 0 ms to minimize.
[2023-03-12 18:51:52] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 0 ms to minimize.
[2023-03-12 18:51:52] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 0 ms to minimize.
[2023-03-12 18:51:52] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2023-03-12 18:51:52] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 0 ms to minimize.
[2023-03-12 18:51:52] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 3 ms to minimize.
[2023-03-12 18:51:52] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2023-03-12 18:51:52] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2023-03-12 18:51:52] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2023-03-12 18:51:52] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2023-03-12 18:51:53] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2023-03-12 18:51:53] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
[2023-03-12 18:51:53] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2023-03-12 18:51:53] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2023-03-12 18:51:53] [INFO ] Deduced a trap composed of 38 places in 357 ms of which 1 ms to minimize.
[2023-03-12 18:51:53] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2023-03-12 18:51:53] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 0 ms to minimize.
[2023-03-12 18:51:53] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 0 ms to minimize.
[2023-03-12 18:51:53] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 2969 ms
[2023-03-12 18:51:54] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2023-03-12 18:51:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-12 18:51:54] [INFO ] After 3473ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-12 18:51:54] [INFO ] After 3738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 10 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 422/422 transitions.
Graph (trivial) has 210 edges and 477 vertex of which 6 / 477 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1084 edges and 472 vertex of which 471 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 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 471 transition count 371
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 89 place count 428 transition count 370
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 427 transition count 370
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 90 place count 427 transition count 271
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 304 place count 312 transition count 271
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 306 place count 310 transition count 269
Ensure Unique test removed 1 places
Iterating global reduction 3 with 3 rules applied. Total rules applied 309 place count 309 transition count 269
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 561 place count 181 transition count 145
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 563 place count 180 transition count 149
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 565 place count 180 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 567 place count 178 transition count 147
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 568 place count 178 transition count 147
Applied a total of 568 rules in 99 ms. Remains 178 /477 variables (removed 299) and now considering 147/422 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 178/477 places, 147/422 transitions.
Incomplete random walk after 10000 steps, including 324 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 108 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 147 rows 178 cols
[2023-03-12 18:51:54] [INFO ] Computed 74 place invariants in 11 ms
[2023-03-12 18:51:54] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 18:51:54] [INFO ] [Nat]Absence check using 57 positive place invariants in 12 ms returned sat
[2023-03-12 18:51:54] [INFO ] [Nat]Absence check using 57 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-12 18:51:54] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 18:51:54] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-12 18:51:54] [INFO ] After 32ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 18:51:54] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 18:51:54] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 0 ms.
Computed a total of 127 stabilizing places and 120 stable transitions
Graph (complete) has 1091 edges and 477 vertex of which 476 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 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((X(F(p1))||p0))))'
Support contains 4 out of 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 422/422 transitions.
Graph (trivial) has 217 edges and 477 vertex of which 6 / 477 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 1085 edges and 472 vertex of which 471 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 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 470 transition count 367
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 423 transition count 367
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 96 place count 423 transition count 267
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 2 with 216 rules applied. Total rules applied 312 place count 307 transition count 267
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 315 place count 304 transition count 264
Ensure Unique test removed 1 places
Iterating global reduction 2 with 4 rules applied. Total rules applied 319 place count 303 transition count 264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 319 place count 303 transition count 263
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 321 place count 302 transition count 263
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 573 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 575 place count 173 transition count 143
Applied a total of 575 rules in 58 ms. Remains 173 /477 variables (removed 304) and now considering 143/422 (removed 279) transitions.
// Phase 1: matrix 143 rows 173 cols
[2023-03-12 18:51:55] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-12 18:51:55] [INFO ] Implicit Places using invariants in 201 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 24, 25, 26, 27, 50, 51, 52, 53, 54, 138]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 205 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/477 places, 143/422 transitions.
Applied a total of 0 rules in 8 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 274 ms. Remains : 152/477 places, 143/422 transitions.
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s37 1)), p1:(OR (EQ s113 0) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15209 reset in 292 ms.
Product exploration explored 100000 steps with 15060 reset in 374 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 254 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1684 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 635 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 598 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Probably explored full state space saw : 15771 states, properties seen :1
Probabilistic random walk after 56032 steps, saw 15771 distinct states, run finished after 183 ms. (steps per millisecond=306 ) properties seen :1
Explored full state space saw : 15771 states, properties seen :0
Exhaustive walk after 56032 steps, saw 15771 distinct states, run finished after 166 ms. (steps per millisecond=337 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 186 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-16-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-16-LTLCardinality-01 finished in 2334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(!p0)) U !p1))))'
Support contains 5 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 422/422 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 472 transition count 417
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 471 transition count 416
Applied a total of 12 rules in 123 ms. Remains 471 /477 variables (removed 6) and now considering 416/422 (removed 6) transitions.
// Phase 1: matrix 416 rows 471 cols
[2023-03-12 18:51:57] [INFO ] Computed 95 place invariants in 7 ms
[2023-03-12 18:51:57] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-12 18:51:57] [INFO ] Invariant cache hit.
[2023-03-12 18:51:58] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 1043 ms to find 0 implicit places.
[2023-03-12 18:51:58] [INFO ] Invariant cache hit.
[2023-03-12 18:51:58] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/477 places, 416/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1446 ms. Remains : 471/477 places, 416/422 transitions.
Stuttering acceptance computed with spot in 204 ms :[p1, p1, p1, p0]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s346 0) (EQ s196 1) (EQ s199 1)), p0:(OR (EQ s361 0) (EQ s261 1) (EQ s346 0) (EQ s196 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 138 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-02 finished in 1669 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 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 422/422 transitions.
Graph (trivial) has 222 edges and 477 vertex of which 6 / 477 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 1085 edges and 472 vertex of which 471 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 470 transition count 365
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 421 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 100 place count 421 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 319 place count 303 transition count 264
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 324 place count 298 transition count 259
Ensure Unique test removed 1 places
Iterating global reduction 2 with 6 rules applied. Total rules applied 330 place count 297 transition count 259
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 330 place count 297 transition count 258
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 332 place count 296 transition count 258
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 584 place count 168 transition count 134
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 586 place count 167 transition count 138
Applied a total of 586 rules in 59 ms. Remains 167 /477 variables (removed 310) and now considering 138/422 (removed 284) transitions.
// Phase 1: matrix 138 rows 167 cols
[2023-03-12 18:51:59] [INFO ] Computed 73 place invariants in 2 ms
[2023-03-12 18:51:59] [INFO ] Implicit Places using invariants in 565 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 566 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/477 places, 138/422 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 631 ms. Remains : 147/477 places, 138/422 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-04 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 s34 0)], 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 56 steps with 10 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-04 finished in 774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))||p0)))'
Support contains 5 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 422/422 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 472 transition count 417
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 471 transition count 416
Applied a total of 12 rules in 31 ms. Remains 471 /477 variables (removed 6) and now considering 416/422 (removed 6) transitions.
// Phase 1: matrix 416 rows 471 cols
[2023-03-12 18:51:59] [INFO ] Computed 95 place invariants in 5 ms
[2023-03-12 18:52:00] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-12 18:52:00] [INFO ] Invariant cache hit.
[2023-03-12 18:52:00] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
[2023-03-12 18:52:00] [INFO ] Invariant cache hit.
[2023-03-12 18:52:00] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/477 places, 416/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1044 ms. Remains : 471/477 places, 416/422 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (EQ s207 0) (EQ s366 0) (EQ s206 1) (EQ s367 0) (EQ s287 1)), p1:(OR (EQ s366 0) (EQ s206 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 332 ms.
Product exploration explored 100000 steps with 50000 reset in 441 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1081 edges and 471 vertex of which 470 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 p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 83 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-16-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-16-LTLCardinality-05 finished in 2045 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 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 422/422 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 473 transition count 418
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 473 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 472 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 472 transition count 417
Applied a total of 10 rules in 57 ms. Remains 472 /477 variables (removed 5) and now considering 417/422 (removed 5) transitions.
// Phase 1: matrix 417 rows 472 cols
[2023-03-12 18:52:01] [INFO ] Computed 95 place invariants in 3 ms
[2023-03-12 18:52:02] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-12 18:52:02] [INFO ] Invariant cache hit.
[2023-03-12 18:52:02] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2023-03-12 18:52:02] [INFO ] Invariant cache hit.
[2023-03-12 18:52:02] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/477 places, 417/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1146 ms. Remains : 472/477 places, 417/422 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-10 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 (NEQ s386 0) (NEQ s211 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-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-10 finished in 1245 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((F(p2)&&p1))))'
Support contains 6 out of 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 422/422 transitions.
Graph (trivial) has 216 edges and 477 vertex of which 6 / 477 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 1085 edges and 472 vertex of which 471 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
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 471 transition count 368
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 424 transition count 368
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 96 place count 424 transition count 268
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 313 place count 307 transition count 268
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 316 place count 304 transition count 265
Iterating global reduction 2 with 3 rules applied. Total rules applied 319 place count 304 transition count 265
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 571 place count 176 transition count 141
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 573 place count 175 transition count 145
Applied a total of 573 rules in 45 ms. Remains 175 /477 variables (removed 302) and now considering 145/422 (removed 277) transitions.
// Phase 1: matrix 145 rows 175 cols
[2023-03-12 18:52:03] [INFO ] Computed 74 place invariants in 6 ms
[2023-03-12 18:52:03] [INFO ] Implicit Places using invariants in 167 ms returned [2, 3, 4, 5, 6, 9, 10, 17, 18, 22, 26, 27, 28, 29, 52, 53, 54, 55, 56, 134]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 178 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/477 places, 145/422 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 231 ms. Remains : 155/477 places, 145/422 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s14 0) (EQ s66 1)), p1:(AND (EQ s66 0) (EQ s14 1)), p2:(OR (AND (EQ s3 0) (EQ s105 1)) (AND (EQ s63 0) (EQ s1 1)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-13 finished in 405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 422/422 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 472 transition count 417
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 471 transition count 416
Applied a total of 12 rules in 41 ms. Remains 471 /477 variables (removed 6) and now considering 416/422 (removed 6) transitions.
// Phase 1: matrix 416 rows 471 cols
[2023-03-12 18:52:03] [INFO ] Computed 95 place invariants in 3 ms
[2023-03-12 18:52:03] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-12 18:52:03] [INFO ] Invariant cache hit.
[2023-03-12 18:52:04] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2023-03-12 18:52:04] [INFO ] Invariant cache hit.
[2023-03-12 18:52:04] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/477 places, 416/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 849 ms. Remains : 471/477 places, 416/422 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-14 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 s9 0) (EQ s303 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 335 ms.
Product exploration explored 100000 steps with 50000 reset in 279 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1081 edges and 471 vertex of which 470 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
Detected a total of 125/471 stabilizing places and 118/416 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 140 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-16-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-16-LTLCardinality-14 finished in 1695 ms.
All properties solved by simple procedures.
Total runtime 17611 ms.
ITS solved all properties within timeout

BK_STOP 1678647125381

--------------------
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-16"
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-16, 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-167813694900571"
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 [ "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 ;