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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K 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.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:35 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 85K 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-06-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716650492799

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-06
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:21:34] [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:21:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:21:34] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-05-25 15:21:34] [INFO ] Transformed 376 places.
[2024-05-25 15:21:34] [INFO ] Transformed 297 transitions.
[2024-05-25 15:21:34] [INFO ] Found NUPN structural information;
[2024-05-25 15:21:34] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 296
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 40 place count 335 transition count 258
Iterating global reduction 1 with 38 rules applied. Total rules applied 78 place count 335 transition count 258
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 96 place count 317 transition count 240
Iterating global reduction 1 with 18 rules applied. Total rules applied 114 place count 317 transition count 240
Applied a total of 114 rules in 103 ms. Remains 317 /375 variables (removed 58) and now considering 240/296 (removed 56) transitions.
// Phase 1: matrix 240 rows 317 cols
[2024-05-25 15:21:35] [INFO ] Computed 79 invariants in 22 ms
[2024-05-25 15:21:35] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-25 15:21:35] [INFO ] Invariant cache hit.
[2024-05-25 15:21:35] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2024-05-25 15:21:35] [INFO ] Invariant cache hit.
[2024-05-25 15:21:35] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 317/375 places, 240/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1002 ms. Remains : 317/375 places, 240/296 transitions.
Support contains 20 out of 317 places after structural reductions.
[2024-05-25 15:21:36] [INFO ] Flatten gal took : 53 ms
[2024-05-25 15:21:36] [INFO ] Flatten gal took : 22 ms
[2024-05-25 15:21:36] [INFO ] Input system was already deterministic with 240 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-25 15:21:36] [INFO ] Invariant cache hit.
[2024-05-25 15:21:36] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:21:37] [INFO ] [Nat]Absence check using 40 positive place invariants in 12 ms returned sat
[2024-05-25 15:21:37] [INFO ] [Nat]Absence check using 40 positive and 39 generalized place invariants in 16 ms returned sat
[2024-05-25 15:21:37] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:21:37] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 3 ms to minimize.
[2024-05-25 15:21:37] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:21:37] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-25 15:21:37] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:21:37] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-25 15:21:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 268 ms
[2024-05-25 15:21:37] [INFO ] After 386ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-25 15:21:37] [INFO ] After 520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 2 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 309 stabilizing places and 230 stable transitions
Graph (complete) has 627 edges and 317 vertex of which 316 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 240/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 311 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 311 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 310 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 310 transition count 233
Applied a total of 14 rules in 33 ms. Remains 310 /317 variables (removed 7) and now considering 233/240 (removed 7) transitions.
// Phase 1: matrix 233 rows 310 cols
[2024-05-25 15:21:37] [INFO ] Computed 79 invariants in 4 ms
[2024-05-25 15:21:37] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-25 15:21:37] [INFO ] Invariant cache hit.
[2024-05-25 15:21:38] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-05-25 15:21:38] [INFO ] Invariant cache hit.
[2024-05-25 15:21:38] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 310/317 places, 233/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 537 ms. Remains : 310/317 places, 233/240 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 233 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-02 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 s303 0) (EQ s201 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 424 ms.
Product exploration explored 100000 steps with 50000 reset in 305 ms.
Computed a total of 303 stabilizing places and 224 stable transitions
Graph (complete) has 618 edges and 310 vertex of which 309 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 303 stabilizing places and 224 stable transitions
Detected a total of 303/310 stabilizing places and 224/233 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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 43 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-06-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-06-LTLCardinality-02 finished in 1606 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 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 240/240 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 310 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 310 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 309 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 309 transition count 232
Applied a total of 16 rules in 25 ms. Remains 309 /317 variables (removed 8) and now considering 232/240 (removed 8) transitions.
// Phase 1: matrix 232 rows 309 cols
[2024-05-25 15:21:39] [INFO ] Computed 79 invariants in 12 ms
[2024-05-25 15:21:39] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-25 15:21:39] [INFO ] Invariant cache hit.
[2024-05-25 15:21:39] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2024-05-25 15:21:39] [INFO ] Invariant cache hit.
[2024-05-25 15:21:39] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/317 places, 232/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 716 ms. Remains : 309/317 places, 232/240 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-03 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 s79 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-06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-03 finished in 844 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 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 240/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 311 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 311 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 310 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 310 transition count 233
Applied a total of 14 rules in 28 ms. Remains 310 /317 variables (removed 7) and now considering 233/240 (removed 7) transitions.
// Phase 1: matrix 233 rows 310 cols
[2024-05-25 15:21:40] [INFO ] Computed 79 invariants in 5 ms
[2024-05-25 15:21:40] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-25 15:21:40] [INFO ] Invariant cache hit.
[2024-05-25 15:21:40] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2024-05-25 15:21:40] [INFO ] Invariant cache hit.
[2024-05-25 15:21:40] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 310/317 places, 233/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 625 ms. Remains : 310/317 places, 233/240 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s256 0) (EQ s249 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]]
Stuttering criterion allowed to conclude after 105 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-05 finished in 723 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||X(p1)))))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 240/240 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 310 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 310 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 309 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 309 transition count 232
Applied a total of 16 rules in 14 ms. Remains 309 /317 variables (removed 8) and now considering 232/240 (removed 8) transitions.
// Phase 1: matrix 232 rows 309 cols
[2024-05-25 15:21:40] [INFO ] Computed 79 invariants in 5 ms
[2024-05-25 15:21:40] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-25 15:21:40] [INFO ] Invariant cache hit.
[2024-05-25 15:21:41] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2024-05-25 15:21:41] [INFO ] Invariant cache hit.
[2024-05-25 15:21:41] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/317 places, 232/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 573 ms. Remains : 309/317 places, 232/240 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s292 0) (EQ s25 1)), p1:(AND (EQ s171 0) (EQ s292 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-06 finished in 759 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 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 240/240 transitions.
Graph (trivial) has 139 edges and 317 vertex of which 7 / 317 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 309 transition count 201
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 279 transition count 201
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 62 place count 279 transition count 135
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 204 place count 203 transition count 135
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 209 place count 198 transition count 130
Iterating global reduction 2 with 5 rules applied. Total rules applied 214 place count 198 transition count 130
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 388 place count 107 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 389 place count 106 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 390 place count 105 transition count 46
Applied a total of 390 rules in 86 ms. Remains 105 /317 variables (removed 212) and now considering 46/240 (removed 194) transitions.
// Phase 1: matrix 46 rows 105 cols
[2024-05-25 15:21:41] [INFO ] Computed 60 invariants in 1 ms
[2024-05-25 15:21:41] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-25 15:21:41] [INFO ] Invariant cache hit.
[2024-05-25 15:21:41] [INFO ] Implicit Places using invariants and state equation in 144 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 33, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 237 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/317 places, 46/240 transitions.
Graph (complete) has 137 edges and 66 vertex of which 58 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 58 transition count 35
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 48 transition count 35
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 44 place count 33 transition count 27
Applied a total of 44 rules in 5 ms. Remains 33 /66 variables (removed 33) and now considering 27/46 (removed 19) transitions.
// Phase 1: matrix 27 rows 33 cols
[2024-05-25 15:21:41] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 15:21:41] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-25 15:21:41] [INFO ] Invariant cache hit.
[2024-05-25 15:21:42] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/317 places, 27/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 404 ms. Remains : 33/317 places, 27/240 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-09 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 s30 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-06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-09 finished in 530 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' '!(((!p0&&G(p1)) U (p2 U X(p2))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 240/240 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 313 transition count 236
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 313 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 312 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 312 transition count 235
Applied a total of 10 rules in 16 ms. Remains 312 /317 variables (removed 5) and now considering 235/240 (removed 5) transitions.
// Phase 1: matrix 235 rows 312 cols
[2024-05-25 15:21:42] [INFO ] Computed 79 invariants in 3 ms
[2024-05-25 15:21:42] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-25 15:21:42] [INFO ] Invariant cache hit.
[2024-05-25 15:21:42] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-05-25 15:21:42] [INFO ] Invariant cache hit.
[2024-05-25 15:21:42] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/317 places, 235/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 697 ms. Remains : 312/317 places, 235/240 transitions.
Stuttering acceptance computed with spot in 357 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 p0) (AND p2 (NOT p1))), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s241 1), p0:(OR (EQ s274 0) (EQ s255 1)), p1:(OR (EQ s88 0) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-11 finished in 1082 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((p0&&G(p1))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 240/240 transitions.
Graph (trivial) has 137 edges and 317 vertex of which 7 / 317 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 309 transition count 201
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 279 transition count 201
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 62 place count 279 transition count 137
Deduced a syphon composed of 64 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 199 place count 206 transition count 137
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 204 place count 201 transition count 132
Iterating global reduction 2 with 5 rules applied. Total rules applied 209 place count 201 transition count 132
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 383 place count 110 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 384 place count 109 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 385 place count 108 transition count 48
Applied a total of 385 rules in 54 ms. Remains 108 /317 variables (removed 209) and now considering 48/240 (removed 192) transitions.
// Phase 1: matrix 48 rows 108 cols
[2024-05-25 15:21:43] [INFO ] Computed 61 invariants in 1 ms
[2024-05-25 15:21:43] [INFO ] Implicit Places using invariants in 88 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/317 places, 48/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 107 /107 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 151 ms. Remains : 107/317 places, 48/240 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s31 1), p1:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-14 finished in 261 ms.
All properties solved by simple procedures.
Total runtime 8806 ms.

BK_STOP 1716650503647

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

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