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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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 Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 16:34 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 161K 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-17-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716651447922

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-17
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:37:30] [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:37:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:37:30] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2024-05-25 15:37:30] [INFO ] Transformed 650 places.
[2024-05-25 15:37:30] [INFO ] Transformed 580 transitions.
[2024-05-25 15:37:30] [INFO ] Found NUPN structural information;
[2024-05-25 15:37:30] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-17-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 643 transition count 576
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 85 place count 561 transition count 494
Iterating global reduction 1 with 82 rules applied. Total rules applied 167 place count 561 transition count 494
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 212 place count 516 transition count 449
Iterating global reduction 1 with 45 rules applied. Total rules applied 257 place count 516 transition count 449
Applied a total of 257 rules in 123 ms. Remains 516 /646 variables (removed 130) and now considering 449/576 (removed 127) transitions.
// Phase 1: matrix 449 rows 516 cols
[2024-05-25 15:37:30] [INFO ] Computed 105 invariants in 32 ms
[2024-05-25 15:37:31] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-25 15:37:31] [INFO ] Invariant cache hit.
[2024-05-25 15:37:31] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
[2024-05-25 15:37:31] [INFO ] Invariant cache hit.
[2024-05-25 15:37:32] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 516/646 places, 449/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1480 ms. Remains : 516/646 places, 449/576 transitions.
Support contains 35 out of 516 places after structural reductions.
[2024-05-25 15:37:32] [INFO ] Flatten gal took : 73 ms
[2024-05-25 15:37:32] [INFO ] Flatten gal took : 36 ms
[2024-05-25 15:37:32] [INFO ] Input system was already deterministic with 449 transitions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 20) seen :12
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :2
Running SMT prover for 6 properties.
[2024-05-25 15:37:33] [INFO ] Invariant cache hit.
[2024-05-25 15:37:33] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-25 15:37:33] [INFO ] [Nat]Absence check using 59 positive place invariants in 16 ms returned sat
[2024-05-25 15:37:33] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 15 ms returned sat
[2024-05-25 15:37:34] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-25 15:37:34] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 10 ms to minimize.
[2024-05-25 15:37:34] [INFO ] Deduced a trap composed of 90 places in 186 ms of which 1 ms to minimize.
[2024-05-25 15:37:34] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 2 ms to minimize.
[2024-05-25 15:37:34] [INFO ] Deduced a trap composed of 97 places in 194 ms of which 3 ms to minimize.
[2024-05-25 15:37:35] [INFO ] Deduced a trap composed of 93 places in 181 ms of which 1 ms to minimize.
[2024-05-25 15:37:35] [INFO ] Deduced a trap composed of 95 places in 166 ms of which 1 ms to minimize.
[2024-05-25 15:37:35] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 1 ms to minimize.
[2024-05-25 15:37:35] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 0 ms to minimize.
[2024-05-25 15:37:35] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-05-25 15:37:35] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-05-25 15:37:35] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 0 ms to minimize.
[2024-05-25 15:37:35] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 0 ms to minimize.
[2024-05-25 15:37:36] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 0 ms to minimize.
[2024-05-25 15:37:36] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 1 ms to minimize.
[2024-05-25 15:37:36] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-05-25 15:37:36] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2261 ms
[2024-05-25 15:37:36] [INFO ] After 2788ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 160 ms.
[2024-05-25 15:37:36] [INFO ] After 3147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 207 ms.
Support contains 8 out of 516 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 516/516 places, 449/449 transitions.
Graph (trivial) has 236 edges and 516 vertex of which 6 / 516 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1145 edges and 511 vertex of which 510 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 510 transition count 382
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 120 place count 451 transition count 382
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 120 place count 451 transition count 277
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 229 rules applied. Total rules applied 349 place count 327 transition count 277
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 358 place count 318 transition count 268
Iterating global reduction 2 with 9 rules applied. Total rules applied 367 place count 318 transition count 268
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 367 place count 318 transition count 267
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 369 place count 317 transition count 267
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 257 rules applied. Total rules applied 626 place count 186 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 628 place count 185 transition count 145
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 630 place count 185 transition count 143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 632 place count 183 transition count 143
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 635 place count 183 transition count 143
Applied a total of 635 rules in 191 ms. Remains 183 /516 variables (removed 333) and now considering 143/449 (removed 306) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 183/516 places, 143/449 transitions.
Incomplete random walk after 10000 steps, including 261 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 108 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 102 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 143 rows 183 cols
[2024-05-25 15:37:37] [INFO ] Computed 81 invariants in 3 ms
[2024-05-25 15:37:37] [INFO ] [Real]Absence check using 59 positive place invariants in 18 ms returned sat
[2024-05-25 15:37:37] [INFO ] [Real]Absence check using 59 positive and 22 generalized place invariants in 5 ms returned sat
[2024-05-25 15:37:38] [INFO ] After 94ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-25 15:37:38] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-25 15:37:38] [INFO ] After 15ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:37:38] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:37:38] [INFO ] [Nat]Absence check using 59 positive place invariants in 10 ms returned sat
[2024-05-25 15:37:38] [INFO ] [Nat]Absence check using 59 positive and 22 generalized place invariants in 15 ms returned sat
[2024-05-25 15:37:38] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:37:38] [INFO ] After 19ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 15:37:38] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:37:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-25 15:37:38] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-25 15:37:38] [INFO ] After 436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 143/143 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 183 transition count 141
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 181 transition count 141
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 181 transition count 139
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 9 place count 178 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 11 place count 177 transition count 150
Applied a total of 11 rules in 30 ms. Remains 177 /183 variables (removed 6) and now considering 150/143 (removed -7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 177/183 places, 150/143 transitions.
Incomplete random walk after 10000 steps, including 259 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 141 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 99 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Finished probabilistic random walk after 6545 steps, run visited all 2 properties in 77 ms. (steps per millisecond=85 )
Probabilistic random walk after 6545 steps, saw 2311 distinct states, run finished after 77 ms. (steps per millisecond=85 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-17-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 214 stabilizing places and 186 stable transitions
Graph (complete) has 1152 edges and 516 vertex of which 515 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.26 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 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 449/449 transitions.
Graph (trivial) has 241 edges and 516 vertex of which 6 / 516 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1146 edges and 511 vertex of which 510 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 509 transition count 381
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 449 transition count 381
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 122 place count 449 transition count 274
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 356 place count 322 transition count 274
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 367 place count 311 transition count 263
Iterating global reduction 2 with 11 rules applied. Total rules applied 378 place count 311 transition count 263
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 378 place count 311 transition count 261
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 382 place count 309 transition count 261
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 637 place count 179 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 639 place count 178 transition count 140
Applied a total of 639 rules in 88 ms. Remains 178 /516 variables (removed 338) and now considering 140/449 (removed 309) transitions.
// Phase 1: matrix 140 rows 178 cols
[2024-05-25 15:37:39] [INFO ] Computed 80 invariants in 5 ms
[2024-05-25 15:37:39] [INFO ] Implicit Places using invariants in 239 ms returned [6, 7, 10, 11, 35, 36, 37, 38, 45, 46, 47, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 256 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/516 places, 140/449 transitions.
Applied a total of 0 rules in 8 ms. Remains 159 /159 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 354 ms. Remains : 159/516 places, 140/449 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 469 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-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:(OR (EQ s9 0) (EQ s4 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]]
Product exploration explored 100000 steps with 17715 reset in 513 ms.
Product exploration explored 100000 steps with 17743 reset in 550 ms.
Computed a total of 32 stabilizing places and 24 stable transitions
Computed a total of 32 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 286 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 152 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1966 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 645 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Finished probabilistic random walk after 660 steps, run visited all 1 properties in 10 ms. (steps per millisecond=66 )
Probabilistic random walk after 660 steps, saw 296 distinct states, run finished after 11 ms. (steps per millisecond=60 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 153 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 117 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 140/140 transitions.
Applied a total of 0 rules in 16 ms. Remains 159 /159 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 159 cols
[2024-05-25 15:37:42] [INFO ] Computed 61 invariants in 2 ms
[2024-05-25 15:37:42] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-25 15:37:42] [INFO ] Invariant cache hit.
[2024-05-25 15:37:42] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:37:42] [INFO ] Implicit Places using invariants and state equation in 372 ms returned [8, 31, 33, 35, 42, 44, 46, 48, 50, 57, 59, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 583 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/159 places, 140/140 transitions.
Graph (complete) has 408 edges and 127 vertex of which 120 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 120 transition count 125
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 108 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 107 transition count 124
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 37 place count 97 transition count 92
Iterating global reduction 3 with 10 rules applied. Total rules applied 47 place count 97 transition count 92
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 49 place count 97 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 51 place count 95 transition count 90
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 53 place count 93 transition count 88
Iterating global reduction 5 with 2 rules applied. Total rules applied 55 place count 93 transition count 88
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 73 place count 82 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 77 place count 80 transition count 79
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 78 place count 80 transition count 78
Applied a total of 78 rules in 34 ms. Remains 80 /127 variables (removed 47) and now considering 78/140 (removed 62) transitions.
// Phase 1: matrix 78 rows 80 cols
[2024-05-25 15:37:43] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 15:37:43] [INFO ] Implicit Places using invariants in 91 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/159 places, 78/140 transitions.
Applied a total of 0 rules in 13 ms. Remains 79 /79 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 743 ms. Remains : 79/159 places, 78/140 transitions.
Computed a total of 14 stabilizing places and 12 stable transitions
Graph (complete) has 281 edges and 79 vertex of which 76 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Computed a total of 14 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 145 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 116 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2038 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 659 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 415 steps, run visited all 1 properties in 9 ms. (steps per millisecond=46 )
Probabilistic random walk after 415 steps, saw 202 distinct states, run finished after 9 ms. (steps per millisecond=46 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 157 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 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18208 reset in 124 ms.
Product exploration explored 100000 steps with 18120 reset in 121 ms.
Built C files in :
/tmp/ltsmin8730667418300923985
[2024-05-25 15:37:44] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2024-05-25 15:37:44] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:37:44] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2024-05-25 15:37:44] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:37:44] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2024-05-25 15:37:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:37:44] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8730667418300923985
Running compilation step : cd /tmp/ltsmin8730667418300923985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 375 ms.
Running link step : cd /tmp/ltsmin8730667418300923985;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin8730667418300923985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14770779163509294567.hoa' '--buchi-type=spotba'
LTSmin run took 110 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-17-LTLCardinality-01 finished in 5360 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||F(G(p1)))))'
Support contains 5 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 449/449 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 502 transition count 435
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 502 transition count 435
Applied a total of 28 rules in 25 ms. Remains 502 /516 variables (removed 14) and now considering 435/449 (removed 14) transitions.
// Phase 1: matrix 435 rows 502 cols
[2024-05-25 15:37:44] [INFO ] Computed 105 invariants in 5 ms
[2024-05-25 15:37:45] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-25 15:37:45] [INFO ] Invariant cache hit.
[2024-05-25 15:37:45] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
[2024-05-25 15:37:45] [INFO ] Invariant cache hit.
[2024-05-25 15:37:45] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 502/516 places, 435/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1026 ms. Remains : 502/516 places, 435/449 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (OR (EQ s1 0) (EQ s322 1)) (OR (EQ s7 0) (EQ s431 1))), p1:(NEQ s288 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 658 reset in 194 ms.
Product exploration explored 100000 steps with 656 reset in 196 ms.
Computed a total of 207 stabilizing places and 179 stable transitions
Graph (complete) has 1136 edges and 502 vertex of which 501 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 207 stabilizing places and 179 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 991485 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 991485 steps, saw 151402 distinct states, run finished after 3001 ms. (steps per millisecond=330 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:37:49] [INFO ] Invariant cache hit.
[2024-05-25 15:37:49] [INFO ] [Real]Absence check using 59 positive place invariants in 34 ms returned sat
[2024-05-25 15:37:49] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 21 ms returned sat
[2024-05-25 15:37:49] [INFO ] After 201ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:37:50] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 0 ms to minimize.
[2024-05-25 15:37:50] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2024-05-25 15:37:50] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2024-05-25 15:37:50] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:37:50] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 0 ms to minimize.
[2024-05-25 15:37:50] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-05-25 15:37:50] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2024-05-25 15:37:50] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 0 ms to minimize.
[2024-05-25 15:37:50] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 0 ms to minimize.
[2024-05-25 15:37:50] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-25 15:37:51] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1309 ms
[2024-05-25 15:37:51] [INFO ] After 1531ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:37:51] [INFO ] After 1703ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:37:51] [INFO ] [Nat]Absence check using 59 positive place invariants in 20 ms returned sat
[2024-05-25 15:37:51] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 14 ms returned sat
[2024-05-25 15:37:51] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 0 ms to minimize.
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2024-05-25 15:37:52] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2024-05-25 15:37:52] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-05-25 15:37:52] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-25 15:37:52] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2024-05-25 15:37:52] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 1 ms to minimize.
[2024-05-25 15:37:52] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-05-25 15:37:52] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-25 15:37:52] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:37:52] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-05-25 15:37:53] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:37:53] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1447 ms
[2024-05-25 15:37:53] [INFO ] After 1673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-25 15:37:53] [INFO ] After 1840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 435/435 transitions.
Graph (trivial) has 228 edges and 502 vertex of which 6 / 502 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1129 edges and 497 vertex of which 496 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 496 transition count 376
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 445 transition count 376
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 104 place count 445 transition count 269
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 338 place count 318 transition count 269
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 277 rules applied. Total rules applied 615 place count 177 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 617 place count 176 transition count 137
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 619 place count 176 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 621 place count 174 transition count 135
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 622 place count 174 transition count 135
Applied a total of 622 rules in 80 ms. Remains 174 /502 variables (removed 328) and now considering 135/435 (removed 300) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 174/502 places, 135/435 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 153 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Finished probabilistic random walk after 310 steps, run visited all 1 properties in 6 ms. (steps per millisecond=51 )
Probabilistic random walk after 310 steps, saw 176 distinct states, run finished after 7 ms. (steps per millisecond=44 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
Support contains 1 out of 502 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 : 502/502 places, 435/435 transitions.
Graph (trivial) has 226 edges and 502 vertex of which 6 / 502 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 1130 edges and 497 vertex of which 496 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 496 transition count 377
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 445 transition count 377
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 104 place count 445 transition count 272
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 229 rules applied. Total rules applied 333 place count 321 transition count 272
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 269 rules applied. Total rules applied 602 place count 184 transition count 140
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 604 place count 183 transition count 144
Applied a total of 604 rules in 53 ms. Remains 183 /502 variables (removed 319) and now considering 144/435 (removed 291) transitions.
// Phase 1: matrix 144 rows 183 cols
[2024-05-25 15:37:53] [INFO ] Computed 81 invariants in 2 ms
[2024-05-25 15:37:53] [INFO ] Implicit Places using invariants in 148 ms returned [17, 59, 60]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 150 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 180/502 places, 144/435 transitions.
Applied a total of 0 rules in 7 ms. Remains 180 /180 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 211 ms. Remains : 180/502 places, 144/435 transitions.
Computed a total of 47 stabilizing places and 33 stable transitions
Computed a total of 47 stabilizing places and 33 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1106 steps, run visited all 1 properties in 9 ms. (steps per millisecond=122 )
Probabilistic random walk after 1106 steps, saw 584 distinct states, run finished after 9 ms. (steps per millisecond=122 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Product exploration explored 100000 steps with 11797 reset in 260 ms.
Product exploration explored 100000 steps with 11755 reset in 258 ms.
Built C files in :
/tmp/ltsmin3139043818147579901
[2024-05-25 15:37:54] [INFO ] Computing symmetric may disable matrix : 144 transitions.
[2024-05-25 15:37:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:37:54] [INFO ] Computing symmetric may enable matrix : 144 transitions.
[2024-05-25 15:37:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:37:54] [INFO ] Computing Do-Not-Accords matrix : 144 transitions.
[2024-05-25 15:37:54] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:37:54] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3139043818147579901
Running compilation step : cd /tmp/ltsmin3139043818147579901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 444 ms.
Running link step : cd /tmp/ltsmin3139043818147579901;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin3139043818147579901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2308200316266024318.hoa' '--buchi-type=spotba'
LTSmin run took 249 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-17-LTLCardinality-02 finished in 10837 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(F(p0)))'
Support contains 2 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 449/449 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 502 transition count 435
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 502 transition count 435
Applied a total of 28 rules in 27 ms. Remains 502 /516 variables (removed 14) and now considering 435/449 (removed 14) transitions.
// Phase 1: matrix 435 rows 502 cols
[2024-05-25 15:37:55] [INFO ] Computed 105 invariants in 5 ms
[2024-05-25 15:37:55] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-25 15:37:55] [INFO ] Invariant cache hit.
[2024-05-25 15:37:56] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 926 ms to find 0 implicit places.
[2024-05-25 15:37:56] [INFO ] Invariant cache hit.
[2024-05-25 15:37:56] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 502/516 places, 435/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1218 ms. Remains : 502/516 places, 435/449 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s114 0) (EQ s79 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 439 ms.
Product exploration explored 100000 steps with 50000 reset in 425 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1136 edges and 502 vertex of which 501 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 26 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-17-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLCardinality-05 finished in 2247 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(p0)))'
Support contains 2 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 449/449 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 502 transition count 435
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 502 transition count 435
Applied a total of 28 rules in 24 ms. Remains 502 /516 variables (removed 14) and now considering 435/449 (removed 14) transitions.
// Phase 1: matrix 435 rows 502 cols
[2024-05-25 15:37:57] [INFO ] Computed 105 invariants in 8 ms
[2024-05-25 15:37:58] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-25 15:37:58] [INFO ] Invariant cache hit.
[2024-05-25 15:37:58] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
[2024-05-25 15:37:58] [INFO ] Invariant cache hit.
[2024-05-25 15:37:59] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 502/516 places, 435/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1208 ms. Remains : 502/516 places, 435/449 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s217 0) (EQ s391 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 36 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLCardinality-06 finished in 1350 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((X(X(p0))&&G(F(p0))&&(F(p2)||p1))))'
Support contains 4 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 449/449 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 503 transition count 436
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 503 transition count 436
Applied a total of 26 rules in 25 ms. Remains 503 /516 variables (removed 13) and now considering 436/449 (removed 13) transitions.
// Phase 1: matrix 436 rows 503 cols
[2024-05-25 15:37:59] [INFO ] Computed 105 invariants in 4 ms
[2024-05-25 15:37:59] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-25 15:37:59] [INFO ] Invariant cache hit.
[2024-05-25 15:38:00] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2024-05-25 15:38:00] [INFO ] Invariant cache hit.
[2024-05-25 15:38:00] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 503/516 places, 436/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1064 ms. Remains : 503/516 places, 436/449 transitions.
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s310 0) (EQ s314 1)), p2:(OR (EQ s310 0) (EQ s314 1)), p0:(AND (EQ s410 0) (EQ s397 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLCardinality-10 finished in 1427 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(X(F(p0))))'
Support contains 1 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 449/449 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 502 transition count 435
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 502 transition count 435
Applied a total of 28 rules in 21 ms. Remains 502 /516 variables (removed 14) and now considering 435/449 (removed 14) transitions.
// Phase 1: matrix 435 rows 502 cols
[2024-05-25 15:38:00] [INFO ] Computed 105 invariants in 5 ms
[2024-05-25 15:38:00] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-25 15:38:00] [INFO ] Invariant cache hit.
[2024-05-25 15:38:01] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2024-05-25 15:38:01] [INFO ] Invariant cache hit.
[2024-05-25 15:38:01] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 502/516 places, 435/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1089 ms. Remains : 502/516 places, 435/449 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s444 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 140 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLCardinality-12 finished in 1216 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 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 449/449 transitions.
Graph (trivial) has 241 edges and 516 vertex of which 6 / 516 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 1146 edges and 511 vertex of which 510 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 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 509 transition count 380
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 124 place count 448 transition count 380
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 124 place count 448 transition count 275
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 229 rules applied. Total rules applied 353 place count 324 transition count 275
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 364 place count 313 transition count 264
Iterating global reduction 2 with 11 rules applied. Total rules applied 375 place count 313 transition count 264
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 375 place count 313 transition count 262
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 379 place count 311 transition count 262
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 637 place count 180 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 2 with 2 rules applied. Total rules applied 639 place count 179 transition count 139
Applied a total of 639 rules in 32 ms. Remains 179 /516 variables (removed 337) and now considering 139/449 (removed 310) transitions.
// Phase 1: matrix 139 rows 179 cols
[2024-05-25 15:38:01] [INFO ] Computed 82 invariants in 1 ms
[2024-05-25 15:38:02] [INFO ] Implicit Places using invariants in 138 ms returned [1, 2, 3, 4, 7, 10, 11, 34, 35, 36, 37, 44, 45, 48, 53, 54, 55, 56, 57, 58, 59, 60, 133, 145]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 139 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/516 places, 139/449 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 175 ms. Remains : 155/516 places, 139/449 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-13 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 s2 0) (EQ s33 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 21661 reset in 171 ms.
Product exploration explored 100000 steps with 21594 reset in 234 ms.
Computed a total of 32 stabilizing places and 24 stable transitions
Computed a total of 32 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Finished random walk after 912 steps, including 244 resets, run visited all 1 properties in 2 ms. (steps per millisecond=456 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 139/139 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 139/139 (removed 0) transitions.
// Phase 1: matrix 139 rows 155 cols
[2024-05-25 15:38:02] [INFO ] Computed 58 invariants in 1 ms
[2024-05-25 15:38:02] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-25 15:38:02] [INFO ] Invariant cache hit.
[2024-05-25 15:38:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:38:03] [INFO ] Implicit Places using invariants and state equation in 235 ms returned [5, 27, 29, 31, 40, 42, 44, 46, 48, 55, 57, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 344 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/155 places, 139/139 transitions.
Graph (complete) has 397 edges and 123 vertex of which 114 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 114 transition count 123
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 102 transition count 123
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 37 place count 90 transition count 83
Iterating global reduction 2 with 12 rules applied. Total rules applied 49 place count 90 transition count 83
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 90 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 89 transition count 82
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 54 place count 86 transition count 79
Iterating global reduction 4 with 3 rules applied. Total rules applied 57 place count 86 transition count 79
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 75 place count 75 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 79 place count 73 transition count 70
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 73 transition count 69
Applied a total of 80 rules in 14 ms. Remains 73 /123 variables (removed 50) and now considering 69/139 (removed 70) transitions.
// Phase 1: matrix 69 rows 73 cols
[2024-05-25 15:38:03] [INFO ] Computed 17 invariants in 1 ms
[2024-05-25 15:38:03] [INFO ] Implicit Places using invariants in 52 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 53 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/155 places, 69/139 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 418 ms. Remains : 70/155 places, 69/139 transitions.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 7134 steps, including 1803 resets, run visited all 1 properties in 11 ms. (steps per millisecond=648 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22218 reset in 119 ms.
Product exploration explored 100000 steps with 22237 reset in 95 ms.
Built C files in :
/tmp/ltsmin16639176362071130245
[2024-05-25 15:38:03] [INFO ] Computing symmetric may disable matrix : 69 transitions.
[2024-05-25 15:38:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:38:03] [INFO ] Computing symmetric may enable matrix : 69 transitions.
[2024-05-25 15:38:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:38:03] [INFO ] Computing Do-Not-Accords matrix : 69 transitions.
[2024-05-25 15:38:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:38:03] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16639176362071130245
Running compilation step : cd /tmp/ltsmin16639176362071130245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 206 ms.
Running link step : cd /tmp/ltsmin16639176362071130245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin16639176362071130245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9326284087138632567.hoa' '--buchi-type=spotba'
LTSmin run took 256 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-17-LTLCardinality-13 finished in 2587 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(p0)) U (X(p1) U !p2))&&G(F(p3))))'
Support contains 8 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 449/449 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 505 transition count 438
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 505 transition count 438
Applied a total of 22 rules in 48 ms. Remains 505 /516 variables (removed 11) and now considering 438/449 (removed 11) transitions.
// Phase 1: matrix 438 rows 505 cols
[2024-05-25 15:38:04] [INFO ] Computed 105 invariants in 2 ms
[2024-05-25 15:38:04] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-25 15:38:04] [INFO ] Invariant cache hit.
[2024-05-25 15:38:05] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 979 ms to find 0 implicit places.
[2024-05-25 15:38:05] [INFO ] Invariant cache hit.
[2024-05-25 15:38:05] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 505/516 places, 438/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1293 ms. Remains : 505/516 places, 438/449 transitions.
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p3) p2), (NOT p3), (NOT p3), (OR p2 (AND (NOT p0) (NOT p1))), true, (NOT p0), (OR (NOT p1) p2)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(OR (EQ s223 0) (EQ s364 1)), p2:(OR (EQ s293 0) (EQ s284 1)), p0:(OR (EQ s347 0) (EQ s377 1)), p1:(OR (EQ s252 0) (EQ s426 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 384 steps with 2 reset in 1 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLCardinality-14 finished in 1612 ms.
All properties solved by simple procedures.
Total runtime 35891 ms.

BK_STOP 1716651486308

--------------------
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:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ sed s/.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-17"
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-17, 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-171620415000362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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