Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620415000372.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BusinessProcesses-PT-19, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620415000372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 16:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 189K May 18 16:42 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-19-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716651557167

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:39:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:39:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:39:19] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-25 15:39:19] [INFO ] Transformed 772 places.
[2024-05-25 15:39:19] [INFO ] Transformed 685 transitions.
[2024-05-25 15:39:19] [INFO ] Found NUPN structural information;
[2024-05-25 15:39:19] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 15 places in 22 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 750 transition count 670
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 104 place count 653 transition count 573
Iterating global reduction 1 with 97 rules applied. Total rules applied 201 place count 653 transition count 573
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 246 place count 608 transition count 528
Iterating global reduction 1 with 45 rules applied. Total rules applied 291 place count 608 transition count 528
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 292 place count 607 transition count 527
Iterating global reduction 1 with 1 rules applied. Total rules applied 293 place count 607 transition count 527
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 294 place count 606 transition count 526
Iterating global reduction 1 with 1 rules applied. Total rules applied 295 place count 606 transition count 526
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 296 place count 605 transition count 525
Iterating global reduction 1 with 1 rules applied. Total rules applied 297 place count 605 transition count 525
Applied a total of 297 rules in 266 ms. Remains 605 /757 variables (removed 152) and now considering 525/670 (removed 145) transitions.
// Phase 1: matrix 525 rows 605 cols
[2024-05-25 15:39:19] [INFO ] Computed 118 invariants in 35 ms
[2024-05-25 15:39:20] [INFO ] Implicit Places using invariants in 521 ms returned []
[2024-05-25 15:39:20] [INFO ] Invariant cache hit.
[2024-05-25 15:39:21] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1306 ms to find 0 implicit places.
[2024-05-25 15:39:21] [INFO ] Invariant cache hit.
[2024-05-25 15:39:21] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 605/757 places, 525/670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1922 ms. Remains : 605/757 places, 525/670 transitions.
Support contains 36 out of 605 places after structural reductions.
[2024-05-25 15:39:21] [INFO ] Flatten gal took : 73 ms
[2024-05-25 15:39:21] [INFO ] Flatten gal took : 35 ms
[2024-05-25 15:39:21] [INFO ] Input system was already deterministic with 525 transitions.
Support contains 34 out of 605 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 593 ms. (steps per millisecond=16 ) properties (out of 17) seen :7
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-25 15:39:22] [INFO ] Invariant cache hit.
[2024-05-25 15:39:23] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2024-05-25 15:39:23] [INFO ] [Nat]Absence check using 71 positive place invariants in 23 ms returned sat
[2024-05-25 15:39:23] [INFO ] [Nat]Absence check using 71 positive and 47 generalized place invariants in 23 ms returned sat
[2024-05-25 15:39:23] [INFO ] After 432ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2024-05-25 15:39:24] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 7 ms to minimize.
[2024-05-25 15:39:24] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 1 ms to minimize.
[2024-05-25 15:39:24] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
[2024-05-25 15:39:24] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-25 15:39:24] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 1 ms to minimize.
[2024-05-25 15:39:24] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 1 ms to minimize.
[2024-05-25 15:39:25] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 1 ms to minimize.
[2024-05-25 15:39:25] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 0 ms to minimize.
[2024-05-25 15:39:25] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 1 ms to minimize.
[2024-05-25 15:39:25] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 0 ms to minimize.
[2024-05-25 15:39:25] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 1 ms to minimize.
[2024-05-25 15:39:25] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 1 ms to minimize.
[2024-05-25 15:39:25] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 1 ms to minimize.
[2024-05-25 15:39:26] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 1 ms to minimize.
[2024-05-25 15:39:26] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 1 ms to minimize.
[2024-05-25 15:39:26] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 0 ms to minimize.
[2024-05-25 15:39:26] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 0 ms to minimize.
[2024-05-25 15:39:26] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 0 ms to minimize.
[2024-05-25 15:39:26] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 0 ms to minimize.
[2024-05-25 15:39:26] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 0 ms to minimize.
[2024-05-25 15:39:26] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2876 ms
[2024-05-25 15:39:27] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 1 ms to minimize.
[2024-05-25 15:39:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2024-05-25 15:39:27] [INFO ] Deduced a trap composed of 105 places in 167 ms of which 0 ms to minimize.
[2024-05-25 15:39:27] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 1 ms to minimize.
[2024-05-25 15:39:27] [INFO ] Deduced a trap composed of 108 places in 132 ms of which 1 ms to minimize.
[2024-05-25 15:39:27] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 0 ms to minimize.
[2024-05-25 15:39:28] [INFO ] Deduced a trap composed of 110 places in 130 ms of which 1 ms to minimize.
[2024-05-25 15:39:28] [INFO ] Deduced a trap composed of 116 places in 154 ms of which 0 ms to minimize.
[2024-05-25 15:39:28] [INFO ] Deduced a trap composed of 108 places in 126 ms of which 1 ms to minimize.
[2024-05-25 15:39:28] [INFO ] Deduced a trap composed of 104 places in 155 ms of which 1 ms to minimize.
[2024-05-25 15:39:28] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 1 ms to minimize.
[2024-05-25 15:39:28] [INFO ] Deduced a trap composed of 105 places in 163 ms of which 0 ms to minimize.
[2024-05-25 15:39:29] [INFO ] Deduced a trap composed of 107 places in 145 ms of which 1 ms to minimize.
[2024-05-25 15:39:29] [INFO ] Deduced a trap composed of 116 places in 169 ms of which 0 ms to minimize.
[2024-05-25 15:39:29] [INFO ] Deduced a trap composed of 104 places in 161 ms of which 3 ms to minimize.
[2024-05-25 15:39:29] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 1 ms to minimize.
[2024-05-25 15:39:29] [INFO ] Deduced a trap composed of 116 places in 167 ms of which 0 ms to minimize.
[2024-05-25 15:39:30] [INFO ] Deduced a trap composed of 110 places in 153 ms of which 1 ms to minimize.
[2024-05-25 15:39:30] [INFO ] Deduced a trap composed of 110 places in 155 ms of which 0 ms to minimize.
[2024-05-25 15:39:30] [INFO ] Deduced a trap composed of 111 places in 150 ms of which 1 ms to minimize.
[2024-05-25 15:39:30] [INFO ] Deduced a trap composed of 107 places in 162 ms of which 2 ms to minimize.
[2024-05-25 15:39:30] [INFO ] Deduced a trap composed of 109 places in 174 ms of which 0 ms to minimize.
[2024-05-25 15:39:31] [INFO ] Deduced a trap composed of 108 places in 171 ms of which 1 ms to minimize.
[2024-05-25 15:39:31] [INFO ] Deduced a trap composed of 107 places in 166 ms of which 1 ms to minimize.
[2024-05-25 15:39:31] [INFO ] Deduced a trap composed of 119 places in 163 ms of which 0 ms to minimize.
[2024-05-25 15:39:31] [INFO ] Deduced a trap composed of 109 places in 152 ms of which 1 ms to minimize.
[2024-05-25 15:39:31] [INFO ] Deduced a trap composed of 111 places in 159 ms of which 2 ms to minimize.
[2024-05-25 15:39:31] [INFO ] Deduced a trap composed of 109 places in 157 ms of which 5 ms to minimize.
[2024-05-25 15:39:32] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 1 ms to minimize.
[2024-05-25 15:39:32] [INFO ] Deduced a trap composed of 110 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:39:32] [INFO ] Deduced a trap composed of 109 places in 171 ms of which 0 ms to minimize.
[2024-05-25 15:39:32] [INFO ] Deduced a trap composed of 108 places in 160 ms of which 2 ms to minimize.
[2024-05-25 15:39:32] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 5610 ms
[2024-05-25 15:39:33] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 1 ms to minimize.
[2024-05-25 15:39:33] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 1 ms to minimize.
[2024-05-25 15:39:33] [INFO ] Deduced a trap composed of 109 places in 188 ms of which 0 ms to minimize.
[2024-05-25 15:39:33] [INFO ] Deduced a trap composed of 112 places in 158 ms of which 1 ms to minimize.
[2024-05-25 15:39:33] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 0 ms to minimize.
[2024-05-25 15:39:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1125 ms
[2024-05-25 15:39:34] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2024-05-25 15:39:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2024-05-25 15:39:34] [INFO ] After 10797ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 253 ms.
[2024-05-25 15:39:34] [INFO ] After 11359ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 175 ms.
Support contains 20 out of 605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 525/525 transitions.
Graph (trivial) has 270 edges and 605 vertex of which 6 / 605 are part of one of the 1 SCC in 9 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1322 edges and 600 vertex of which 599 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 599 transition count 453
Reduce places removed 64 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 67 rules applied. Total rules applied 133 place count 535 transition count 450
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 136 place count 532 transition count 450
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 119 Pre rules applied. Total rules applied 136 place count 532 transition count 331
Deduced a syphon composed of 119 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 261 rules applied. Total rules applied 397 place count 390 transition count 331
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 403 place count 384 transition count 325
Iterating global reduction 3 with 6 rules applied. Total rules applied 409 place count 384 transition count 325
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 719 place count 227 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 721 place count 226 transition count 175
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 723 place count 226 transition count 173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 725 place count 224 transition count 173
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 726 place count 224 transition count 173
Applied a total of 726 rules in 173 ms. Remains 224 /605 variables (removed 381) and now considering 173/525 (removed 352) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 224/605 places, 173/525 transitions.
Finished random walk after 867 steps, including 25 resets, run visited all 9 properties in 20 ms. (steps per millisecond=43 )
Parikh walk visited 0 properties in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 547 stabilizing places and 477 stable transitions
Graph (complete) has 1329 edges and 605 vertex of which 603 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 525/525 transitions.
Graph (trivial) has 294 edges and 605 vertex of which 6 / 605 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 1323 edges and 600 vertex of which 598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 597 transition count 442
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 522 transition count 442
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 152 place count 522 transition count 318
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 273 rules applied. Total rules applied 425 place count 373 transition count 318
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 442 place count 356 transition count 301
Ensure Unique test removed 1 places
Iterating global reduction 2 with 18 rules applied. Total rules applied 460 place count 355 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 460 place count 355 transition count 300
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 462 place count 354 transition count 300
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 772 place count 197 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 774 place count 196 transition count 150
Applied a total of 774 rules in 112 ms. Remains 196 /605 variables (removed 409) and now considering 150/525 (removed 375) transitions.
// Phase 1: matrix 150 rows 196 cols
[2024-05-25 15:39:35] [INFO ] Computed 87 invariants in 9 ms
[2024-05-25 15:39:35] [INFO ] Implicit Places using invariants in 178 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 182 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/605 places, 150/525 transitions.
Applied a total of 0 rules in 11 ms. Remains 168 /168 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 306 ms. Remains : 168/605 places, 150/525 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-01 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:(AND (NEQ s11 0) (NEQ s118 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-01 finished in 592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(X(p0)) U p1))))'
Support contains 2 out of 605 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 525/525 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 604 transition count 525
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 586 transition count 507
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 586 transition count 507
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 579 transition count 500
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 579 transition count 500
Applied a total of 51 rules in 37 ms. Remains 579 /605 variables (removed 26) and now considering 500/525 (removed 25) transitions.
// Phase 1: matrix 500 rows 579 cols
[2024-05-25 15:39:35] [INFO ] Computed 117 invariants in 11 ms
[2024-05-25 15:39:36] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-25 15:39:36] [INFO ] Invariant cache hit.
[2024-05-25 15:39:36] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
[2024-05-25 15:39:36] [INFO ] Invariant cache hit.
[2024-05-25 15:39:36] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 579/605 places, 500/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1188 ms. Remains : 579/605 places, 500/525 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s119 0) (EQ s214 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 661 ms.
Product exploration explored 100000 steps with 50000 reset in 561 ms.
Computed a total of 522 stabilizing places and 453 stable transitions
Graph (complete) has 1294 edges and 579 vertex of which 578 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 522 stabilizing places and 453 stable transitions
Detected a total of 522/579 stabilizing places and 453/500 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 48 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-19-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-19-LTLCardinality-03 finished in 2574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 6 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 525/525 transitions.
Graph (trivial) has 288 edges and 605 vertex of which 6 / 605 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 1323 edges and 600 vertex of which 599 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 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 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 598 transition count 445
Reduce places removed 72 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 73 rules applied. Total rules applied 147 place count 526 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 525 transition count 444
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 123 Pre rules applied. Total rules applied 148 place count 525 transition count 321
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 418 place count 378 transition count 321
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 433 place count 363 transition count 306
Ensure Unique test removed 1 places
Iterating global reduction 3 with 16 rules applied. Total rules applied 449 place count 362 transition count 306
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 759 place count 205 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 761 place count 204 transition count 156
Applied a total of 761 rules in 116 ms. Remains 204 /605 variables (removed 401) and now considering 156/525 (removed 369) transitions.
// Phase 1: matrix 156 rows 204 cols
[2024-05-25 15:39:38] [INFO ] Computed 89 invariants in 3 ms
[2024-05-25 15:39:38] [INFO ] Implicit Places using invariants in 349 ms returned [1, 2, 6, 7, 15, 16, 17, 18, 19, 20, 23, 24, 25, 26, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 161]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 351 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 176/605 places, 156/525 transitions.
Applied a total of 0 rules in 6 ms. Remains 176 /176 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 476 ms. Remains : 176/605 places, 156/525 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s102 0) (EQ s150 1)), p1:(AND (OR (EQ s64 0) (EQ s14 1)) (EQ s2 0) (EQ s147 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-05 finished in 637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 525/525 transitions.
Graph (trivial) has 295 edges and 605 vertex of which 6 / 605 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 1323 edges and 600 vertex of which 598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 78 place count 597 transition count 441
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 154 place count 521 transition count 441
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 154 place count 521 transition count 318
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 425 place count 373 transition count 318
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 442 place count 356 transition count 301
Ensure Unique test removed 1 places
Iterating global reduction 2 with 18 rules applied. Total rules applied 460 place count 355 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 460 place count 355 transition count 300
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 462 place count 354 transition count 300
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Deduced a syphon composed of 152 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 770 place count 198 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 772 place count 197 transition count 151
Applied a total of 772 rules in 83 ms. Remains 197 /605 variables (removed 408) and now considering 151/525 (removed 374) transitions.
// Phase 1: matrix 151 rows 197 cols
[2024-05-25 15:39:39] [INFO ] Computed 87 invariants in 10 ms
[2024-05-25 15:39:39] [INFO ] Implicit Places using invariants in 190 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 193 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 169/605 places, 151/525 transitions.
Applied a total of 0 rules in 5 ms. Remains 169 /169 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 283 ms. Remains : 169/605 places, 151/525 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s34 0) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-06 finished in 355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 525/525 transitions.
Graph (trivial) has 294 edges and 605 vertex of which 6 / 605 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 1323 edges and 600 vertex of which 598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 78 place count 597 transition count 441
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 154 place count 521 transition count 441
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 154 place count 521 transition count 318
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 425 place count 373 transition count 318
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 442 place count 356 transition count 301
Ensure Unique test removed 1 places
Iterating global reduction 2 with 18 rules applied. Total rules applied 460 place count 355 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 460 place count 355 transition count 300
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 462 place count 354 transition count 300
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 772 place count 197 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 774 place count 196 transition count 150
Applied a total of 774 rules in 50 ms. Remains 196 /605 variables (removed 409) and now considering 150/525 (removed 375) transitions.
// Phase 1: matrix 150 rows 196 cols
[2024-05-25 15:39:39] [INFO ] Computed 87 invariants in 4 ms
[2024-05-25 15:39:39] [INFO ] Implicit Places using invariants in 131 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 133 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/605 places, 150/525 transitions.
Applied a total of 0 rules in 4 ms. Remains 168 /168 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 190 ms. Remains : 168/605 places, 150/525 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-07 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:(AND (NEQ s120 0) (NEQ s158 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-07 finished in 285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 525/525 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 604 transition count 525
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 587 transition count 508
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 587 transition count 508
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 581 transition count 502
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 581 transition count 502
Applied a total of 47 rules in 35 ms. Remains 581 /605 variables (removed 24) and now considering 502/525 (removed 23) transitions.
// Phase 1: matrix 502 rows 581 cols
[2024-05-25 15:39:39] [INFO ] Computed 117 invariants in 6 ms
[2024-05-25 15:39:39] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-25 15:39:39] [INFO ] Invariant cache hit.
[2024-05-25 15:39:40] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2024-05-25 15:39:40] [INFO ] Invariant cache hit.
[2024-05-25 15:39:40] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 581/605 places, 502/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1139 ms. Remains : 581/605 places, 502/525 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s221 0) (EQ s530 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-19-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-08 finished in 1261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1&&X(!p0)))))'
Support contains 3 out of 605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 525/525 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 604 transition count 525
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 586 transition count 507
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 586 transition count 507
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 580 transition count 501
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 580 transition count 501
Applied a total of 49 rules in 32 ms. Remains 580 /605 variables (removed 25) and now considering 501/525 (removed 24) transitions.
// Phase 1: matrix 501 rows 580 cols
[2024-05-25 15:39:40] [INFO ] Computed 117 invariants in 8 ms
[2024-05-25 15:39:41] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-25 15:39:41] [INFO ] Invariant cache hit.
[2024-05-25 15:39:41] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
[2024-05-25 15:39:41] [INFO ] Invariant cache hit.
[2024-05-25 15:39:42] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 580/605 places, 501/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1272 ms. Remains : 580/605 places, 501/525 transitions.
Stuttering acceptance computed with spot in 281 ms :[p0, p0, p0, (OR (NOT p1) p0), true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=3, aps=[p0:(OR (EQ s484 0) (EQ s406 1)), p1:(EQ s377 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 175 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-09 finished in 1583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1)||p0) U !p1)))'
Support contains 4 out of 605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 525/525 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 604 transition count 525
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 587 transition count 508
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 587 transition count 508
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 581 transition count 502
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 581 transition count 502
Applied a total of 47 rules in 49 ms. Remains 581 /605 variables (removed 24) and now considering 502/525 (removed 23) transitions.
// Phase 1: matrix 502 rows 581 cols
[2024-05-25 15:39:42] [INFO ] Computed 117 invariants in 4 ms
[2024-05-25 15:39:42] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-25 15:39:42] [INFO ] Invariant cache hit.
[2024-05-25 15:39:43] [INFO ] Implicit Places using invariants and state equation in 721 ms returned []
Implicit Place search using SMT with State Equation took 980 ms to find 0 implicit places.
[2024-05-25 15:39:43] [INFO ] Invariant cache hit.
[2024-05-25 15:39:43] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 581/605 places, 502/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1366 ms. Remains : 581/605 places, 502/525 transitions.
Stuttering acceptance computed with spot in 116 ms :[p1, p1, true]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s159 0) (EQ s181 1)), p0:(OR (EQ s114 0) (EQ s539 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 171 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-13 finished in 1511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 525/525 transitions.
Graph (trivial) has 294 edges and 605 vertex of which 6 / 605 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 1323 edges and 600 vertex of which 598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 597 transition count 442
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 522 transition count 442
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 152 place count 522 transition count 319
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 422 place count 375 transition count 319
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 440 place count 357 transition count 301
Ensure Unique test removed 1 places
Iterating global reduction 2 with 19 rules applied. Total rules applied 459 place count 356 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 459 place count 356 transition count 300
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 461 place count 355 transition count 300
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 771 place count 198 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 773 place count 197 transition count 150
Applied a total of 773 rules in 120 ms. Remains 197 /605 variables (removed 408) and now considering 150/525 (removed 375) transitions.
// Phase 1: matrix 150 rows 197 cols
[2024-05-25 15:39:44] [INFO ] Computed 88 invariants in 1 ms
[2024-05-25 15:39:44] [INFO ] Implicit Places using invariants in 267 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 25, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 268 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/605 places, 150/525 transitions.
Applied a total of 0 rules in 4 ms. Remains 168 /168 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 392 ms. Remains : 168/605 places, 150/525 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s59 0) (NEQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-14 finished in 473 ms.
All properties solved by simple procedures.
Total runtime 25446 ms.

BK_STOP 1716651584808

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-19"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-19, 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 r065-tajo-171620415000372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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