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.r037-tajo-167813690500555.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 itstools
Input is BusinessProcesses-PT-14, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690500555
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:42 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.8K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:43 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 156K 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-14-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678363116313

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 11:58:37] [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]
[2023-03-09 11:58:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:58:38] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-03-09 11:58:38] [INFO ] Transformed 624 places.
[2023-03-09 11:58:38] [INFO ] Transformed 564 transitions.
[2023-03-09 11:58:38] [INFO ] Found NUPN structural information;
[2023-03-09 11:58:38] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BusinessProcesses-PT-14-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 95 place count 521 transition count 466
Iterating global reduction 1 with 90 rules applied. Total rules applied 185 place count 521 transition count 466
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 227 place count 479 transition count 424
Iterating global reduction 1 with 42 rules applied. Total rules applied 269 place count 479 transition count 424
Applied a total of 269 rules in 96 ms. Remains 479 /616 variables (removed 137) and now considering 424/556 (removed 132) transitions.
// Phase 1: matrix 424 rows 479 cols
[2023-03-09 11:58:38] [INFO ] Computed 94 place invariants in 29 ms
[2023-03-09 11:58:38] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-09 11:58:38] [INFO ] Invariant cache hit.
[2023-03-09 11:58:39] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
[2023-03-09 11:58:39] [INFO ] Invariant cache hit.
[2023-03-09 11:58:39] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 479/616 places, 424/556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1133 ms. Remains : 479/616 places, 424/556 transitions.
Support contains 27 out of 479 places after structural reductions.
[2023-03-09 11:58:39] [INFO ] Flatten gal took : 58 ms
[2023-03-09 11:58:39] [INFO ] Flatten gal took : 24 ms
[2023-03-09 11:58:39] [INFO ] Input system was already deterministic with 424 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 20) seen :10
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 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 12 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 11 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-09 11:58:40] [INFO ] Invariant cache hit.
[2023-03-09 11:58:41] [INFO ] [Real]Absence check using 55 positive place invariants in 15 ms returned sat
[2023-03-09 11:58:41] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 12 ms returned sat
[2023-03-09 11:58:41] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-09 11:58:41] [INFO ] [Nat]Absence check using 55 positive place invariants in 16 ms returned sat
[2023-03-09 11:58:41] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2023-03-09 11:58:41] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-09 11:58:41] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 5 ms to minimize.
[2023-03-09 11:58:41] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2023-03-09 11:58:42] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 2 ms to minimize.
[2023-03-09 11:58:42] [INFO ] Deduced a trap composed of 115 places in 104 ms of which 1 ms to minimize.
[2023-03-09 11:58:42] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 1 ms to minimize.
[2023-03-09 11:58:42] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2023-03-09 11:58:42] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2023-03-09 11:58:42] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2023-03-09 11:58:42] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 1 ms to minimize.
[2023-03-09 11:58:42] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 1 ms to minimize.
[2023-03-09 11:58:43] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 1 ms to minimize.
[2023-03-09 11:58:43] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 1 ms to minimize.
[2023-03-09 11:58:43] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 1 ms to minimize.
[2023-03-09 11:58:43] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 1 ms to minimize.
[2023-03-09 11:58:44] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 1 ms to minimize.
[2023-03-09 11:58:44] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 1 ms to minimize.
[2023-03-09 11:58:44] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 0 ms to minimize.
[2023-03-09 11:58:44] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 1 ms to minimize.
[2023-03-09 11:58:44] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2023-03-09 11:58:44] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2956 ms
[2023-03-09 11:58:44] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 1 ms to minimize.
[2023-03-09 11:58:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-09 11:58:45] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
[2023-03-09 11:58:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2023-03-09 11:58:45] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2023-03-09 11:58:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-09 11:58:45] [INFO ] Deduced a trap composed of 90 places in 192 ms of which 1 ms to minimize.
[2023-03-09 11:58:45] [INFO ] Deduced a trap composed of 93 places in 163 ms of which 1 ms to minimize.
[2023-03-09 11:58:45] [INFO ] Deduced a trap composed of 97 places in 162 ms of which 1 ms to minimize.
[2023-03-09 11:58:46] [INFO ] Deduced a trap composed of 91 places in 206 ms of which 1 ms to minimize.
[2023-03-09 11:58:46] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 1 ms to minimize.
[2023-03-09 11:58:46] [INFO ] Deduced a trap composed of 83 places in 195 ms of which 0 ms to minimize.
[2023-03-09 11:58:46] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 1 ms to minimize.
[2023-03-09 11:58:46] [INFO ] Deduced a trap composed of 87 places in 179 ms of which 1 ms to minimize.
[2023-03-09 11:58:47] [INFO ] Deduced a trap composed of 91 places in 163 ms of which 1 ms to minimize.
[2023-03-09 11:58:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1844 ms
[2023-03-09 11:58:47] [INFO ] Deduced a trap composed of 85 places in 163 ms of which 1 ms to minimize.
[2023-03-09 11:58:47] [INFO ] Deduced a trap composed of 86 places in 154 ms of which 0 ms to minimize.
[2023-03-09 11:58:47] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 1 ms to minimize.
[2023-03-09 11:58:47] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 4 ms to minimize.
[2023-03-09 11:58:48] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 1 ms to minimize.
[2023-03-09 11:58:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 850 ms
[2023-03-09 11:58:48] [INFO ] After 6753ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 279 ms.
[2023-03-09 11:58:48] [INFO ] After 7273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 4 properties in 112 ms.
Support contains 11 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 424/424 transitions.
Graph (trivial) has 215 edges and 479 vertex of which 6 / 479 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1081 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 473 transition count 369
Reduce places removed 47 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 426 transition count 367
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 424 transition count 367
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 100 place count 424 transition count 272
Deduced a syphon composed of 95 places in 9 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 207 rules applied. Total rules applied 307 place count 312 transition count 272
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 313 place count 306 transition count 266
Iterating global reduction 3 with 6 rules applied. Total rules applied 319 place count 306 transition count 266
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 571 place count 178 transition count 142
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 573 place count 177 transition count 146
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 575 place count 177 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 577 place count 175 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 578 place count 174 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 579 place count 173 transition count 143
Applied a total of 579 rules in 172 ms. Remains 173 /479 variables (removed 306) and now considering 143/424 (removed 281) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 173/479 places, 143/424 transitions.
Incomplete random walk after 10000 steps, including 389 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :5
Finished Best-First random walk after 1595 steps, including 14 resets, run visited all 1 properties in 4 ms. (steps per millisecond=398 )
Computed a total of 129 stabilizing places and 122 stable transitions
Graph (complete) has 1088 edges and 479 vertex of which 478 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Graph (trivial) has 224 edges and 479 vertex of which 6 / 479 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 1082 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 472 transition count 367
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 423 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 422 transition count 366
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 102 place count 422 transition count 266
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 319 place count 305 transition count 266
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 328 place count 296 transition count 257
Iterating global reduction 3 with 9 rules applied. Total rules applied 337 place count 296 transition count 257
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 588 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 590 place count 167 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 591 place count 166 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 592 place count 165 transition count 137
Applied a total of 592 rules in 139 ms. Remains 165 /479 variables (removed 314) and now considering 137/424 (removed 287) transitions.
// Phase 1: matrix 137 rows 165 cols
[2023-03-09 11:58:49] [INFO ] Computed 71 place invariants in 6 ms
[2023-03-09 11:58:49] [INFO ] Implicit Places using invariants in 195 ms returned [16, 17, 21, 22, 23, 24, 25, 26, 49, 50, 51, 52]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 197 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/479 places, 137/424 transitions.
Applied a total of 0 rules in 7 ms. Remains 153 /153 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 343 ms. Remains : 153/479 places, 137/424 transitions.
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s13 0) (EQ s147 1)), p0:(AND (EQ s8 1) (OR (EQ s13 0) (EQ s147 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 3 reset in 5 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-00 finished in 747 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))'
Support contains 1 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Graph (trivial) has 226 edges and 479 vertex of which 6 / 479 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 1082 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 472 transition count 366
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 422 transition count 366
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 102 place count 422 transition count 265
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 321 place count 304 transition count 265
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 330 place count 295 transition count 256
Iterating global reduction 2 with 9 rules applied. Total rules applied 339 place count 295 transition count 256
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 594 place count 165 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 596 place count 164 transition count 135
Applied a total of 596 rules in 53 ms. Remains 164 /479 variables (removed 315) and now considering 135/424 (removed 289) transitions.
// Phase 1: matrix 135 rows 164 cols
[2023-03-09 11:58:50] [INFO ] Computed 72 place invariants in 2 ms
[2023-03-09 11:58:50] [INFO ] Implicit Places using invariants in 188 ms returned [1, 2, 3, 6, 7, 8, 15, 16, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51, 52]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 190 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/479 places, 135/424 transitions.
Applied a total of 0 rules in 28 ms. Remains 145 /145 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 271 ms. Remains : 145/479 places, 135/424 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-03 finished in 333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Graph (trivial) has 226 edges and 479 vertex of which 6 / 479 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 1082 edges and 474 vertex of which 473 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 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 472 transition count 366
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 422 transition count 366
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 102 place count 422 transition count 264
Deduced a syphon composed of 102 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 323 place count 303 transition count 264
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 333 place count 293 transition count 254
Iterating global reduction 2 with 10 rules applied. Total rules applied 343 place count 293 transition count 254
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 593 place count 166 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 595 place count 165 transition count 135
Applied a total of 595 rules in 59 ms. Remains 165 /479 variables (removed 314) and now considering 135/424 (removed 289) transitions.
// Phase 1: matrix 135 rows 165 cols
[2023-03-09 11:58:50] [INFO ] Computed 73 place invariants in 1 ms
[2023-03-09 11:58:50] [INFO ] Implicit Places using invariants in 178 ms returned [1, 2, 3, 6, 7, 8, 9, 16, 17, 21, 22, 23, 24, 25, 26, 49, 50, 51, 52, 53, 122]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 180 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/479 places, 135/424 transitions.
Applied a total of 0 rules in 6 ms. Remains 144 /144 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 246 ms. Remains : 144/479 places, 135/424 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-04 finished in 320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Graph (trivial) has 225 edges and 479 vertex of which 6 / 479 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 1082 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 472 transition count 366
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 422 transition count 366
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 102 place count 422 transition count 266
Deduced a syphon composed of 100 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 319 place count 305 transition count 266
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 328 place count 296 transition count 257
Iterating global reduction 2 with 9 rules applied. Total rules applied 337 place count 296 transition count 257
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 592 place count 166 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 594 place count 165 transition count 136
Applied a total of 594 rules in 46 ms. Remains 165 /479 variables (removed 314) and now considering 136/424 (removed 288) transitions.
// Phase 1: matrix 136 rows 165 cols
[2023-03-09 11:58:50] [INFO ] Computed 72 place invariants in 2 ms
[2023-03-09 11:58:50] [INFO ] Implicit Places using invariants in 167 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 48, 49, 50, 51, 52]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 169 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/479 places, 136/424 transitions.
Applied a total of 0 rules in 6 ms. Remains 145 /145 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 221 ms. Remains : 145/479 places, 136/424 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s25 0) (EQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 21830 reset in 386 ms.
Stuttering criterion allowed to conclude after 27560 steps with 6056 reset in 93 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-06 finished in 781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X((!p1 U ((p2 U (p3||G(p2)))||G(!p1))))&&p0))))'
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 470 transition count 415
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 470 transition count 415
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 467 transition count 412
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 467 transition count 412
Applied a total of 24 rules in 46 ms. Remains 467 /479 variables (removed 12) and now considering 412/424 (removed 12) transitions.
// Phase 1: matrix 412 rows 467 cols
[2023-03-09 11:58:51] [INFO ] Computed 94 place invariants in 5 ms
[2023-03-09 11:58:51] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-09 11:58:51] [INFO ] Invariant cache hit.
[2023-03-09 11:58:52] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
[2023-03-09 11:58:52] [INFO ] Invariant cache hit.
[2023-03-09 11:58:52] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 467/479 places, 412/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1386 ms. Remains : 467/479 places, 412/424 transitions.
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p0) (AND p1 (NOT p2) (NOT p3))), (OR (NOT p0) (AND p1 (NOT p2) (NOT p3))), (AND p1 (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=3 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NEQ s361 0) (NEQ s384 1)), p3:(AND (NEQ s359 1) (NEQ s231 1)), p2:(NEQ s231 1), p1:(OR (EQ s361 0) (EQ s384 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3634 reset in 255 ms.
Stack based approach found an accepted trace after 388 steps with 14 reset with depth 5 and stack size 5 in 1 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-08 finished in 1996 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&&(p1||G(p2))))||(p0&&X(p3)))))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 471 transition count 416
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 471 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 470 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 470 transition count 415
Applied a total of 18 rules in 39 ms. Remains 470 /479 variables (removed 9) and now considering 415/424 (removed 9) transitions.
// Phase 1: matrix 415 rows 470 cols
[2023-03-09 11:58:53] [INFO ] Computed 94 place invariants in 12 ms
[2023-03-09 11:58:53] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-09 11:58:53] [INFO ] Invariant cache hit.
[2023-03-09 11:58:54] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2023-03-09 11:58:54] [INFO ] Invariant cache hit.
[2023-03-09 11:58:54] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 415/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1139 ms. Remains : 470/479 places, 415/424 transitions.
Stuttering acceptance computed with spot in 504 ms :[true, (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=7 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}]], initial=2, aps=[p3:(EQ s19 0), p0:(EQ s398 1), p1:(EQ s389 1), p2:(EQ s19 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, null, null, null, null, null][false, false, false, 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-14-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-10 finished in 1691 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((F(p0)&&(p1||X(G(p1))))))))'
Support contains 1 out of 479 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Graph (trivial) has 225 edges and 479 vertex of which 6 / 479 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 1082 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 472 transition count 367
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 423 transition count 367
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 100 place count 423 transition count 265
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 321 place count 304 transition count 265
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 331 place count 294 transition count 255
Iterating global reduction 2 with 10 rules applied. Total rules applied 341 place count 294 transition count 255
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 249 rules applied. Total rules applied 590 place count 167 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 592 place count 166 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 593 place count 165 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 594 place count 164 transition count 136
Applied a total of 594 rules in 96 ms. Remains 164 /479 variables (removed 315) and now considering 136/424 (removed 288) transitions.
// Phase 1: matrix 136 rows 164 cols
[2023-03-09 11:58:55] [INFO ] Computed 71 place invariants in 1 ms
[2023-03-09 11:58:55] [INFO ] Implicit Places using invariants in 129 ms returned [22, 23, 24, 25, 48, 49, 50, 51]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 132 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/479 places, 136/424 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 234 ms. Remains : 156/479 places, 136/424 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s103 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-13 finished in 302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(p1)&&F(p2)))))'
Support contains 8 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 472 transition count 417
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 472 transition count 417
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 469 transition count 414
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 469 transition count 414
Applied a total of 20 rules in 29 ms. Remains 469 /479 variables (removed 10) and now considering 414/424 (removed 10) transitions.
// Phase 1: matrix 414 rows 469 cols
[2023-03-09 11:58:55] [INFO ] Computed 94 place invariants in 3 ms
[2023-03-09 11:58:55] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-09 11:58:55] [INFO ] Invariant cache hit.
[2023-03-09 11:58:56] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2023-03-09 11:58:56] [INFO ] Invariant cache hit.
[2023-03-09 11:58:56] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 469/479 places, 414/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 920 ms. Remains : 469/479 places, 414/424 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), true]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s148 0) (EQ s298 1)), p2:(AND (EQ s308 0) (EQ s366 1) (EQ s43 0) (EQ s257 1)), p1:(OR (EQ s412 0) (EQ s49 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 149 steps with 2 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-14 finished in 1199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0) U G((p1 U p0))))))'
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 470 transition count 415
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 470 transition count 415
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 468 transition count 413
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 468 transition count 413
Applied a total of 22 rules in 38 ms. Remains 468 /479 variables (removed 11) and now considering 413/424 (removed 11) transitions.
// Phase 1: matrix 413 rows 468 cols
[2023-03-09 11:58:56] [INFO ] Computed 94 place invariants in 4 ms
[2023-03-09 11:58:56] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-09 11:58:56] [INFO ] Invariant cache hit.
[2023-03-09 11:58:57] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2023-03-09 11:58:57] [INFO ] Invariant cache hit.
[2023-03-09 11:58:57] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 468/479 places, 413/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1102 ms. Remains : 468/479 places, 413/424 transitions.
Stuttering acceptance computed with spot in 312 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT 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=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s387 0) (EQ s156 1)), p1:(OR (EQ s104 0) (EQ s443 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 376 ms.
Product exploration explored 100000 steps with 19973 reset in 311 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1071 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 403 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 432 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true]
Incomplete random walk after 10000 steps, including 68 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 733693 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 733693 steps, saw 114278 distinct states, run finished after 3004 ms. (steps per millisecond=244 ) properties seen :2
Running SMT prover for 2 properties.
[2023-03-09 11:59:02] [INFO ] Invariant cache hit.
[2023-03-09 11:59:02] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 11:59:03] [INFO ] [Nat]Absence check using 55 positive place invariants in 20 ms returned sat
[2023-03-09 11:59:03] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 17 ms returned sat
[2023-03-09 11:59:03] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 11:59:03] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2023-03-09 11:59:03] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 1 ms to minimize.
[2023-03-09 11:59:03] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 9 ms to minimize.
[2023-03-09 11:59:03] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 1 ms to minimize.
[2023-03-09 11:59:04] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 1 ms to minimize.
[2023-03-09 11:59:04] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 0 ms to minimize.
[2023-03-09 11:59:04] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 1 ms to minimize.
[2023-03-09 11:59:04] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2023-03-09 11:59:04] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 1 ms to minimize.
[2023-03-09 11:59:04] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 0 ms to minimize.
[2023-03-09 11:59:04] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 0 ms to minimize.
[2023-03-09 11:59:05] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 1 ms to minimize.
[2023-03-09 11:59:05] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 1 ms to minimize.
[2023-03-09 11:59:05] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 1 ms to minimize.
[2023-03-09 11:59:05] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 0 ms to minimize.
[2023-03-09 11:59:05] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 0 ms to minimize.
[2023-03-09 11:59:05] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 0 ms to minimize.
[2023-03-09 11:59:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 2352 ms
[2023-03-09 11:59:05] [INFO ] After 2556ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2023-03-09 11:59:05] [INFO ] After 2716ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X p0)), (G (OR p1 p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 326 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 468 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 413/413 transitions.
Graph (trivial) has 211 edges and 468 vertex of which 6 / 468 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 1065 edges and 463 vertex of which 462 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 461 transition count 359
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 415 transition count 358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 414 transition count 358
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 96 place count 414 transition count 262
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 305 place count 301 transition count 262
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 259 rules applied. Total rules applied 564 place count 169 transition count 135
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 566 place count 168 transition count 139
Applied a total of 566 rules in 45 ms. Remains 168 /468 variables (removed 300) and now considering 139/413 (removed 274) transitions.
// Phase 1: matrix 139 rows 168 cols
[2023-03-09 11:59:06] [INFO ] Computed 72 place invariants in 16 ms
[2023-03-09 11:59:06] [INFO ] Implicit Places using invariants in 118 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 20, 21, 22, 23, 24, 25, 49, 50, 51, 52, 53]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 121 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/468 places, 139/413 transitions.
Applied a total of 0 rules in 8 ms. Remains 148 /148 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 182 ms. Remains : 148/468 places, 139/413 transitions.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4339 steps, including 1067 resets, run visited all 1 properties in 30 ms. (steps per millisecond=144 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21798 reset in 168 ms.
Product exploration explored 100000 steps with 21838 reset in 188 ms.
Built C files in :
/tmp/ltsmin4290011896883116318
[2023-03-09 11:59:07] [INFO ] Computing symmetric may disable matrix : 139 transitions.
[2023-03-09 11:59:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:59:07] [INFO ] Computing symmetric may enable matrix : 139 transitions.
[2023-03-09 11:59:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:59:07] [INFO ] Computing Do-Not-Accords matrix : 139 transitions.
[2023-03-09 11:59:07] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:59:07] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4290011896883116318
Running compilation step : cd /tmp/ltsmin4290011896883116318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 506 ms.
Running link step : cd /tmp/ltsmin4290011896883116318;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin4290011896883116318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8911586527648764755.hoa' '--buchi-type=spotba'
LTSmin run took 652 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-14-LTLCardinality-15 finished in 11987 ms.
All properties solved by simple procedures.
Total runtime 30653 ms.

BK_STOP 1678363148845

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-14"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-14, 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 r037-tajo-167813690500555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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