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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:42 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.7K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 9.7K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 91K 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-08-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678360876574

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-08
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-09 11:21:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 11:21:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:21:18] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-09 11:21:18] [INFO ] Transformed 393 places.
[2023-03-09 11:21:18] [INFO ] Transformed 344 transitions.
[2023-03-09 11:21:18] [INFO ] Found NUPN structural information;
[2023-03-09 11:21:18] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 13 transitions.
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 11:21:18] [INFO ] Flatten gal took : 54 ms
[2023-03-09 11:21:18] [INFO ] Flatten gal took : 49 ms
[2023-03-09 11:21:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16868396629268847739.gal : 13 ms
[2023-03-09 11:21:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6380915835117162761.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16868396629268847739.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6380915835117162761.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Incomplete random walk after 10000 steps, including 84 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 12) seen :5
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Loading property file /tmp/ReachabilityCardinality6380915835117162761.prop.
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :19 after 21
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :21 after 39
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 331 rows 380 cols
[2023-03-09 11:21:19] [INFO ] Computed 58 place invariants in 41 ms
[2023-03-09 11:21:19] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 11:21:19] [INFO ] [Nat]Absence check using 44 positive place invariants in 15 ms returned sat
[2023-03-09 11:21:19] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 3 ms returned sat
[2023-03-09 11:21:20] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-09 11:21:20] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 6 ms to minimize.
[2023-03-09 11:21:20] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-09 11:21:20] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2023-03-09 11:21:20] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2023-03-09 11:21:20] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2023-03-09 11:21:20] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2023-03-09 11:21:20] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 0 ms to minimize.
[2023-03-09 11:21:20] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2023-03-09 11:21:20] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2023-03-09 11:21:20] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2023-03-09 11:21:20] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2023-03-09 11:21:20] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 906 ms
[2023-03-09 11:21:21] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 0 ms to minimize.
[2023-03-09 11:21:21] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 1 ms to minimize.
[2023-03-09 11:21:21] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2023-03-09 11:21:21] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2023-03-09 11:21:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 438 ms
[2023-03-09 11:21:21] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2023-03-09 11:21:21] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
[2023-03-09 11:21:21] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2023-03-09 11:21:21] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2023-03-09 11:21:21] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 1 ms to minimize.
[2023-03-09 11:21:22] [INFO ] Deduced a trap composed of 87 places in 72 ms of which 0 ms to minimize.
[2023-03-09 11:21:22] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 1 ms to minimize.
[2023-03-09 11:21:22] [INFO ] Deduced a trap composed of 90 places in 68 ms of which 0 ms to minimize.
[2023-03-09 11:21:22] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 1 ms to minimize.
[2023-03-09 11:21:22] [INFO ] Deduced a trap composed of 90 places in 69 ms of which 0 ms to minimize.
[2023-03-09 11:21:22] [INFO ] Deduced a trap composed of 86 places in 70 ms of which 1 ms to minimize.
[2023-03-09 11:21:22] [INFO ] Deduced a trap composed of 93 places in 69 ms of which 0 ms to minimize.
[2023-03-09 11:21:22] [INFO ] Deduced a trap composed of 88 places in 71 ms of which 1 ms to minimize.
[2023-03-09 11:21:22] [INFO ] Deduced a trap composed of 90 places in 65 ms of which 0 ms to minimize.
[2023-03-09 11:21:22] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 0 ms to minimize.
[2023-03-09 11:21:22] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 0 ms to minimize.
[2023-03-09 11:21:23] [INFO ] Deduced a trap composed of 96 places in 59 ms of which 1 ms to minimize.
[2023-03-09 11:21:23] [INFO ] Deduced a trap composed of 91 places in 58 ms of which 0 ms to minimize.
[2023-03-09 11:21:23] [INFO ] Deduced a trap composed of 90 places in 71 ms of which 4 ms to minimize.
[2023-03-09 11:21:23] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1777 ms
[2023-03-09 11:21:23] [INFO ] After 3407ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-09 11:21:23] [INFO ] After 3706ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 54 ms.
Support contains 32 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 331/331 transitions.
Graph (trivial) has 196 edges and 380 vertex of which 8 / 380 are part of one of the 1 SCC in 5 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 724 edges and 373 vertex of which 364 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 364 transition count 249
Reduce places removed 70 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 77 rules applied. Total rules applied 150 place count 294 transition count 242
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 157 place count 287 transition count 242
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 157 place count 287 transition count 198
Deduced a syphon composed of 44 places in 3 ms
Ensure Unique test removed 9 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 97 rules applied. Total rules applied 254 place count 234 transition count 198
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 306 place count 182 transition count 146
Iterating global reduction 3 with 52 rules applied. Total rules applied 358 place count 182 transition count 146
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 358 place count 182 transition count 143
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 366 place count 177 transition count 143
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 462 place count 129 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 463 place count 128 transition count 94
Applied a total of 463 rules in 116 ms. Remains 128 /380 variables (removed 252) and now considering 94/331 (removed 237) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 128/380 places, 94/331 transitions.
Incomplete random walk after 10000 steps, including 175 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 128 cols
[2023-03-09 11:21:23] [INFO ] Computed 40 place invariants in 6 ms
[2023-03-09 11:21:23] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 11:21:23] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2023-03-09 11:21:23] [INFO ] [Nat]Absence check using 37 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-09 11:21:23] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 11:21:23] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2023-03-09 11:21:24] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2023-03-09 11:21:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2023-03-09 11:21:24] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-09 11:21:24] [INFO ] After 295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 30 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 94/94 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 127 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 125 transition count 91
Applied a total of 6 rules in 11 ms. Remains 125 /128 variables (removed 3) and now considering 91/94 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 125/128 places, 91/94 transitions.
Incomplete random walk after 10000 steps, including 191 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1268722 steps, run timeout after 3001 ms. (steps per millisecond=422 ) properties seen :{}
Probabilistic random walk after 1268722 steps, saw 168175 distinct states, run finished after 3003 ms. (steps per millisecond=422 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 91 rows 125 cols
[2023-03-09 11:21:27] [INFO ] Computed 40 place invariants in 4 ms
[2023-03-09 11:21:27] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 11:21:27] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-09 11:21:27] [INFO ] [Nat]Absence check using 37 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-09 11:21:27] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 11:21:27] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-09 11:21:27] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2023-03-09 11:21:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 59 ms
[2023-03-09 11:21:27] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2023-03-09 11:21:27] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2023-03-09 11:21:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 78 ms
[2023-03-09 11:21:27] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-09 11:21:27] [INFO ] After 289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 30 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 125/125 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-09 11:21:27] [INFO ] Invariant cache hit.
[2023-03-09 11:21:27] [INFO ] Implicit Places using invariants in 62 ms returned [9, 31, 32, 33, 116]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 64 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 120/125 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 71 ms. Remains : 120/125 places, 91/91 transitions.
Incomplete random walk after 10000 steps, including 187 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1383988 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :{}
Probabilistic random walk after 1383988 steps, saw 181576 distinct states, run finished after 3001 ms. (steps per millisecond=461 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 91 rows 120 cols
[2023-03-09 11:21:30] [INFO ] Computed 35 place invariants in 8 ms
[2023-03-09 11:21:30] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 11:21:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2023-03-09 11:21:30] [INFO ] [Nat]Absence check using 34 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 11:21:30] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 11:21:31] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2023-03-09 11:21:31] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2023-03-09 11:21:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2023-03-09 11:21:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2023-03-09 11:21:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-09 11:21:31] [INFO ] After 255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-09 11:21:31] [INFO ] After 367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 4 ms.
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 91/91 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 120 transition count 83
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 112 transition count 83
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 16 place count 112 transition count 74
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 34 place count 103 transition count 74
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 99 transition count 70
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 99 transition count 70
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 82 place count 78 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 76 transition count 49
Applied a total of 84 rules in 24 ms. Remains 76 /120 variables (removed 44) and now considering 49/91 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 76/120 places, 49/91 transitions.
Incomplete random walk after 10000 steps, including 448 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 223 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Probably explored full state space saw : 116 states, properties seen :0
Probabilistic random walk after 319 steps, saw 116 distinct states, run finished after 8 ms. (steps per millisecond=39 ) properties seen :0
Explored full state space saw : 116 states, properties seen :0
Exhaustive walk after 319 steps, saw 116 distinct states, run finished after 2 ms. (steps per millisecond=159 ) properties seen :0
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 13069 ms.

BK_STOP 1678360891785

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-08"
export BK_EXAMINATION="ReachabilityCardinality"
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-08, examination is ReachabilityCardinality"
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-167813690500510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-08.tgz
mv BusinessProcesses-PT-08 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;