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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.6K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 16:36 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 141K 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-11-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716651014734

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-11
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:30:17] [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:30:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:30:17] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2024-05-25 15:30:17] [INFO ] Transformed 567 places.
[2024-05-25 15:30:17] [INFO ] Transformed 508 transitions.
[2024-05-25 15:30:17] [INFO ] Found NUPN structural information;
[2024-05-25 15:30:17] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 269 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 6 formulas.
Deduced a syphon composed of 7 places in 17 ms
Reduce places removed 7 places and 7 transitions.
FORMULA BusinessProcesses-PT-11-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 76 places :
Symmetric choice reduction at 1 with 76 rule applications. Total rules 80 place count 480 transition count 425
Iterating global reduction 1 with 76 rules applied. Total rules applied 156 place count 480 transition count 425
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 195 place count 441 transition count 386
Iterating global reduction 1 with 39 rules applied. Total rules applied 234 place count 441 transition count 386
Applied a total of 234 rules in 141 ms. Remains 441 /560 variables (removed 119) and now considering 386/501 (removed 115) transitions.
// Phase 1: matrix 386 rows 441 cols
[2024-05-25 15:30:18] [INFO ] Computed 91 invariants in 44 ms
[2024-05-25 15:30:18] [INFO ] Implicit Places using invariants in 519 ms returned []
[2024-05-25 15:30:18] [INFO ] Invariant cache hit.
[2024-05-25 15:30:19] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
[2024-05-25 15:30:19] [INFO ] Invariant cache hit.
[2024-05-25 15:30:19] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 441/560 places, 386/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1480 ms. Remains : 441/560 places, 386/501 transitions.
Support contains 18 out of 441 places after structural reductions.
[2024-05-25 15:30:20] [INFO ] Flatten gal took : 64 ms
[2024-05-25 15:30:20] [INFO ] Flatten gal took : 37 ms
[2024-05-25 15:30:20] [INFO ] Input system was already deterministic with 386 transitions.
Incomplete random walk after 10000 steps, including 75 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:30:20] [INFO ] Invariant cache hit.
[2024-05-25 15:30:20] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:30:21] [INFO ] [Nat]Absence check using 49 positive place invariants in 36 ms returned sat
[2024-05-25 15:30:21] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 20 ms returned sat
[2024-05-25 15:30:21] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:30:22] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 7 ms to minimize.
[2024-05-25 15:30:22] [INFO ] Deduced a trap composed of 22 places in 820 ms of which 27 ms to minimize.
[2024-05-25 15:30:23] [INFO ] Deduced a trap composed of 86 places in 186 ms of which 1 ms to minimize.
[2024-05-25 15:30:23] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-05-25 15:30:23] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 13 ms to minimize.
[2024-05-25 15:30:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1532 ms
[2024-05-25 15:30:23] [INFO ] After 1962ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-25 15:30:23] [INFO ] After 2427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 6 ms.
Support contains 2 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 386/386 transitions.
Graph (trivial) has 196 edges and 441 vertex of which 6 / 441 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 990 edges and 436 vertex of which 435 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 435 transition count 334
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 391 transition count 334
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 90 place count 391 transition count 241
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 292 place count 282 transition count 241
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 295 place count 279 transition count 238
Iterating global reduction 2 with 3 rules applied. Total rules applied 298 place count 279 transition count 238
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 229 rules applied. Total rules applied 527 place count 163 transition count 125
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 529 place count 162 transition count 129
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 531 place count 162 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 533 place count 160 transition count 127
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 534 place count 160 transition count 127
Applied a total of 534 rules in 137 ms. Remains 160 /441 variables (removed 281) and now considering 127/386 (removed 259) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 160/441 places, 127/386 transitions.
Finished random walk after 34 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 426 stabilizing places and 371 stable transitions
Graph (complete) has 997 edges and 441 vertex of which 440 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 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(p0)))))'
Support contains 2 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 386/386 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 438 transition count 383
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 438 transition count 383
Applied a total of 6 rules in 41 ms. Remains 438 /441 variables (removed 3) and now considering 383/386 (removed 3) transitions.
// Phase 1: matrix 383 rows 438 cols
[2024-05-25 15:30:23] [INFO ] Computed 91 invariants in 13 ms
[2024-05-25 15:30:24] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-25 15:30:24] [INFO ] Invariant cache hit.
[2024-05-25 15:30:24] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
[2024-05-25 15:30:24] [INFO ] Invariant cache hit.
[2024-05-25 15:30:25] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 438/441 places, 383/386 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1270 ms. Remains : 438/441 places, 383/386 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 342 ms :[true, true, true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NEQ s394 0) (NEQ s388 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-11-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLCardinality-00 finished in 1683 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 2 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 386/386 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 439 transition count 384
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 439 transition count 384
Applied a total of 4 rules in 28 ms. Remains 439 /441 variables (removed 2) and now considering 384/386 (removed 2) transitions.
// Phase 1: matrix 384 rows 439 cols
[2024-05-25 15:30:25] [INFO ] Computed 91 invariants in 10 ms
[2024-05-25 15:30:25] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-25 15:30:25] [INFO ] Invariant cache hit.
[2024-05-25 15:30:26] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
[2024-05-25 15:30:26] [INFO ] Invariant cache hit.
[2024-05-25 15:30:26] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 439/441 places, 384/386 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1206 ms. Remains : 439/441 places, 384/386 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-02 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:(OR (NEQ s311 1) (NEQ s243 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]]
Product exploration explored 100000 steps with 33333 reset in 394 ms.
Product exploration explored 100000 steps with 33333 reset in 345 ms.
Computed a total of 424 stabilizing places and 369 stable transitions
Graph (complete) has 993 edges and 439 vertex of which 438 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 424 stabilizing places and 369 stable transitions
Detected a total of 424/439 stabilizing places and 369/384 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-11-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLCardinality-02 finished in 2215 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 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 386/386 transitions.
Graph (trivial) has 200 edges and 441 vertex of which 6 / 441 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 991 edges and 436 vertex of which 435 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 434 transition count 332
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 388 transition count 332
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 94 place count 388 transition count 237
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 302 place count 275 transition count 237
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 305 place count 272 transition count 234
Iterating global reduction 2 with 3 rules applied. Total rules applied 308 place count 272 transition count 234
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 223 rules applied. Total rules applied 531 place count 159 transition count 124
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 533 place count 158 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 534 place count 157 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 535 place count 156 transition count 127
Applied a total of 535 rules in 49 ms. Remains 156 /441 variables (removed 285) and now considering 127/386 (removed 259) transitions.
// Phase 1: matrix 127 rows 156 cols
[2024-05-25 15:30:27] [INFO ] Computed 69 invariants in 3 ms
[2024-05-25 15:30:28] [INFO ] Implicit Places using invariants in 241 ms returned [51, 52]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 244 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/441 places, 127/386 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 302 ms. Remains : 154/441 places, 127/386 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-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:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 41 steps with 6 reset in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLCardinality-03 finished in 487 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 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 386/386 transitions.
Graph (trivial) has 199 edges and 441 vertex of which 6 / 441 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 991 edges and 436 vertex of which 435 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 434 transition count 332
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 388 transition count 332
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 94 place count 388 transition count 237
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 302 place count 275 transition count 237
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 305 place count 272 transition count 234
Iterating global reduction 2 with 3 rules applied. Total rules applied 308 place count 272 transition count 234
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 223 rules applied. Total rules applied 531 place count 159 transition count 124
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 533 place count 158 transition count 128
Applied a total of 533 rules in 37 ms. Remains 158 /441 variables (removed 283) and now considering 128/386 (removed 258) transitions.
// Phase 1: matrix 128 rows 158 cols
[2024-05-25 15:30:28] [INFO ] Computed 70 invariants in 3 ms
[2024-05-25 15:30:28] [INFO ] Implicit Places using invariants in 237 ms returned [1, 4, 5, 28, 29, 30, 31, 38, 39, 40, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 239 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/441 places, 128/386 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 284 ms. Remains : 140/441 places, 128/386 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-04 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:(EQ s89 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 75 steps with 13 reset in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLCardinality-04 finished in 423 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(p0)||X(p1)))) U G(!p2)))'
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 386/386 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 439 transition count 384
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 439 transition count 384
Applied a total of 4 rules in 57 ms. Remains 439 /441 variables (removed 2) and now considering 384/386 (removed 2) transitions.
// Phase 1: matrix 384 rows 439 cols
[2024-05-25 15:30:28] [INFO ] Computed 91 invariants in 4 ms
[2024-05-25 15:30:28] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-25 15:30:28] [INFO ] Invariant cache hit.
[2024-05-25 15:30:29] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1038 ms to find 0 implicit places.
[2024-05-25 15:30:29] [INFO ] Invariant cache hit.
[2024-05-25 15:30:30] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 439/441 places, 384/386 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1408 ms. Remains : 439/441 places, 384/386 transitions.
Stuttering acceptance computed with spot in 373 ms :[p2, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (NOT p0), (AND (NOT p0) p2 p1)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s302 0) (EQ s169 1)), p0:(OR (EQ s270 0) (EQ s19 1)), p1:(OR (EQ s138 0) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33405 reset in 314 ms.
Stack based approach found an accepted trace after 190 steps with 58 reset with depth 5 and stack size 5 in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-11-LTLCardinality-05 finished in 2123 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 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 386/386 transitions.
Graph (trivial) has 200 edges and 441 vertex of which 6 / 441 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 991 edges and 436 vertex of which 435 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 434 transition count 332
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 388 transition count 332
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 94 place count 388 transition count 237
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 302 place count 275 transition count 237
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 305 place count 272 transition count 234
Iterating global reduction 2 with 3 rules applied. Total rules applied 308 place count 272 transition count 234
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 223 rules applied. Total rules applied 531 place count 159 transition count 124
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 533 place count 158 transition count 128
Applied a total of 533 rules in 57 ms. Remains 158 /441 variables (removed 283) and now considering 128/386 (removed 258) transitions.
// Phase 1: matrix 128 rows 158 cols
[2024-05-25 15:30:30] [INFO ] Computed 70 invariants in 4 ms
[2024-05-25 15:30:31] [INFO ] Implicit Places using invariants in 261 ms returned [1, 4, 5, 29, 30, 31, 32, 40, 41, 42, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 264 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/441 places, 128/386 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 328 ms. Remains : 140/441 places, 128/386 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s14 0) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLCardinality-06 finished in 527 ms.
All properties solved by simple procedures.
Total runtime 13629 ms.

BK_STOP 1716651031586

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

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