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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:45 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.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 25 16:47 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 157K 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-15-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678646167644

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-15
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:36:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 18:36:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:36:09] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-12 18:36:09] [INFO ] Transformed 630 places.
[2023-03-12 18:36:09] [INFO ] Transformed 566 transitions.
[2023-03-12 18:36:09] [INFO ] Found NUPN structural information;
[2023-03-12 18:36:09] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-15-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 89 place count 537 transition count 476
Iterating global reduction 1 with 86 rules applied. Total rules applied 175 place count 537 transition count 476
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 216 place count 496 transition count 435
Iterating global reduction 1 with 41 rules applied. Total rules applied 257 place count 496 transition count 435
Applied a total of 257 rules in 164 ms. Remains 496 /626 variables (removed 130) and now considering 435/562 (removed 127) transitions.
// Phase 1: matrix 435 rows 496 cols
[2023-03-12 18:36:09] [INFO ] Computed 99 place invariants in 33 ms
[2023-03-12 18:36:10] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-12 18:36:10] [INFO ] Invariant cache hit.
[2023-03-12 18:36:10] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
[2023-03-12 18:36:10] [INFO ] Invariant cache hit.
[2023-03-12 18:36:11] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 496/626 places, 435/562 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1367 ms. Remains : 496/626 places, 435/562 transitions.
Support contains 24 out of 496 places after structural reductions.
[2023-03-12 18:36:11] [INFO ] Flatten gal took : 66 ms
[2023-03-12 18:36:11] [INFO ] Flatten gal took : 27 ms
[2023-03-12 18:36:11] [INFO ] Input system was already deterministic with 435 transitions.
Support contains 22 out of 496 places (down from 24) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 572 ms. (steps per millisecond=17 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-12 18:36:12] [INFO ] Invariant cache hit.
[2023-03-12 18:36:12] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 18:36:13] [INFO ] [Nat]Absence check using 58 positive place invariants in 26 ms returned sat
[2023-03-12 18:36:13] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 20 ms returned sat
[2023-03-12 18:36:13] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-12 18:36:13] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 13 ms to minimize.
[2023-03-12 18:36:13] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 1 ms to minimize.
[2023-03-12 18:36:14] [INFO ] Deduced a trap composed of 78 places in 138 ms of which 2 ms to minimize.
[2023-03-12 18:36:14] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2023-03-12 18:36:14] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2023-03-12 18:36:14] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 0 ms to minimize.
[2023-03-12 18:36:14] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 1 ms to minimize.
[2023-03-12 18:36:14] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 1 ms to minimize.
[2023-03-12 18:36:14] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2023-03-12 18:36:14] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2023-03-12 18:36:14] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 0 ms to minimize.
[2023-03-12 18:36:15] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 0 ms to minimize.
[2023-03-12 18:36:15] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 2 ms to minimize.
[2023-03-12 18:36:15] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2023-03-12 18:36:15] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2023-03-12 18:36:15] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 0 ms to minimize.
[2023-03-12 18:36:15] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1787 ms
[2023-03-12 18:36:15] [INFO ] Deduced a trap composed of 105 places in 210 ms of which 1 ms to minimize.
[2023-03-12 18:36:15] [INFO ] Deduced a trap composed of 98 places in 189 ms of which 1 ms to minimize.
[2023-03-12 18:36:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 498 ms
[2023-03-12 18:36:16] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 4 ms to minimize.
[2023-03-12 18:36:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-12 18:36:16] [INFO ] After 2971ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-12 18:36:16] [INFO ] After 3548ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 3 properties in 89 ms.
Support contains 9 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 435/435 transitions.
Graph (trivial) has 224 edges and 496 vertex of which 6 / 496 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1112 edges and 491 vertex of which 490 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 490 transition count 377
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 440 transition count 377
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 102 place count 440 transition count 273
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 328 place count 318 transition count 273
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 331 place count 315 transition count 270
Ensure Unique test removed 1 places
Iterating global reduction 2 with 4 rules applied. Total rules applied 335 place count 314 transition count 270
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 257 rules applied. Total rules applied 592 place count 184 transition count 143
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 594 place count 183 transition count 147
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 596 place count 183 transition count 145
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 598 place count 181 transition count 145
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 603 place count 181 transition count 145
Applied a total of 603 rules in 86 ms. Remains 181 /496 variables (removed 315) and now considering 145/435 (removed 290) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 181/496 places, 145/435 transitions.
Incomplete random walk after 10000 steps, including 257 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 168 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 181 cols
[2023-03-12 18:36:16] [INFO ] Computed 77 place invariants in 7 ms
[2023-03-12 18:36:16] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 18:36:16] [INFO ] [Nat]Absence check using 59 positive place invariants in 8 ms returned sat
[2023-03-12 18:36:16] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-12 18:36:16] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 18:36:16] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-12 18:36:16] [INFO ] After 9ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 18:36:16] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 18:36:16] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-15-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
FORMULA BusinessProcesses-PT-15-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 207 stabilizing places and 179 stable transitions
Graph (complete) has 1119 edges and 496 vertex of which 495 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(p1) U G(p0))))'
Support contains 4 out of 496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Graph (trivial) has 231 edges and 496 vertex of which 6 / 496 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 1113 edges and 491 vertex of which 490 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 489 transition count 373
Reduce places removed 54 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 435 transition count 372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 434 transition count 372
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 112 place count 434 transition count 270
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 334 place count 314 transition count 270
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 341 place count 307 transition count 263
Ensure Unique test removed 1 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 349 place count 306 transition count 263
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 257 rules applied. Total rules applied 606 place count 176 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 608 place count 175 transition count 140
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 614 place count 175 transition count 140
Applied a total of 614 rules in 69 ms. Remains 175 /496 variables (removed 321) and now considering 140/435 (removed 295) transitions.
// Phase 1: matrix 140 rows 175 cols
[2023-03-12 18:36:17] [INFO ] Computed 77 place invariants in 2 ms
[2023-03-12 18:36:17] [INFO ] Implicit Places using invariants in 117 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 42, 46, 47, 48, 54, 55, 58, 59, 147, 150]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 133 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/496 places, 140/435 transitions.
Applied a total of 0 rules in 10 ms. Remains 152 /152 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 213 ms. Remains : 152/496 places, 140/435 transitions.
Stuttering acceptance computed with spot in 383 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s38 0) (EQ s33 1)), p1:(OR (EQ s5 0) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 21418 reset in 439 ms.
Product exploration explored 100000 steps with 21459 reset in 587 ms.
Computed a total of 36 stabilizing places and 27 stable transitions
Computed a total of 36 stabilizing places and 27 stable transitions
Detected a total of 36/152 stabilizing places and 27/140 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), true, (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 633 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2462 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 766 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 721 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 140 rows 152 cols
[2023-03-12 18:36:19] [INFO ] Computed 54 place invariants in 3 ms
[2023-03-12 18:36:19] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 18:36:19] [INFO ] [Nat]Absence check using 37 positive place invariants in 4 ms returned sat
[2023-03-12 18:36:19] [INFO ] [Nat]Absence check using 37 positive and 17 generalized place invariants in 3 ms returned sat
[2023-03-12 18:36:20] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 18:36:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 18:36:20] [INFO ] After 6ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 18:36:20] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-12 18:36:20] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 140/140 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 139
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 152 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 150 transition count 137
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 150 transition count 137
Applied a total of 6 rules in 19 ms. Remains 150 /152 variables (removed 2) and now considering 137/140 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 150/152 places, 137/140 transitions.
Finished random walk after 648 steps, including 20 resets, run visited all 1 properties in 3 ms. (steps per millisecond=216 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), true, (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 14 factoid took 685 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 140/140 transitions.
Applied a total of 0 rules in 1 ms. Remains 152 /152 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2023-03-12 18:36:21] [INFO ] Invariant cache hit.
[2023-03-12 18:36:21] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-12 18:36:21] [INFO ] Invariant cache hit.
[2023-03-12 18:36:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 18:36:21] [INFO ] Implicit Places using invariants and state equation in 193 ms returned [3, 25, 27, 34, 40, 42, 44, 46, 48, 50, 52, 59, 61, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 288 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/152 places, 140/140 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 118 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 118 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 116 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 116 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 115 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 115 transition count 133
Applied a total of 12 rules in 10 ms. Remains 115 /121 variables (removed 6) and now considering 133/140 (removed 7) transitions.
// Phase 1: matrix 133 rows 115 cols
[2023-03-12 18:36:21] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-12 18:36:21] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-12 18:36:21] [INFO ] Invariant cache hit.
[2023-03-12 18:36:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 18:36:21] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/152 places, 133/140 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 479 ms. Remains : 115/152 places, 133/140 transitions.
Computed a total of 21 stabilizing places and 23 stable transitions
Graph (complete) has 374 edges and 115 vertex of which 104 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 23 stable transitions
Detected a total of 21/115 stabilizing places and 23/133 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (AND p0 p1)), (X (X p1)), (X (X (AND p0 p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 235 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2437 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 751 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 18:36:22] [INFO ] Invariant cache hit.
[2023-03-12 18:36:22] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 18:36:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 18:36:22] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 3 ms returned sat
[2023-03-12 18:36:22] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 18:36:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 18:36:22] [INFO ] After 4ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 18:36:22] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 18:36:22] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 133/133 transitions.
Graph (complete) has 358 edges and 115 vertex of which 105 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 105 transition count 111
Reduce places removed 16 places and 0 transitions.
Graph (complete) has 272 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 17 rules applied. Total rules applied 36 place count 88 transition count 111
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 88 transition count 110
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 45 place count 80 transition count 78
Iterating global reduction 3 with 8 rules applied. Total rules applied 53 place count 80 transition count 78
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 67 place count 72 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 70 transition count 70
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 70 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 75 place count 68 transition count 68
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 68 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 77 place count 67 transition count 67
Applied a total of 77 rules in 17 ms. Remains 67 /115 variables (removed 48) and now considering 67/133 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 67/115 places, 67/133 transitions.
Finished random walk after 718 steps, including 36 resets, run visited all 1 properties in 3 ms. (steps per millisecond=239 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (AND p0 p1)), (X (X p1)), (X (X (AND p0 p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p0))), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 347 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Product exploration explored 100000 steps with 21482 reset in 125 ms.
Product exploration explored 100000 steps with 21445 reset in 155 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 133/133 transitions.
Graph (complete) has 374 edges and 115 vertex of which 106 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 106 transition count 129
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 23 place count 98 transition count 97
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 31 place count 98 transition count 97
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 98 transition count 100
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 37 rules in 10 ms. Remains 98 /115 variables (removed 17) and now considering 100/133 (removed 33) transitions.
[2023-03-12 18:36:23] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 98 cols
[2023-03-12 18:36:23] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-12 18:36:23] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/115 places, 100/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 98/115 places, 100/133 transitions.
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 133/133 transitions.
Applied a total of 0 rules in 1 ms. Remains 115 /115 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 115 cols
[2023-03-12 18:36:23] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-12 18:36:23] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-12 18:36:23] [INFO ] Invariant cache hit.
[2023-03-12 18:36:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 18:36:23] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-12 18:36:23] [INFO ] Invariant cache hit.
[2023-03-12 18:36:23] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 115/115 places, 133/133 transitions.
Treatment of property BusinessProcesses-PT-15-LTLCardinality-00 finished in 6943 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)||G(p1)))'
Support contains 2 out of 496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Graph (trivial) has 234 edges and 496 vertex of which 6 / 496 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 1113 edges and 491 vertex of which 490 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 490 transition count 373
Reduce places removed 55 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 435 transition count 372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 434 transition count 372
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 114 place count 434 transition count 268
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 342 place count 310 transition count 268
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 348 place count 304 transition count 262
Ensure Unique test removed 1 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 355 place count 303 transition count 262
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 261 rules applied. Total rules applied 616 place count 171 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 618 place count 170 transition count 137
Applied a total of 618 rules in 48 ms. Remains 170 /496 variables (removed 326) and now considering 137/435 (removed 298) transitions.
// Phase 1: matrix 137 rows 170 cols
[2023-03-12 18:36:24] [INFO ] Computed 75 place invariants in 1 ms
[2023-03-12 18:36:24] [INFO ] Implicit Places using invariants in 132 ms returned [2, 3, 4, 5, 6, 9, 10, 33, 34, 35, 36, 41, 42, 43, 47, 48, 49, 50, 51, 54, 55]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 135 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/496 places, 137/435 transitions.
Applied a total of 0 rules in 4 ms. Remains 149 /149 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 188 ms. Remains : 149/496 places, 137/435 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s1 0) (EQ s34 1)), p1:(AND (NEQ s34 0) (NEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-02 finished in 268 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&&X(X(F(!p0))))||G(F(!p0))))))'
Support contains 2 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 490 transition count 429
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 490 transition count 429
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 486 transition count 425
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 486 transition count 425
Applied a total of 20 rules in 28 ms. Remains 486 /496 variables (removed 10) and now considering 425/435 (removed 10) transitions.
// Phase 1: matrix 425 rows 486 cols
[2023-03-12 18:36:24] [INFO ] Computed 99 place invariants in 5 ms
[2023-03-12 18:36:24] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-12 18:36:24] [INFO ] Invariant cache hit.
[2023-03-12 18:36:25] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2023-03-12 18:36:25] [INFO ] Invariant cache hit.
[2023-03-12 18:36:25] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 486/496 places, 425/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 964 ms. Remains : 486/496 places, 425/435 transitions.
Stuttering acceptance computed with spot in 121 ms :[p0, p0, p0, p0]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s477 0) (EQ s415 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 136 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-06 finished in 1102 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)&&X(X(G(p1))))))'
Support contains 3 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 490 transition count 429
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 490 transition count 429
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 485 transition count 424
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 485 transition count 424
Applied a total of 22 rules in 31 ms. Remains 485 /496 variables (removed 11) and now considering 424/435 (removed 11) transitions.
// Phase 1: matrix 424 rows 485 cols
[2023-03-12 18:36:25] [INFO ] Computed 99 place invariants in 4 ms
[2023-03-12 18:36:25] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-12 18:36:25] [INFO ] Invariant cache hit.
[2023-03-12 18:36:26] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
[2023-03-12 18:36:26] [INFO ] Invariant cache hit.
[2023-03-12 18:36:26] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 485/496 places, 424/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 941 ms. Remains : 485/496 places, 424/435 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(AND (EQ s216 0) (EQ s54 1)), p1:(EQ s419 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-11 finished in 1102 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((X((G(F(p1))||(F(p1)&&F(G(!p1)))||G(!p2)))&&p0))))'
Support contains 3 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 490 transition count 429
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 490 transition count 429
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 486 transition count 425
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 486 transition count 425
Applied a total of 20 rules in 25 ms. Remains 486 /496 variables (removed 10) and now considering 425/435 (removed 10) transitions.
// Phase 1: matrix 425 rows 486 cols
[2023-03-12 18:36:26] [INFO ] Computed 99 place invariants in 3 ms
[2023-03-12 18:36:26] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-12 18:36:26] [INFO ] Invariant cache hit.
[2023-03-12 18:36:27] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
[2023-03-12 18:36:27] [INFO ] Invariant cache hit.
[2023-03-12 18:36:27] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 486/496 places, 425/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1154 ms. Remains : 486/496 places, 425/435 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), true, (AND (NOT p1) p2), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (NEQ s162 0) (NEQ s427 1)), p1:(NEQ s344 1), p2:(OR (EQ s162 0) (EQ s427 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-13 finished in 1390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(p1) U G(p0))))'
[2023-03-12 18:36:28] [INFO ] Flatten gal took : 47 ms
[2023-03-12 18:36:28] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 18:36:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 496 places, 435 transitions and 1401 arcs took 7 ms.
Total runtime 18730 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1039/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BusinessProcesses-PT-15-LTLCardinality-00

BK_STOP 1678646188737

--------------------
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
mcc2023
ltl formula name BusinessProcesses-PT-15-LTLCardinality-00
ltl formula formula --ltl=/tmp/1039/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 496 places, 435 transitions and 1401 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1039/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1039/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1039/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1039/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-15"
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-15, 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-167813694900563"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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