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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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.7K 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.4K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 11 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 16:26 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 91K 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-08-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716650704959

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-08
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:25:07] [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:25:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:25:07] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-25 15:25:07] [INFO ] Transformed 393 places.
[2024-05-25 15:25:07] [INFO ] Transformed 344 transitions.
[2024-05-25 15:25:07] [INFO ] Found NUPN structural information;
[2024-05-25 15:25:07] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 146 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 2 formulas.
Deduced a syphon composed of 13 places in 9 ms
Reduce places removed 13 places and 13 transitions.
FORMULA BusinessProcesses-PT-08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 331/331 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 372 transition count 331
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 74 place count 306 transition count 265
Iterating global reduction 1 with 66 rules applied. Total rules applied 140 place count 306 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 141 place count 306 transition count 264
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 179 place count 268 transition count 226
Iterating global reduction 2 with 38 rules applied. Total rules applied 217 place count 268 transition count 226
Applied a total of 217 rules in 124 ms. Remains 268 /380 variables (removed 112) and now considering 226/331 (removed 105) transitions.
// Phase 1: matrix 226 rows 268 cols
[2024-05-25 15:25:07] [INFO ] Computed 50 invariants in 18 ms
[2024-05-25 15:25:08] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-05-25 15:25:08] [INFO ] Invariant cache hit.
[2024-05-25 15:25:08] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
[2024-05-25 15:25:08] [INFO ] Invariant cache hit.
[2024-05-25 15:25:08] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/380 places, 226/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1165 ms. Remains : 268/380 places, 226/331 transitions.
Support contains 14 out of 268 places after structural reductions.
[2024-05-25 15:25:08] [INFO ] Flatten gal took : 46 ms
[2024-05-25 15:25:08] [INFO ] Flatten gal took : 24 ms
[2024-05-25 15:25:08] [INFO ] Input system was already deterministic with 226 transitions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 533 ms. (steps per millisecond=18 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 15:25:09] [INFO ] Invariant cache hit.
[2024-05-25 15:25:09] [INFO ] [Real]Absence check using 50 positive place invariants in 41 ms returned sat
[2024-05-25 15:25:09] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 15:25:09] [INFO ] [Nat]Absence check using 50 positive place invariants in 13 ms returned sat
[2024-05-25 15:25:10] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 15:25:10] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 8 ms to minimize.
[2024-05-25 15:25:10] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-25 15:25:10] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-25 15:25:10] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-25 15:25:10] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-25 15:25:10] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:25:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 502 ms
[2024-05-25 15:25:10] [INFO ] After 763ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-25 15:25:10] [INFO ] After 982ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 2 properties in 11 ms.
Support contains 2 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 226/226 transitions.
Graph (trivial) has 137 edges and 268 vertex of which 6 / 268 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 554 edges and 263 vertex of which 262 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 262 transition count 183
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 228 transition count 183
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 70 place count 228 transition count 130
Deduced a syphon composed of 53 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 187 place count 164 transition count 130
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 191 place count 160 transition count 126
Iterating global reduction 2 with 4 rules applied. Total rules applied 195 place count 160 transition count 126
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 159 rules applied. Total rules applied 354 place count 79 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 355 place count 78 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 356 place count 77 transition count 47
Applied a total of 356 rules in 77 ms. Remains 77 /268 variables (removed 191) and now considering 47/226 (removed 179) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 77/268 places, 47/226 transitions.
Finished random walk after 185 steps, including 9 resets, run visited all 2 properties in 2 ms. (steps per millisecond=92 )
Parikh walk visited 0 properties in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-08-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 90 stabilizing places and 86 stable transitions
Graph (complete) has 566 edges and 268 vertex of which 267 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 264 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 264 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 261 transition count 219
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 261 transition count 219
Applied a total of 14 rules in 21 ms. Remains 261 /268 variables (removed 7) and now considering 219/226 (removed 7) transitions.
// Phase 1: matrix 219 rows 261 cols
[2024-05-25 15:25:11] [INFO ] Computed 50 invariants in 2 ms
[2024-05-25 15:25:12] [INFO ] Implicit Places using invariants in 1124 ms returned []
[2024-05-25 15:25:12] [INFO ] Invariant cache hit.
[2024-05-25 15:25:12] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 1426 ms to find 0 implicit places.
[2024-05-25 15:25:12] [INFO ] Invariant cache hit.
[2024-05-25 15:25:12] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 261/268 places, 219/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1591 ms. Remains : 261/268 places, 219/226 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 245 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s7 0) (EQ s254 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 412 ms.
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Computed a total of 90 stabilizing places and 86 stable transitions
Graph (complete) has 555 edges and 261 vertex of which 260 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 90 stabilizing places and 86 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 34 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-08-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-08-LTLCardinality-00 finished in 2663 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 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 226/226 transitions.
Graph (complete) has 566 edges and 268 vertex of which 267 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 266 transition count 192
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 234 transition count 190
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 232 transition count 190
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 69 place count 232 transition count 135
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 189 place count 167 transition count 135
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 194 place count 162 transition count 130
Iterating global reduction 3 with 5 rules applied. Total rules applied 199 place count 162 transition count 130
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 161 rules applied. Total rules applied 360 place count 80 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 361 place count 80 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 362 place count 79 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 363 place count 78 transition count 49
Applied a total of 363 rules in 30 ms. Remains 78 /268 variables (removed 190) and now considering 49/226 (removed 177) transitions.
// Phase 1: matrix 49 rows 78 cols
[2024-05-25 15:25:13] [INFO ] Computed 36 invariants in 0 ms
[2024-05-25 15:25:13] [INFO ] Implicit Places using invariants in 121 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/268 places, 49/226 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 159 ms. Remains : 77/268 places, 49/226 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s76 0) (EQ s62 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 14 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLCardinality-02 finished in 236 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 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 264 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 264 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 261 transition count 219
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 261 transition count 219
Applied a total of 14 rules in 14 ms. Remains 261 /268 variables (removed 7) and now considering 219/226 (removed 7) transitions.
// Phase 1: matrix 219 rows 261 cols
[2024-05-25 15:25:14] [INFO ] Computed 50 invariants in 2 ms
[2024-05-25 15:25:14] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-25 15:25:14] [INFO ] Invariant cache hit.
[2024-05-25 15:25:14] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2024-05-25 15:25:14] [INFO ] Invariant cache hit.
[2024-05-25 15:25:14] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 261/268 places, 219/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 738 ms. Remains : 261/268 places, 219/226 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-10 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 (EQ s234 0) (EQ s46 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 205 ms.
Product exploration explored 100000 steps with 33333 reset in 298 ms.
Computed a total of 90 stabilizing places and 86 stable transitions
Graph (complete) has 557 edges and 261 vertex of which 260 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 90 stabilizing places and 86 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 26 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-08-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-08-LTLCardinality-10 finished in 1469 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(X((X(p0) U p1)))))'
Support contains 3 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 264 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 264 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 261 transition count 219
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 261 transition count 219
Applied a total of 14 rules in 15 ms. Remains 261 /268 variables (removed 7) and now considering 219/226 (removed 7) transitions.
// Phase 1: matrix 219 rows 261 cols
[2024-05-25 15:25:15] [INFO ] Computed 50 invariants in 2 ms
[2024-05-25 15:25:15] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-25 15:25:15] [INFO ] Invariant cache hit.
[2024-05-25 15:25:22] [INFO ] Implicit Places using invariants and state equation in 7101 ms returned []
Implicit Place search using SMT with State Equation took 7258 ms to find 0 implicit places.
[2024-05-25 15:25:22] [INFO ] Invariant cache hit.
[2024-05-25 15:25:22] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 261/268 places, 219/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7487 ms. Remains : 261/268 places, 219/226 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s248 0) (EQ s1 1)), p0:(EQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 859 reset in 174 ms.
Stack based approach found an accepted trace after 20646 steps with 171 reset with depth 235 and stack size 208 in 54 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-08-LTLCardinality-14 finished in 7912 ms.
All properties solved by simple procedures.
Total runtime 16332 ms.

BK_STOP 1716650723692

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

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