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.r043-tajo-167813696900511.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 smartxred
Input is BusinessProcesses-PT-08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813696900511
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678790814791

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-08
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 10:46:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 10:46:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:46:56] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-14 10:46:56] [INFO ] Transformed 393 places.
[2023-03-14 10:46:56] [INFO ] Transformed 344 transitions.
[2023-03-14 10:46:56] [INFO ] Found NUPN structural information;
[2023-03-14 10:46:56] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 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.
Incomplete random walk after 10000 steps, including 81 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 16) seen :12
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 331 rows 380 cols
[2023-03-14 10:46:57] [INFO ] Computed 58 place invariants in 13 ms
[2023-03-14 10:46:57] [INFO ] [Real]Absence check using 44 positive place invariants in 13 ms returned sat
[2023-03-14 10:46:57] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-14 10:46:57] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 10:46:57] [INFO ] [Nat]Absence check using 44 positive place invariants in 48 ms returned sat
[2023-03-14 10:46:57] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-14 10:46:58] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-14 10:46:58] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 6 ms to minimize.
[2023-03-14 10:46:58] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2023-03-14 10:46:58] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2023-03-14 10:46:58] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2023-03-14 10:46:58] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2023-03-14 10:46:58] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 14 ms to minimize.
[2023-03-14 10:46:58] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2023-03-14 10:46:58] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2023-03-14 10:46:58] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2023-03-14 10:46:58] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2023-03-14 10:46:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 824 ms
[2023-03-14 10:46:59] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2023-03-14 10:46:59] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2023-03-14 10:46:59] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2023-03-14 10:46:59] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 0 ms to minimize.
[2023-03-14 10:46:59] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2023-03-14 10:46:59] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
[2023-03-14 10:46:59] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2023-03-14 10:46:59] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2023-03-14 10:47:00] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 1 ms to minimize.
[2023-03-14 10:47:00] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 1 ms to minimize.
[2023-03-14 10:47:00] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 0 ms to minimize.
[2023-03-14 10:47:00] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 1 ms to minimize.
[2023-03-14 10:47:00] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2023-03-14 10:47:00] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 0 ms to minimize.
[2023-03-14 10:47:00] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2023-03-14 10:47:01] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2023-03-14 10:47:01] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2156 ms
[2023-03-14 10:47:01] [INFO ] After 3448ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 224 ms.
[2023-03-14 10:47:01] [INFO ] After 3937ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 20 ms.
Support contains 36 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 331/331 transitions.
Graph (complete) has 734 edges and 380 vertex of which 371 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 371 transition count 274
Reduce places removed 55 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 58 rules applied. Total rules applied 115 place count 316 transition count 271
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 118 place count 313 transition count 271
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 118 place count 313 transition count 207
Deduced a syphon composed of 64 places in 2 ms
Ensure Unique test removed 10 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 256 place count 239 transition count 207
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 313 place count 182 transition count 150
Iterating global reduction 3 with 57 rules applied. Total rules applied 370 place count 182 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 371 place count 182 transition count 149
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 371 place count 182 transition count 145
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 9 rules applied. Total rules applied 380 place count 177 transition count 145
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 462 place count 136 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 463 place count 135 transition count 103
Applied a total of 463 rules in 109 ms. Remains 135 /380 variables (removed 245) and now considering 103/331 (removed 228) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 135/380 places, 103/331 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 135 cols
[2023-03-14 10:47:01] [INFO ] Computed 40 place invariants in 8 ms
[2023-03-14 10:47:01] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:47:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-14 10:47:01] [INFO ] [Nat]Absence check using 36 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-14 10:47:01] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:47:01] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-14 10:47:01] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 35 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 103/103 transitions.
Applied a total of 0 rules in 12 ms. Remains 135 /135 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 135/135 places, 103/103 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1970762 steps, run timeout after 3001 ms. (steps per millisecond=656 ) properties seen :{}
Probabilistic random walk after 1970762 steps, saw 254652 distinct states, run finished after 3003 ms. (steps per millisecond=656 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 10:47:05] [INFO ] Invariant cache hit.
[2023-03-14 10:47:05] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:47:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-14 10:47:05] [INFO ] [Nat]Absence check using 36 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-14 10:47:05] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:47:05] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-14 10:47:05] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 35 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 135 /135 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 135/135 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 135 /135 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-14 10:47:05] [INFO ] Invariant cache hit.
[2023-03-14 10:47:05] [INFO ] Implicit Places using invariants in 85 ms returned [36, 113, 119]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 90 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 132/135 places, 103/103 transitions.
Applied a total of 0 rules in 7 ms. Remains 132 /132 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 102 ms. Remains : 132/135 places, 103/103 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2313255 steps, run timeout after 3001 ms. (steps per millisecond=770 ) properties seen :{}
Probabilistic random walk after 2313255 steps, saw 295643 distinct states, run finished after 3001 ms. (steps per millisecond=770 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 132 cols
[2023-03-14 10:47:08] [INFO ] Computed 37 place invariants in 4 ms
[2023-03-14 10:47:08] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:47:08] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-14 10:47:08] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:47:08] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-14 10:47:08] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 35 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 132 /132 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 132/132 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-14 10:47:08] [INFO ] Invariant cache hit.
[2023-03-14 10:47:08] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-14 10:47:08] [INFO ] Invariant cache hit.
[2023-03-14 10:47:08] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-14 10:47:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 10:47:08] [INFO ] Invariant cache hit.
[2023-03-14 10:47:09] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 132/132 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-14 10:47:09] [INFO ] Invariant cache hit.
[2023-03-14 10:47:09] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:47:09] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-14 10:47:09] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:47:09] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-14 10:47:09] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-14 10:47:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-14 10:47:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 132 places, 103 transitions and 376 arcs took 2 ms.
[2023-03-14 10:47:09] [INFO ] Flatten gal took : 76 ms
Total runtime 13265 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 08
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 132 places, 103 transitions, 376 arcs.
Final Score: 1977.141
Took : 3 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678790834114

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 621:
syntax error

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="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is BusinessProcesses-PT-08, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-tajo-167813696900511"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;