Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918500459.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 7.1K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 30 00:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 177K May 10 09:33 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-18-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652638125827

Running Version 202205111006
[2022-05-15 18:08:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 18:08:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 18:08:47] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2022-05-15 18:08:47] [INFO ] Transformed 717 places.
[2022-05-15 18:08:47] [INFO ] Transformed 642 transitions.
[2022-05-15 18:08:47] [INFO ] Found NUPN structural information;
[2022-05-15 18:08:47] [INFO ] Parsed PT model containing 717 places and 642 transitions in 250 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 15 places in 20 ms
Reduce places removed 15 places and 15 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-18-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 695 transition count 627
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 104 place count 598 transition count 530
Iterating global reduction 1 with 97 rules applied. Total rules applied 201 place count 598 transition count 530
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 202 place count 598 transition count 529
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 253 place count 547 transition count 478
Iterating global reduction 2 with 51 rules applied. Total rules applied 304 place count 547 transition count 478
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 305 place count 546 transition count 477
Iterating global reduction 2 with 1 rules applied. Total rules applied 306 place count 546 transition count 477
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 307 place count 545 transition count 476
Iterating global reduction 2 with 1 rules applied. Total rules applied 308 place count 545 transition count 476
Applied a total of 308 rules in 186 ms. Remains 545 /702 variables (removed 157) and now considering 476/627 (removed 151) transitions.
// Phase 1: matrix 476 rows 545 cols
[2022-05-15 18:08:48] [INFO ] Computed 107 place invariants in 30 ms
[2022-05-15 18:08:48] [INFO ] Implicit Places using invariants in 338 ms returned []
// Phase 1: matrix 476 rows 545 cols
[2022-05-15 18:08:48] [INFO ] Computed 107 place invariants in 11 ms
[2022-05-15 18:08:49] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
// Phase 1: matrix 476 rows 545 cols
[2022-05-15 18:08:49] [INFO ] Computed 107 place invariants in 13 ms
[2022-05-15 18:08:49] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 545/702 places, 476/627 transitions.
Finished structural reductions, in 1 iterations. Remains : 545/702 places, 476/627 transitions.
Support contains 29 out of 545 places after structural reductions.
[2022-05-15 18:08:49] [INFO ] Flatten gal took : 80 ms
[2022-05-15 18:08:49] [INFO ] Flatten gal took : 37 ms
[2022-05-15 18:08:49] [INFO ] Input system was already deterministic with 476 transitions.
Support contains 25 out of 545 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 52 resets, run finished after 531 ms. (steps per millisecond=18 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 476 rows 545 cols
[2022-05-15 18:08:50] [INFO ] Computed 107 place invariants in 5 ms
[2022-05-15 18:08:50] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 18:08:50] [INFO ] [Nat]Absence check using 66 positive place invariants in 24 ms returned sat
[2022-05-15 18:08:50] [INFO ] [Nat]Absence check using 66 positive and 41 generalized place invariants in 10 ms returned sat
[2022-05-15 18:08:51] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2022-05-15 18:08:51] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 7 ms to minimize.
[2022-05-15 18:08:51] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2022-05-15 18:08:51] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2022-05-15 18:08:51] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2022-05-15 18:08:51] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2022-05-15 18:08:51] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2022-05-15 18:08:51] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2022-05-15 18:08:52] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2022-05-15 18:08:52] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2022-05-15 18:08:52] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2022-05-15 18:08:52] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 0 ms to minimize.
[2022-05-15 18:08:52] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1048 ms
[2022-05-15 18:08:52] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 1 ms to minimize.
[2022-05-15 18:08:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-15 18:08:52] [INFO ] After 1610ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 102 ms.
[2022-05-15 18:08:52] [INFO ] After 1903ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 7 out of 545 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 545/545 places, 476/476 transitions.
Graph (trivial) has 256 edges and 545 vertex of which 6 / 545 are part of one of the 1 SCC in 9 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1211 edges and 540 vertex of which 538 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 538 transition count 406
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 476 transition count 405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 475 transition count 405
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 128 place count 475 transition count 292
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 379 place count 337 transition count 292
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 388 place count 328 transition count 283
Iterating global reduction 3 with 9 rules applied. Total rules applied 397 place count 328 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 397 place count 328 transition count 282
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 400 place count 326 transition count 282
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 674 place count 188 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 676 place count 187 transition count 149
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 677 place count 187 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 678 place count 186 transition count 148
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 682 place count 186 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 683 place count 185 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 684 place count 184 transition count 147
Applied a total of 684 rules in 122 ms. Remains 184 /545 variables (removed 361) and now considering 147/476 (removed 329) transitions.
Finished structural reductions, in 1 iterations. Remains : 184/545 places, 147/476 transitions.
Finished random walk after 599 steps, including 31 resets, run visited all 4 properties in 7 ms. (steps per millisecond=85 )
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
FORMULA BusinessProcesses-PT-18-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 488 stabilizing places and 429 stable transitions
Graph (complete) has 1218 edges and 545 vertex of which 543 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(!p1))||((X(p3)||p2) U (p1 U !p3))))'
Support contains 8 out of 545 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 545/545 places, 476/476 transitions.
Graph (trivial) has 255 edges and 545 vertex of which 4 / 545 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1215 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 539 transition count 409
Reduce places removed 62 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 477 transition count 407
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 475 transition count 407
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 130 place count 475 transition count 296
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 374 place count 342 transition count 296
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 384 place count 332 transition count 286
Iterating global reduction 3 with 10 rules applied. Total rules applied 394 place count 332 transition count 286
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 394 place count 332 transition count 285
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 397 place count 330 transition count 285
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 276 rules applied. Total rules applied 673 place count 191 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 675 place count 190 transition count 151
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 681 place count 190 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 682 place count 189 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 683 place count 188 transition count 150
Applied a total of 683 rules in 75 ms. Remains 188 /545 variables (removed 357) and now considering 150/476 (removed 326) transitions.
// Phase 1: matrix 150 rows 188 cols
[2022-05-15 18:08:53] [INFO ] Computed 80 place invariants in 2 ms
[2022-05-15 18:08:53] [INFO ] Implicit Places using invariants in 126 ms returned [48, 49, 50, 51, 52, 53, 56, 57, 58, 139, 146]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 129 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 177/545 places, 150/476 transitions.
Applied a total of 0 rules in 7 ms. Remains 177 /177 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 177/545 places, 150/476 transitions.
Stuttering acceptance computed with spot in 436 ms :[(AND p1 p3), (AND p1 (NOT p3)), (AND p1 p3), (AND p1 (NOT p3)), p3, true, p1, p1, (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0 p3), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0 p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p3 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 p3 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 2}, { cond=(AND p1 p3), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=p3, acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 7}, { cond=(AND p1 p0), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p3), acceptance={} source=8 dest: 5}]], initial=0, aps=[p1:(OR (EQ s124 0) (EQ s17 1)), p0:(OR (EQ s21 0) (EQ s1 1)), p3:(OR (EQ s5 0) (EQ s103 1)), p2:(OR (EQ s153 0) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-02 finished in 710 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(G((G(p2)||p1))||p2))))'
Support contains 4 out of 545 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 476/476 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 544 transition count 476
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 535 transition count 467
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 535 transition count 467
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 534 transition count 466
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 534 transition count 466
Applied a total of 21 rules in 28 ms. Remains 534 /545 variables (removed 11) and now considering 466/476 (removed 10) transitions.
// Phase 1: matrix 466 rows 534 cols
[2022-05-15 18:08:53] [INFO ] Computed 106 place invariants in 3 ms
[2022-05-15 18:08:53] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 466 rows 534 cols
[2022-05-15 18:08:53] [INFO ] Computed 106 place invariants in 22 ms
[2022-05-15 18:08:54] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
// Phase 1: matrix 466 rows 534 cols
[2022-05-15 18:08:54] [INFO ] Computed 106 place invariants in 5 ms
[2022-05-15 18:08:54] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 534/545 places, 466/476 transitions.
Finished structural reductions, in 1 iterations. Remains : 534/545 places, 466/476 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(EQ s396 1), p1:(OR (EQ s180 0) (EQ s306 1)), p0:(AND (EQ s396 0) (EQ s350 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-05 finished in 1196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p1)&&p0)) U p2))'
Support contains 5 out of 545 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 476/476 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 544 transition count 476
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 535 transition count 467
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 535 transition count 467
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 534 transition count 466
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 534 transition count 466
Applied a total of 21 rules in 38 ms. Remains 534 /545 variables (removed 11) and now considering 466/476 (removed 10) transitions.
// Phase 1: matrix 466 rows 534 cols
[2022-05-15 18:08:54] [INFO ] Computed 106 place invariants in 3 ms
[2022-05-15 18:08:55] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 466 rows 534 cols
[2022-05-15 18:08:55] [INFO ] Computed 106 place invariants in 4 ms
[2022-05-15 18:08:55] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
// Phase 1: matrix 466 rows 534 cols
[2022-05-15 18:08:55] [INFO ] Computed 106 place invariants in 9 ms
[2022-05-15 18:08:55] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 534/545 places, 466/476 transitions.
Finished structural reductions, in 1 iterations. Remains : 534/545 places, 466/476 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), true, (NOT p2), (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p0 p1), acceptance={0} source=3 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s501 0) (EQ s327 1)), p2:(EQ s291 1), p0:(AND (OR (EQ s442 0) (EQ s434 1)) (OR (EQ s501 0) (EQ s327 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 844 steps with 3 reset in 18 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-07 finished in 1131 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 4 out of 545 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 476/476 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 534 transition count 465
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 534 transition count 465
Applied a total of 22 rules in 31 ms. Remains 534 /545 variables (removed 11) and now considering 465/476 (removed 11) transitions.
// Phase 1: matrix 465 rows 534 cols
[2022-05-15 18:08:56] [INFO ] Computed 107 place invariants in 7 ms
[2022-05-15 18:08:56] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 465 rows 534 cols
[2022-05-15 18:08:56] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 18:08:56] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
// Phase 1: matrix 465 rows 534 cols
[2022-05-15 18:08:56] [INFO ] Computed 107 place invariants in 7 ms
[2022-05-15 18:08:57] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 534/545 places, 465/476 transitions.
Finished structural reductions, in 1 iterations. Remains : 534/545 places, 465/476 transitions.
Stuttering acceptance computed with spot in 990 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s49 0) (EQ s242 1)), p0:(AND (EQ s205 0) (EQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-08 finished in 1949 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((p0 U p1)))))'
Support contains 2 out of 545 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 545/545 places, 476/476 transitions.
Graph (trivial) has 260 edges and 545 vertex of which 6 / 545 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1212 edges and 540 vertex of which 538 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 537 transition count 405
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 474 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 473 transition count 404
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 130 place count 473 transition count 289
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 385 place count 333 transition count 289
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 396 place count 322 transition count 278
Iterating global reduction 3 with 11 rules applied. Total rules applied 407 place count 322 transition count 278
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 407 place count 322 transition count 277
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 410 place count 320 transition count 277
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 3 with 280 rules applied. Total rules applied 690 place count 179 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 692 place count 178 transition count 141
Applied a total of 692 rules in 52 ms. Remains 178 /545 variables (removed 367) and now considering 141/476 (removed 335) transitions.
// Phase 1: matrix 141 rows 178 cols
[2022-05-15 18:08:58] [INFO ] Computed 78 place invariants in 4 ms
[2022-05-15 18:08:58] [INFO ] Implicit Places using invariants in 110 ms returned [1, 2, 3, 4, 5, 8, 9, 12, 13, 14, 15, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 111 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/545 places, 141/476 transitions.
Applied a total of 0 rules in 10 ms. Remains 151 /151 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 151/545 places, 141/476 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s2 1), p0:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-09 finished in 255 ms.
All properties solved by simple procedures.
Total runtime 11000 ms.

BK_STOP 1652638138359

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-18"
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-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-18, 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 r024-tall-165251918500459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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