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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 59K 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-02-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716650147674

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-02
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:15:49] [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:15:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:15:50] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2024-05-25 15:15:50] [INFO ] Transformed 262 places.
[2024-05-25 15:15:50] [INFO ] Transformed 219 transitions.
[2024-05-25 15:15:50] [INFO ] Found NUPN structural information;
[2024-05-25 15:15:50] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 204/204 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 240 transition count 204
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 32 place count 213 transition count 177
Iterating global reduction 1 with 27 rules applied. Total rules applied 59 place count 213 transition count 177
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 71 place count 201 transition count 165
Iterating global reduction 1 with 12 rules applied. Total rules applied 83 place count 201 transition count 165
Applied a total of 83 rules in 72 ms. Remains 201 /245 variables (removed 44) and now considering 165/204 (removed 39) transitions.
// Phase 1: matrix 165 rows 201 cols
[2024-05-25 15:15:50] [INFO ] Computed 38 invariants in 25 ms
[2024-05-25 15:15:50] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-25 15:15:50] [INFO ] Invariant cache hit.
[2024-05-25 15:15:50] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2024-05-25 15:15:50] [INFO ] Invariant cache hit.
[2024-05-25 15:15:51] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 201/245 places, 165/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 824 ms. Remains : 201/245 places, 165/204 transitions.
Support contains 23 out of 201 places after structural reductions.
[2024-05-25 15:15:51] [INFO ] Flatten gal took : 48 ms
[2024-05-25 15:15:51] [INFO ] Flatten gal took : 14 ms
[2024-05-25 15:15:51] [INFO ] Input system was already deterministic with 165 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 17) seen :12
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 15:15:51] [INFO ] Invariant cache hit.
[2024-05-25 15:15:52] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 15:15:52] [INFO ] [Nat]Absence check using 25 positive place invariants in 5 ms returned sat
[2024-05-25 15:15:52] [INFO ] [Nat]Absence check using 25 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-25 15:15:52] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 15:15:52] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 7 ms to minimize.
[2024-05-25 15:15:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-25 15:15:52] [INFO ] After 438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-25 15:15:52] [INFO ] After 591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 165/165 transitions.
Graph (trivial) has 98 edges and 201 vertex of which 7 / 201 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 385 edges and 195 vertex of which 193 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 193 transition count 127
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 166 transition count 127
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 56 place count 166 transition count 89
Deduced a syphon composed of 38 places in 7 ms
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 140 place count 120 transition count 89
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 143 place count 117 transition count 86
Iterating global reduction 2 with 3 rules applied. Total rules applied 146 place count 117 transition count 86
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 250 place count 64 transition count 35
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 251 place count 64 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 252 place count 63 transition count 34
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 253 place count 63 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 254 place count 62 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 255 place count 61 transition count 33
Applied a total of 255 rules in 75 ms. Remains 61 /201 variables (removed 140) and now considering 33/165 (removed 132) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 61/201 places, 33/165 transitions.
Incomplete random walk after 10000 steps, including 444 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :2
Finished Best-First random walk after 83 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=27 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 193 stabilizing places and 155 stable transitions
Graph (complete) has 393 edges and 201 vertex of which 195 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 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(X(p0)))||X(!(p0 U p1))||G(p2)))'
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 165/165 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 200 transition count 165
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 192 transition count 157
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 192 transition count 157
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 188 transition count 153
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 188 transition count 153
Applied a total of 25 rules in 24 ms. Remains 188 /201 variables (removed 13) and now considering 153/165 (removed 12) transitions.
// Phase 1: matrix 153 rows 188 cols
[2024-05-25 15:15:53] [INFO ] Computed 37 invariants in 3 ms
[2024-05-25 15:15:53] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-25 15:15:53] [INFO ] Invariant cache hit.
[2024-05-25 15:15:53] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-05-25 15:15:53] [INFO ] Invariant cache hit.
[2024-05-25 15:15:53] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/201 places, 153/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 540 ms. Remains : 188/201 places, 153/165 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 :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={} source=4 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 2}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=6 dest: 5}]], initial=3, aps=[p0:(OR (EQ s96 0) (EQ s169 1)), p1:(OR (EQ s55 0) (EQ s85 1)), p2:(AND (EQ s85 0) (EQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 296 ms.
Product exploration explored 100000 steps with 33333 reset in 278 ms.
Computed a total of 181 stabilizing places and 144 stable transitions
Graph (complete) has 375 edges and 188 vertex of which 185 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 181 stabilizing places and 144 stable transitions
Detected a total of 181/188 stabilizing places and 144/153 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 p1))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 55 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-02-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-02-LTLCardinality-02 finished in 1736 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 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 165/165 transitions.
Graph (trivial) has 100 edges and 201 vertex of which 4 / 201 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 390 edges and 198 vertex of which 192 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 191 transition count 127
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 162 transition count 127
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 60 place count 162 transition count 90
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 142 place count 117 transition count 90
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 148 place count 111 transition count 84
Iterating global reduction 2 with 6 rules applied. Total rules applied 154 place count 111 transition count 84
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 252 place count 61 transition count 36
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 253 place count 61 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 254 place count 60 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 255 place count 59 transition count 35
Applied a total of 255 rules in 28 ms. Remains 59 /201 variables (removed 142) and now considering 35/165 (removed 130) transitions.
// Phase 1: matrix 35 rows 59 cols
[2024-05-25 15:15:55] [INFO ] Computed 26 invariants in 1 ms
[2024-05-25 15:15:55] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-25 15:15:55] [INFO ] Invariant cache hit.
[2024-05-25 15:15:55] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 16, 18, 20, 21, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 122 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/201 places, 35/165 transitions.
Graph (complete) has 66 edges and 34 vertex of which 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 32 transition count 28
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 24 transition count 26
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 24 transition count 26
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 21 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 21 transition count 22
Applied a total of 24 rules in 6 ms. Remains 21 /34 variables (removed 13) and now considering 22/35 (removed 13) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-05-25 15:15:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-25 15:15:55] [INFO ] Implicit Places using invariants in 63 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/201 places, 22/165 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 transition count 21
Applied a total of 2 rules in 2 ms. Remains 19 /20 variables (removed 1) and now considering 21/22 (removed 1) transitions.
// Phase 1: matrix 21 rows 19 cols
[2024-05-25 15:15:55] [INFO ] Computed 1 invariants in 2 ms
[2024-05-25 15:15:55] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-25 15:15:55] [INFO ] Invariant cache hit.
[2024-05-25 15:15:55] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 19/201 places, 21/165 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 284 ms. Remains : 19/201 places, 21/165 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-03 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 s18 0) (EQ s14 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 22226 reset in 157 ms.
Product exploration explored 100000 steps with 22245 reset in 111 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 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 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 174 steps, including 46 resets, run visited all 1 properties in 2 ms. (steps per millisecond=87 )
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 113 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 15:15:56] [INFO ] Invariant cache hit.
[2024-05-25 15:15:56] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-25 15:15:56] [INFO ] Invariant cache hit.
[2024-05-25 15:15:56] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-25 15:15:56] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-25 15:15:56] [INFO ] Invariant cache hit.
[2024-05-25 15:15:56] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 19/19 places, 21/21 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 146 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 143 ms :[(NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
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 192 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 105 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22240 reset in 122 ms.
Product exploration explored 100000 steps with 22142 reset in 207 ms.
Built C files in :
/tmp/ltsmin14832417422509384682
[2024-05-25 15:15:57] [INFO ] Computing symmetric may disable matrix : 21 transitions.
[2024-05-25 15:15:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:15:57] [INFO ] Computing symmetric may enable matrix : 21 transitions.
[2024-05-25 15:15:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:15:57] [INFO ] Computing Do-Not-Accords matrix : 21 transitions.
[2024-05-25 15:15:57] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:15:57] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14832417422509384682
Running compilation step : cd /tmp/ltsmin14832417422509384682;'/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 266 ms.
Running link step : cd /tmp/ltsmin14832417422509384682;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin14832417422509384682;'/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/stateBased640200110909824545.hoa' '--buchi-type=spotba'
LTSmin run took 106 ms.
FORMULA BusinessProcesses-PT-02-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-02-LTLCardinality-03 finished in 3104 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 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 165/165 transitions.
Graph (trivial) has 101 edges and 201 vertex of which 7 / 201 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 386 edges and 195 vertex of which 189 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 188 transition count 125
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 161 transition count 125
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 56 place count 161 transition count 87
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 140 place count 115 transition count 87
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 145 place count 110 transition count 82
Iterating global reduction 2 with 5 rules applied. Total rules applied 150 place count 110 transition count 82
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 248 place count 60 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 249 place count 59 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 250 place count 58 transition count 33
Applied a total of 250 rules in 18 ms. Remains 58 /201 variables (removed 143) and now considering 33/165 (removed 132) transitions.
// Phase 1: matrix 33 rows 58 cols
[2024-05-25 15:15:58] [INFO ] Computed 26 invariants in 1 ms
[2024-05-25 15:15:58] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-25 15:15:58] [INFO ] Invariant cache hit.
[2024-05-25 15:15:58] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [0, 1, 4, 5, 7, 9, 12, 13, 14, 15, 16, 18, 20, 22, 23, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 150 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/201 places, 33/165 transitions.
Graph (complete) has 64 edges and 33 vertex of which 31 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 31 transition count 26
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 25 transition count 26
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 23 transition count 24
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 23 transition count 24
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 26 place count 18 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 28 place count 17 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 17 transition count 18
Applied a total of 29 rules in 4 ms. Remains 17 /33 variables (removed 16) and now considering 18/33 (removed 15) transitions.
// Phase 1: matrix 18 rows 17 cols
[2024-05-25 15:15:58] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 15:15:58] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-25 15:15:58] [INFO ] Invariant cache hit.
[2024-05-25 15:15:58] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/201 places, 18/165 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 284 ms. Remains : 17/201 places, 18/165 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-05 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 s0 0)], 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 33180 reset in 45 ms.
Product exploration explored 100000 steps with 33288 reset in 92 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Graph (complete) has 45 edges and 17 vertex of which 15 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 17 stabilizing places and 17 stable transitions
Detected a total of 17/17 stabilizing places and 17/18 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 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 65 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 3970 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1398 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 70 steps, run visited all 1 properties in 8 ms. (steps per millisecond=8 )
Probabilistic random walk after 70 steps, saw 42 distinct states, run finished after 8 ms. (steps per millisecond=8 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 202 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 56 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 1 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 15:15:59] [INFO ] Invariant cache hit.
[2024-05-25 15:15:59] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-25 15:15:59] [INFO ] Invariant cache hit.
[2024-05-25 15:15:59] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-25 15:15:59] [INFO ] Redundant transitions in 44 ms returned []
[2024-05-25 15:15:59] [INFO ] Invariant cache hit.
[2024-05-25 15:15:59] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 17/17 places, 18/18 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Graph (complete) has 45 edges and 17 vertex of which 15 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 17 stable transitions
Detected a total of 17/17 stabilizing places and 17/18 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 109 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 67 ms :[(NOT p0)]
Finished random walk after 4825 steps, including 1924 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1206 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 199 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 48976 steps with 16184 reset in 27 ms.
FORMULA BusinessProcesses-PT-02-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLCardinality-05 finished in 1761 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((F(p1)&&F(G(p2))))||p0)))'
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 165/165 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 196 transition count 160
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 196 transition count 160
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 193 transition count 157
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 193 transition count 157
Applied a total of 16 rules in 24 ms. Remains 193 /201 variables (removed 8) and now considering 157/165 (removed 8) transitions.
// Phase 1: matrix 157 rows 193 cols
[2024-05-25 15:15:59] [INFO ] Computed 38 invariants in 2 ms
[2024-05-25 15:16:00] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-25 15:16:00] [INFO ] Invariant cache hit.
[2024-05-25 15:16:00] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-05-25 15:16:00] [INFO ] Invariant cache hit.
[2024-05-25 15:16:00] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 193/201 places, 157/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 536 ms. Remains : 193/201 places, 157/165 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s167 0) (EQ s102 1)), p1:(AND (EQ s148 0) (EQ s88 1)), p2:(AND (EQ s102 0) (EQ s167 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 224 ms.
Product exploration explored 100000 steps with 50000 reset in 273 ms.
Computed a total of 186 stabilizing places and 148 stable transitions
Graph (complete) has 381 edges and 193 vertex of which 187 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 186 stabilizing places and 148 stable transitions
Detected a total of 186/193 stabilizing places and 148/157 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), true, (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 27 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-02-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-02-LTLCardinality-06 finished in 1330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((p1||F((!p0&&X(p2)))))))'
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 165/165 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 200 transition count 165
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 194 transition count 159
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 194 transition count 159
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 191 transition count 156
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 191 transition count 156
Applied a total of 19 rules in 20 ms. Remains 191 /201 variables (removed 10) and now considering 156/165 (removed 9) transitions.
// Phase 1: matrix 156 rows 191 cols
[2024-05-25 15:16:01] [INFO ] Computed 37 invariants in 1 ms
[2024-05-25 15:16:01] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-25 15:16:01] [INFO ] Invariant cache hit.
[2024-05-25 15:16:01] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-05-25 15:16:01] [INFO ] Invariant cache hit.
[2024-05-25 15:16:01] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/201 places, 156/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 349 ms. Remains : 191/201 places, 156/165 transitions.
Stuttering acceptance computed with spot in 340 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (NOT p2) p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=p0, acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s166 1)), p1:(EQ s30 1), p2:(NEQ s125 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19275 reset in 110 ms.
Stack based approach found an accepted trace after 1803 steps with 365 reset with depth 5 and stack size 5 in 3 ms.
FORMULA BusinessProcesses-PT-02-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-02-LTLCardinality-07 finished in 828 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 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 165/165 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 200 transition count 165
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 193 transition count 158
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 193 transition count 158
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 190 transition count 155
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 190 transition count 155
Applied a total of 21 rules in 7 ms. Remains 190 /201 variables (removed 11) and now considering 155/165 (removed 10) transitions.
// Phase 1: matrix 155 rows 190 cols
[2024-05-25 15:16:02] [INFO ] Computed 37 invariants in 5 ms
[2024-05-25 15:16:02] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-25 15:16:02] [INFO ] Invariant cache hit.
[2024-05-25 15:16:02] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-05-25 15:16:02] [INFO ] Invariant cache hit.
[2024-05-25 15:16:02] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/201 places, 155/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 555 ms. Remains : 190/201 places, 155/165 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-09 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:(EQ s171 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLCardinality-09 finished in 672 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((X(p1)||(p2 U (p3||G(p2)))))||p0)))'
Support contains 5 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 165/165 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 200 transition count 165
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 192 transition count 157
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 192 transition count 157
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 188 transition count 153
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 188 transition count 153
Applied a total of 25 rules in 8 ms. Remains 188 /201 variables (removed 13) and now considering 153/165 (removed 12) transitions.
// Phase 1: matrix 153 rows 188 cols
[2024-05-25 15:16:02] [INFO ] Computed 37 invariants in 3 ms
[2024-05-25 15:16:02] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-25 15:16:02] [INFO ] Invariant cache hit.
[2024-05-25 15:16:02] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-05-25 15:16:02] [INFO ] Invariant cache hit.
[2024-05-25 15:16:03] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/201 places, 153/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 421 ms. Remains : 188/201 places, 153/165 transitions.
Stuttering acceptance computed with spot in 305 ms :[true, (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND p3 p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=p3, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=p3, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 3}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(OR (EQ s119 0) (EQ s81 1)), p3:(AND (OR (EQ s59 0) (EQ s175 1)) (NEQ s44 1)), p2:(NEQ s44 1), p1:(AND (EQ s175 0) (EQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 193 ms.
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Computed a total of 181 stabilizing places and 144 stable transitions
Graph (complete) has 375 edges and 188 vertex of which 185 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 181 stabilizing places and 144 stable transitions
Detected a total of 181/188 stabilizing places and 144/153 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p0 p3 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X (X p3)), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 33 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-02-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-02-LTLCardinality-10 finished in 1153 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 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 165/165 transitions.
Graph (trivial) has 100 edges and 201 vertex of which 7 / 201 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 386 edges and 195 vertex of which 189 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 188 transition count 126
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 162 transition count 126
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 54 place count 162 transition count 86
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 142 place count 114 transition count 86
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 148 place count 108 transition count 80
Iterating global reduction 2 with 6 rules applied. Total rules applied 154 place count 108 transition count 80
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 244 place count 62 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 245 place count 61 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 246 place count 60 transition count 35
Applied a total of 246 rules in 16 ms. Remains 60 /201 variables (removed 141) and now considering 35/165 (removed 130) transitions.
// Phase 1: matrix 35 rows 60 cols
[2024-05-25 15:16:03] [INFO ] Computed 26 invariants in 1 ms
[2024-05-25 15:16:03] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-25 15:16:03] [INFO ] Invariant cache hit.
[2024-05-25 15:16:03] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [4, 5, 7, 9, 12, 13, 14, 15, 16, 34, 36, 38, 40, 42, 44]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 125 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/201 places, 35/165 transitions.
Graph (complete) has 109 edges and 45 vertex of which 43 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 43 transition count 31
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 40 transition count 31
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 12 place count 37 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 14 place count 36 transition count 28
Applied a total of 14 rules in 5 ms. Remains 36 /45 variables (removed 9) and now considering 28/35 (removed 7) transitions.
// Phase 1: matrix 28 rows 36 cols
[2024-05-25 15:16:03] [INFO ] Computed 9 invariants in 0 ms
[2024-05-25 15:16:04] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-25 15:16:04] [INFO ] Invariant cache hit.
[2024-05-25 15:16:04] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/201 places, 28/165 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 238 ms. Remains : 36/201 places, 28/165 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-11 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 s20 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 6 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-02-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLCardinality-11 finished in 307 ms.
All properties solved by simple procedures.
Total runtime 14153 ms.

BK_STOP 1716650164336

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-02"
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-02, 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-171620414800287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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