Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690400483.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BusinessProcesses-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690400483
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 85K Mar 5 18:22 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-05-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678360201601

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-05
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 11:10:03] [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]
[2023-03-09 11:10:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:10:03] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-09 11:10:03] [INFO ] Transformed 368 places.
[2023-03-09 11:10:03] [INFO ] Transformed 319 transitions.
[2023-03-09 11:10:03] [INFO ] Found NUPN structural information;
[2023-03-09 11:10:03] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 115 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-05-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 366 transition count 318
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 58 place count 309 transition count 261
Iterating global reduction 1 with 57 rules applied. Total rules applied 115 place count 309 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 116 place count 309 transition count 260
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 145 place count 280 transition count 231
Iterating global reduction 2 with 29 rules applied. Total rules applied 174 place count 280 transition count 231
Applied a total of 174 rules in 62 ms. Remains 280 /367 variables (removed 87) and now considering 231/318 (removed 87) transitions.
// Phase 1: matrix 231 rows 280 cols
[2023-03-09 11:10:03] [INFO ] Computed 56 place invariants in 17 ms
[2023-03-09 11:10:03] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-09 11:10:03] [INFO ] Invariant cache hit.
[2023-03-09 11:10:04] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-09 11:10:04] [INFO ] Invariant cache hit.
[2023-03-09 11:10:04] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 280/367 places, 231/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 658 ms. Remains : 280/367 places, 231/318 transitions.
Support contains 22 out of 280 places after structural reductions.
[2023-03-09 11:10:04] [INFO ] Flatten gal took : 37 ms
[2023-03-09 11:10:04] [INFO ] Flatten gal took : 14 ms
[2023-03-09 11:10:04] [INFO ] Input system was already deterministic with 231 transitions.
Incomplete random walk after 10000 steps, including 95 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :2
Running SMT prover for 4 properties.
[2023-03-09 11:10:05] [INFO ] Invariant cache hit.
[2023-03-09 11:10:05] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 11:10:05] [INFO ] [Nat]Absence check using 56 positive place invariants in 11 ms returned sat
[2023-03-09 11:10:05] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 11:10:05] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 4 ms to minimize.
[2023-03-09 11:10:05] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2023-03-09 11:10:05] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2023-03-09 11:10:05] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
[2023-03-09 11:10:05] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2023-03-09 11:10:05] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2023-03-09 11:10:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 418 ms
[2023-03-09 11:10:05] [INFO ] After 599ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-09 11:10:05] [INFO ] After 733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 217 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=217 )
Parikh walk visited 4 properties in 12 ms.
FORMULA BusinessProcesses-PT-05-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-05-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 274 stabilizing places and 223 stable transitions
Graph (complete) has 595 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(p1)))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 231/231 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 231
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 271 transition count 223
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 271 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 268 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 268 transition count 220
Applied a total of 23 rules in 21 ms. Remains 268 /280 variables (removed 12) and now considering 220/231 (removed 11) transitions.
// Phase 1: matrix 220 rows 268 cols
[2023-03-09 11:10:06] [INFO ] Computed 55 place invariants in 3 ms
[2023-03-09 11:10:06] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-09 11:10:06] [INFO ] Invariant cache hit.
[2023-03-09 11:10:06] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-09 11:10:06] [INFO ] Invariant cache hit.
[2023-03-09 11:10:06] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/280 places, 220/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 463 ms. Remains : 268/280 places, 220/231 transitions.
Stuttering acceptance computed with spot in 348 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s21 0) (EQ s187 1)), p1:(OR (EQ s94 0) (EQ s120 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 347 ms.
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Computed a total of 262 stabilizing places and 212 stable transitions
Graph (complete) has 575 edges and 268 vertex of which 267 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 262 stabilizing places and 212 stable transitions
Detected a total of 262/268 stabilizing places and 212/220 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 190 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-05-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-05-LTLCardinality-03 finished in 1674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 231/231 transitions.
Graph (trivial) has 145 edges and 280 vertex of which 6 / 280 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 588 edges and 275 vertex of which 273 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 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 34 place count 272 transition count 191
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 240 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 239 transition count 190
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 68 place count 239 transition count 134
Deduced a syphon composed of 56 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 192 place count 171 transition count 134
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 200 place count 163 transition count 126
Iterating global reduction 3 with 8 rules applied. Total rules applied 208 place count 163 transition count 126
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 155 rules applied. Total rules applied 363 place count 84 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 364 place count 83 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 365 place count 82 transition count 49
Applied a total of 365 rules in 60 ms. Remains 82 /280 variables (removed 198) and now considering 49/231 (removed 182) transitions.
// Phase 1: matrix 49 rows 82 cols
[2023-03-09 11:10:07] [INFO ] Computed 39 place invariants in 0 ms
[2023-03-09 11:10:07] [INFO ] Implicit Places using invariants in 65 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/280 places, 49/231 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 81/280 places, 49/231 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s20 0) (EQ s15 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 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLCardinality-07 finished in 227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G((X(p0) U p1)))&&p2))))'
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 231/231 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 231
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 272 transition count 224
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 272 transition count 224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 269 transition count 221
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 269 transition count 221
Applied a total of 21 rules in 15 ms. Remains 269 /280 variables (removed 11) and now considering 221/231 (removed 10) transitions.
// Phase 1: matrix 221 rows 269 cols
[2023-03-09 11:10:07] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-09 11:10:08] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-09 11:10:08] [INFO ] Invariant cache hit.
[2023-03-09 11:10:08] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-03-09 11:10:08] [INFO ] Invariant cache hit.
[2023-03-09 11:10:08] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/280 places, 221/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 460 ms. Remains : 269/280 places, 221/231 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s112 0) (EQ s199 1)), p1:(EQ s62 1), p0:(OR (EQ s242 0) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLCardinality-10 finished in 747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 231/231 transitions.
Graph (trivial) has 143 edges and 280 vertex of which 6 / 280 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.
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 274 transition count 192
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 242 transition count 192
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 65 place count 242 transition count 135
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 127 rules applied. Total rules applied 192 place count 172 transition count 135
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 199 place count 165 transition count 128
Iterating global reduction 2 with 7 rules applied. Total rules applied 206 place count 165 transition count 128
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 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 365 place count 84 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 366 place count 83 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 367 place count 82 transition count 49
Applied a total of 367 rules in 33 ms. Remains 82 /280 variables (removed 198) and now considering 49/231 (removed 182) transitions.
// Phase 1: matrix 49 rows 82 cols
[2023-03-09 11:10:08] [INFO ] Computed 39 place invariants in 1 ms
[2023-03-09 11:10:08] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-09 11:10:08] [INFO ] Invariant cache hit.
[2023-03-09 11:10:08] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 155 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/280 places, 49/231 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 44 transition count 41
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 36 transition count 41
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 31 transition count 36
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 31 transition count 36
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 31 transition count 33
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 28 transition count 33
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 33 place count 27 transition count 32
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 27 transition count 32
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 44 place count 22 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 22 transition count 26
Applied a total of 45 rules in 5 ms. Remains 22 /44 variables (removed 22) and now considering 26/49 (removed 23) transitions.
// Phase 1: matrix 26 rows 22 cols
[2023-03-09 11:10:08] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 11:10:08] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-09 11:10:08] [INFO ] Invariant cache hit.
[2023-03-09 11:10:08] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/280 places, 26/231 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 252 ms. Remains : 22/280 places, 26/231 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s19 0) (EQ s1 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 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLCardinality-11 finished in 314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F(G(p1))))))'
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 231/231 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 231
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 272 transition count 224
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 272 transition count 224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 269 transition count 221
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 269 transition count 221
Applied a total of 21 rules in 13 ms. Remains 269 /280 variables (removed 11) and now considering 221/231 (removed 10) transitions.
// Phase 1: matrix 221 rows 269 cols
[2023-03-09 11:10:09] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-09 11:10:09] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-09 11:10:09] [INFO ] Invariant cache hit.
[2023-03-09 11:10:09] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2023-03-09 11:10:09] [INFO ] Invariant cache hit.
[2023-03-09 11:10:09] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/280 places, 221/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 486 ms. Remains : 269/280 places, 221/231 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s220 0) (EQ s224 1)), p1:(EQ s73 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 117 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLCardinality-12 finished in 768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 231/231 transitions.
Graph (trivial) has 144 edges and 280 vertex of which 6 / 280 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 588 edges and 275 vertex of which 273 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
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 34 place count 272 transition count 191
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 240 transition count 191
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 66 place count 240 transition count 134
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 127 rules applied. Total rules applied 193 place count 170 transition count 134
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 200 place count 163 transition count 127
Iterating global reduction 2 with 7 rules applied. Total rules applied 207 place count 163 transition count 127
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 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 366 place count 82 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 367 place count 81 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 368 place count 80 transition count 48
Applied a total of 368 rules in 26 ms. Remains 80 /280 variables (removed 200) and now considering 48/231 (removed 183) transitions.
// Phase 1: matrix 48 rows 80 cols
[2023-03-09 11:10:09] [INFO ] Computed 38 place invariants in 1 ms
[2023-03-09 11:10:09] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-09 11:10:09] [INFO ] Invariant cache hit.
[2023-03-09 11:10:09] [INFO ] Implicit Places using invariants and state equation in 82 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 136 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/280 places, 48/231 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 42 transition count 41
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 35 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 34 transition count 40
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 21 place count 29 transition count 35
Iterating global reduction 3 with 5 rules applied. Total rules applied 26 place count 29 transition count 35
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 29 place count 29 transition count 32
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 32 place count 26 transition count 32
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 42 place count 21 transition count 27
Applied a total of 42 rules in 5 ms. Remains 21 /42 variables (removed 21) and now considering 27/48 (removed 21) transitions.
// Phase 1: matrix 27 rows 21 cols
[2023-03-09 11:10:09] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 11:10:09] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-09 11:10:09] [INFO ] Invariant cache hit.
[2023-03-09 11:10:09] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/280 places, 27/231 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 224 ms. Remains : 21/280 places, 27/231 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s10 0) (EQ s18 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 3 steps with 1 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLCardinality-14 finished in 341 ms.
All properties solved by simple procedures.
Total runtime 6848 ms.

BK_STOP 1678360210245

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-5348"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-05, 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 r037-tajo-167813690400483"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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