fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r041-tajo-167813694800506
Last Updated
May 14, 2023

About the Execution of LTSMin+red for BusinessProcesses-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15647.199 3579204.00 14284040.00 70.60 F???????T?????TT normal

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.r041-tajo-167813694800506.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 ltsminxred
Input is BusinessProcesses-PT-08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694800506
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1678641093336

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:11:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:11:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:11:35] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-12 17:11:35] [INFO ] Transformed 393 places.
[2023-03-12 17:11:35] [INFO ] Transformed 344 transitions.
[2023-03-12 17:11:35] [INFO ] Found NUPN structural information;
[2023-03-12 17:11:35] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Deduced a syphon composed of 13 places in 9 ms
Reduce places removed 13 places and 13 transitions.
Support contains 130 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 331/331 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 372 transition count 331
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 50 place count 330 transition count 289
Iterating global reduction 1 with 42 rules applied. Total rules applied 92 place count 330 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 93 place count 330 transition count 288
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 111 place count 312 transition count 270
Iterating global reduction 2 with 18 rules applied. Total rules applied 129 place count 312 transition count 270
Applied a total of 129 rules in 76 ms. Remains 312 /380 variables (removed 68) and now considering 270/331 (removed 61) transitions.
// Phase 1: matrix 270 rows 312 cols
[2023-03-12 17:11:35] [INFO ] Computed 50 place invariants in 11 ms
[2023-03-12 17:11:35] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-12 17:11:35] [INFO ] Invariant cache hit.
[2023-03-12 17:11:35] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2023-03-12 17:11:35] [INFO ] Invariant cache hit.
[2023-03-12 17:11:35] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/380 places, 270/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 765 ms. Remains : 312/380 places, 270/331 transitions.
Support contains 130 out of 312 places after structural reductions.
[2023-03-12 17:11:36] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-12 17:11:36] [INFO ] Flatten gal took : 47 ms
FORMULA BusinessProcesses-PT-08-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 17:11:36] [INFO ] Flatten gal took : 17 ms
[2023-03-12 17:11:36] [INFO ] Input system was already deterministic with 270 transitions.
Support contains 99 out of 312 places (down from 130) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 560 ms. (steps per millisecond=17 ) properties (out of 71) seen :41
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
[2023-03-12 17:11:36] [INFO ] Invariant cache hit.
[2023-03-12 17:11:37] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2023-03-12 17:11:37] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-03-12 17:11:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-12 17:11:38] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2023-03-12 17:11:38] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 5 ms to minimize.
[2023-03-12 17:11:38] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2023-03-12 17:11:38] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2023-03-12 17:11:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 218 ms
[2023-03-12 17:11:38] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2023-03-12 17:11:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-12 17:11:38] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 3 ms to minimize.
[2023-03-12 17:11:38] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2023-03-12 17:11:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2023-03-12 17:11:38] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2023-03-12 17:11:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-12 17:11:39] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2023-03-12 17:11:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-12 17:11:39] [INFO ] After 1513ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :30
Attempting to minimize the solution found.
Minimization took 334 ms.
[2023-03-12 17:11:39] [INFO ] After 2441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :30
Parikh walk visited 25 properties in 251 ms.
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 270/270 transitions.
Graph (trivial) has 175 edges and 312 vertex of which 6 / 312 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 629 edges and 307 vertex of which 306 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 306 transition count 209
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 254 transition count 209
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 106 place count 254 transition count 159
Deduced a syphon composed of 50 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 111 rules applied. Total rules applied 217 place count 193 transition count 159
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 250 place count 160 transition count 126
Iterating global reduction 2 with 33 rules applied. Total rules applied 283 place count 160 transition count 126
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 283 place count 160 transition count 123
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 290 place count 156 transition count 123
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 429 place count 86 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 430 place count 85 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 431 place count 84 transition count 53
Applied a total of 431 rules in 39 ms. Remains 84 /312 variables (removed 228) and now considering 53/270 (removed 217) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 84/312 places, 53/270 transitions.
Finished random walk after 421 steps, including 21 resets, run visited all 5 properties in 6 ms. (steps per millisecond=70 )
[2023-03-12 17:11:39] [INFO ] Flatten gal took : 14 ms
[2023-03-12 17:11:39] [INFO ] Flatten gal took : 13 ms
[2023-03-12 17:11:39] [INFO ] Input system was already deterministic with 270 transitions.
Computed a total of 106 stabilizing places and 102 stable transitions
Graph (complete) has 639 edges and 312 vertex of which 311 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 270/270 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 275 transition count 233
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 275 transition count 233
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 90 place count 259 transition count 217
Iterating global reduction 0 with 16 rules applied. Total rules applied 106 place count 259 transition count 217
Applied a total of 106 rules in 23 ms. Remains 259 /312 variables (removed 53) and now considering 217/270 (removed 53) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 259/312 places, 217/270 transitions.
[2023-03-12 17:11:39] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:11:39] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:11:39] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 270/270 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 280 transition count 238
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 280 transition count 238
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 76 place count 268 transition count 226
Iterating global reduction 0 with 12 rules applied. Total rules applied 88 place count 268 transition count 226
Applied a total of 88 rules in 14 ms. Remains 268 /312 variables (removed 44) and now considering 226/270 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 268/312 places, 226/270 transitions.
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 25 ms
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 13 ms
[2023-03-12 17:11:40] [INFO ] Input system was already deterministic with 226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 270/270 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 282 transition count 240
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 282 transition count 240
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 71 place count 271 transition count 229
Iterating global reduction 0 with 11 rules applied. Total rules applied 82 place count 271 transition count 229
Applied a total of 82 rules in 26 ms. Remains 271 /312 variables (removed 41) and now considering 229/270 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 271/312 places, 229/270 transitions.
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 12 ms
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 23 ms
[2023-03-12 17:11:40] [INFO ] Input system was already deterministic with 229 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 270/270 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 279 transition count 237
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 279 transition count 237
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 80 place count 265 transition count 223
Iterating global reduction 0 with 14 rules applied. Total rules applied 94 place count 265 transition count 223
Applied a total of 94 rules in 11 ms. Remains 265 /312 variables (removed 47) and now considering 223/270 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 265/312 places, 223/270 transitions.
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:11:40] [INFO ] Input system was already deterministic with 223 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 270/270 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 280 transition count 238
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 280 transition count 238
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 77 place count 267 transition count 225
Iterating global reduction 0 with 13 rules applied. Total rules applied 90 place count 267 transition count 225
Applied a total of 90 rules in 22 ms. Remains 267 /312 variables (removed 45) and now considering 225/270 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 267/312 places, 225/270 transitions.
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:11:40] [INFO ] Input system was already deterministic with 225 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 270/270 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 277 transition count 235
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 277 transition count 235
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 85 place count 262 transition count 220
Iterating global reduction 0 with 15 rules applied. Total rules applied 100 place count 262 transition count 220
Applied a total of 100 rules in 8 ms. Remains 262 /312 variables (removed 50) and now considering 220/270 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 262/312 places, 220/270 transitions.
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 13 ms
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:11:40] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 270/270 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 281 transition count 239
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 281 transition count 239
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 77 place count 266 transition count 224
Iterating global reduction 0 with 15 rules applied. Total rules applied 92 place count 266 transition count 224
Applied a total of 92 rules in 22 ms. Remains 266 /312 variables (removed 46) and now considering 224/270 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 266/312 places, 224/270 transitions.
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 8 ms
[2023-03-12 17:11:40] [INFO ] Input system was already deterministic with 224 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 270/270 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 277 transition count 235
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 277 transition count 235
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 85 place count 262 transition count 220
Iterating global reduction 0 with 15 rules applied. Total rules applied 100 place count 262 transition count 220
Applied a total of 100 rules in 20 ms. Remains 262 /312 variables (removed 50) and now considering 220/270 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 262/312 places, 220/270 transitions.
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 21 ms
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:11:40] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 270/270 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 276 transition count 234
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 276 transition count 234
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 87 place count 261 transition count 219
Iterating global reduction 0 with 15 rules applied. Total rules applied 102 place count 261 transition count 219
Applied a total of 102 rules in 8 ms. Remains 261 /312 variables (removed 51) and now considering 219/270 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 261/312 places, 219/270 transitions.
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 20 ms
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:11:40] [INFO ] Input system was already deterministic with 219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 270/270 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 277 transition count 235
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 277 transition count 235
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 85 place count 262 transition count 220
Iterating global reduction 0 with 15 rules applied. Total rules applied 100 place count 262 transition count 220
Applied a total of 100 rules in 8 ms. Remains 262 /312 variables (removed 50) and now considering 220/270 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 262/312 places, 220/270 transitions.
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 24 ms
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:11:40] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 270/270 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 275 transition count 233
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 275 transition count 233
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 90 place count 259 transition count 217
Iterating global reduction 0 with 16 rules applied. Total rules applied 106 place count 259 transition count 217
Applied a total of 106 rules in 20 ms. Remains 259 /312 variables (removed 53) and now considering 217/270 (removed 53) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 259/312 places, 217/270 transitions.
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 16 ms
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:11:40] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 312/312 places, 270/270 transitions.
Graph (complete) has 639 edges and 312 vertex of which 311 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 310 transition count 222
Reduce places removed 46 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 50 rules applied. Total rules applied 97 place count 264 transition count 218
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 101 place count 260 transition count 218
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 101 place count 260 transition count 160
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 127 rules applied. Total rules applied 228 place count 191 transition count 160
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 263 place count 156 transition count 125
Iterating global reduction 3 with 35 rules applied. Total rules applied 298 place count 156 transition count 125
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 298 place count 156 transition count 122
Deduced a syphon composed of 3 places in 0 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 306 place count 151 transition count 122
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 438 place count 85 transition count 56
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 439 place count 85 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 440 place count 84 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 441 place count 83 transition count 54
Applied a total of 441 rules in 73 ms. Remains 83 /312 variables (removed 229) and now considering 54/270 (removed 216) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73 ms. Remains : 83/312 places, 54/270 transitions.
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 3 ms
[2023-03-12 17:11:40] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 312/312 places, 270/270 transitions.
Graph (complete) has 639 edges and 312 vertex of which 311 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 310 transition count 220
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 262 transition count 218
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 260 transition count 218
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 101 place count 260 transition count 159
Deduced a syphon composed of 59 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 129 rules applied. Total rules applied 230 place count 190 transition count 159
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 267 place count 153 transition count 122
Iterating global reduction 3 with 37 rules applied. Total rules applied 304 place count 153 transition count 122
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 304 place count 153 transition count 118
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 314 place count 147 transition count 118
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 131 rules applied. Total rules applied 445 place count 81 transition count 53
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 446 place count 81 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 447 place count 80 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 448 place count 79 transition count 51
Applied a total of 448 rules in 32 ms. Remains 79 /312 variables (removed 233) and now considering 51/270 (removed 219) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 79/312 places, 51/270 transitions.
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 3 ms
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:11:40] [INFO ] Input system was already deterministic with 51 transitions.
Finished random walk after 1349 steps, including 101 resets, run visited all 1 properties in 6 ms. (steps per millisecond=224 )
FORMULA BusinessProcesses-PT-08-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 270/270 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 275 transition count 233
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 275 transition count 233
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 90 place count 259 transition count 217
Iterating global reduction 0 with 16 rules applied. Total rules applied 106 place count 259 transition count 217
Applied a total of 106 rules in 19 ms. Remains 259 /312 variables (removed 53) and now considering 217/270 (removed 53) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 259/312 places, 217/270 transitions.
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:11:40] [INFO ] Input system was already deterministic with 217 transitions.
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:11:40] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:11:40] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-12 17:11:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 312 places, 270 transitions and 755 arcs took 1 ms.
Total runtime 6086 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/498/ctl_0_ --ctl=/tmp/498/ctl_1_ --ctl=/tmp/498/ctl_2_ --ctl=/tmp/498/ctl_3_ --ctl=/tmp/498/ctl_4_ --ctl=/tmp/498/ctl_5_ --ctl=/tmp/498/ctl_6_ --ctl=/tmp/498/ctl_7_ --ctl=/tmp/498/ctl_8_ --ctl=/tmp/498/ctl_9_ --ctl=/tmp/498/ctl_10_ --ctl=/tmp/498/ctl_11_ --ctl=/tmp/498/ctl_12_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393356 kB
MemFree: 514072 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16102676 kB
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-01
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-02
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-03
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-04
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-05
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-06
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-07
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-09
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-10
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-11
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-12
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-13
FORMULA BusinessProcesses-PT-08-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678644672540

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name BusinessProcesses-PT-08-CTLFireability-01
ctl formula formula --ctl=/tmp/498/ctl_0_
ctl formula name BusinessProcesses-PT-08-CTLFireability-02
ctl formula formula --ctl=/tmp/498/ctl_1_
ctl formula name BusinessProcesses-PT-08-CTLFireability-03
ctl formula formula --ctl=/tmp/498/ctl_2_
ctl formula name BusinessProcesses-PT-08-CTLFireability-04
ctl formula formula --ctl=/tmp/498/ctl_3_
ctl formula name BusinessProcesses-PT-08-CTLFireability-05
ctl formula formula --ctl=/tmp/498/ctl_4_
ctl formula name BusinessProcesses-PT-08-CTLFireability-06
ctl formula formula --ctl=/tmp/498/ctl_5_
ctl formula name BusinessProcesses-PT-08-CTLFireability-07
ctl formula formula --ctl=/tmp/498/ctl_6_
ctl formula name BusinessProcesses-PT-08-CTLFireability-09
ctl formula formula --ctl=/tmp/498/ctl_7_
ctl formula name BusinessProcesses-PT-08-CTLFireability-10
ctl formula formula --ctl=/tmp/498/ctl_8_
ctl formula name BusinessProcesses-PT-08-CTLFireability-11
ctl formula formula --ctl=/tmp/498/ctl_9_
ctl formula name BusinessProcesses-PT-08-CTLFireability-12
ctl formula formula --ctl=/tmp/498/ctl_10_
ctl formula name BusinessProcesses-PT-08-CTLFireability-13
ctl formula formula --ctl=/tmp/498/ctl_11_
ctl formula name BusinessProcesses-PT-08-CTLFireability-15
ctl formula formula --ctl=/tmp/498/ctl_12_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 312 places, 270 transitions and 755 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 270->268 groups
pnml2lts-sym: Regrouping took 0.050 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 312; there are 268 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 648726 group checks and 0 next state calls
pnml2lts-sym: reachability took 7.020 real 27.140 user 0.640 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.030 real 0.130 user 0.010 sys
pnml2lts-sym: state space has 3.4324080245062e+17 states, 177798 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/498/ctl_12_ holds for the initial state
Killing (15) : 504
Killing (9) : 504

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