About the Execution of LTSMin+red for BusinessProcesses-PT-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15988.111 | 3581385.00 | 14297952.00 | 609.20 | ??????????T????? | 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-167813694800490.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-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694800490
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 8.0K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:50 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.6K 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.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 85K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678640297721
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-06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:58:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:58:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:58:20] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-12 16:58:20] [INFO ] Transformed 376 places.
[2023-03-12 16:58:20] [INFO ] Transformed 297 transitions.
[2023-03-12 16:58:20] [INFO ] Found NUPN structural information;
[2023-03-12 16:58:20] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 transitions.
Support contains 109 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 296
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 348 transition count 271
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 348 transition count 271
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 60 place count 340 transition count 263
Iterating global reduction 1 with 8 rules applied. Total rules applied 68 place count 340 transition count 263
Applied a total of 68 rules in 89 ms. Remains 340 /375 variables (removed 35) and now considering 263/296 (removed 33) transitions.
// Phase 1: matrix 263 rows 340 cols
[2023-03-12 16:58:20] [INFO ] Computed 79 place invariants in 26 ms
[2023-03-12 16:58:20] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-12 16:58:20] [INFO ] Invariant cache hit.
[2023-03-12 16:58:21] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
[2023-03-12 16:58:21] [INFO ] Invariant cache hit.
[2023-03-12 16:58:21] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 340/375 places, 263/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1187 ms. Remains : 340/375 places, 263/296 transitions.
Support contains 109 out of 340 places after structural reductions.
[2023-03-12 16:58:21] [INFO ] Flatten gal took : 61 ms
[2023-03-12 16:58:21] [INFO ] Flatten gal took : 22 ms
[2023-03-12 16:58:21] [INFO ] Input system was already deterministic with 263 transitions.
Incomplete random walk after 10000 steps, including 101 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 65) seen :54
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-12 16:58:22] [INFO ] Invariant cache hit.
[2023-03-12 16:58:23] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2023-03-12 16:58:23] [INFO ] [Real]Absence check using 34 positive and 45 generalized place invariants in 13 ms returned sat
[2023-03-12 16:58:23] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 16:58:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-12 16:58:23] [INFO ] [Nat]Absence check using 34 positive and 45 generalized place invariants in 28 ms returned sat
[2023-03-12 16:58:23] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2023-03-12 16:58:23] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 23 ms to minimize.
[2023-03-12 16:58:24] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2023-03-12 16:58:24] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 14 ms to minimize.
[2023-03-12 16:58:24] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 14 ms to minimize.
[2023-03-12 16:58:24] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 14 ms to minimize.
[2023-03-12 16:58:24] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2023-03-12 16:58:24] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2023-03-12 16:58:24] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 14 ms to minimize.
[2023-03-12 16:58:24] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2023-03-12 16:58:24] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2023-03-12 16:58:25] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2023-03-12 16:58:25] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1324 ms
[2023-03-12 16:58:25] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2023-03-12 16:58:25] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2023-03-12 16:58:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 253 ms
[2023-03-12 16:58:25] [INFO ] After 2163ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-12 16:58:25] [INFO ] After 2598ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 62 ms.
Support contains 2 out of 340 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 340/340 places, 263/263 transitions.
Graph (trivial) has 159 edges and 340 vertex of which 6 / 340 are part of one of the 1 SCC in 9 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 646 edges and 335 vertex of which 334 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 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 334 transition count 212
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 292 transition count 212
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 86 place count 292 transition count 146
Deduced a syphon composed of 66 places in 4 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 228 place count 216 transition count 146
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 248 place count 196 transition count 126
Iterating global reduction 2 with 20 rules applied. Total rules applied 268 place count 196 transition count 126
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 432 place count 110 transition count 48
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 433 place count 110 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 434 place count 109 transition count 47
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 435 place count 109 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 436 place count 108 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 437 place count 107 transition count 46
Applied a total of 437 rules in 93 ms. Remains 107 /340 variables (removed 233) and now considering 46/263 (removed 217) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 107/340 places, 46/263 transitions.
Finished random walk after 44 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=44 )
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-12 16:58:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-12 16:58:25] [INFO ] Flatten gal took : 28 ms
FORMULA BusinessProcesses-PT-06-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 16:58:25] [INFO ] Flatten gal took : 30 ms
[2023-03-12 16:58:26] [INFO ] Input system was already deterministic with 263 transitions.
Computed a total of 333 stabilizing places and 254 stable transitions
Graph (complete) has 653 edges and 340 vertex of which 339 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.25 ms
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 263/263 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 320 transition count 243
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 320 transition count 243
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 313 transition count 236
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 313 transition count 236
Applied a total of 54 rules in 44 ms. Remains 313 /340 variables (removed 27) and now considering 236/263 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 313/340 places, 236/263 transitions.
[2023-03-12 16:58:26] [INFO ] Flatten gal took : 11 ms
[2023-03-12 16:58:26] [INFO ] Flatten gal took : 11 ms
[2023-03-12 16:58:26] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 263/263 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 317 transition count 240
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 317 transition count 240
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 309 transition count 232
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 309 transition count 232
Applied a total of 62 rules in 23 ms. Remains 309 /340 variables (removed 31) and now considering 232/263 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 309/340 places, 232/263 transitions.
[2023-03-12 16:58:26] [INFO ] Flatten gal took : 24 ms
[2023-03-12 16:58:26] [INFO ] Flatten gal took : 31 ms
[2023-03-12 16:58:26] [INFO ] Input system was already deterministic with 232 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 340/340 places, 263/263 transitions.
Graph (trivial) has 156 edges and 340 vertex of which 4 / 340 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 650 edges and 337 vertex of which 336 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 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 335 transition count 216
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 293 transition count 216
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 86 place count 293 transition count 152
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 224 place count 219 transition count 152
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 245 place count 198 transition count 131
Iterating global reduction 2 with 21 rules applied. Total rules applied 266 place count 198 transition count 131
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 426 place count 114 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 428 place count 113 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 429 place count 112 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 430 place count 111 transition count 53
Applied a total of 430 rules in 71 ms. Remains 111 /340 variables (removed 229) and now considering 53/263 (removed 210) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72 ms. Remains : 111/340 places, 53/263 transitions.
[2023-03-12 16:58:26] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:58:26] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:58:26] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 263/263 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 317 transition count 240
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 317 transition count 240
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 309 transition count 232
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 309 transition count 232
Applied a total of 62 rules in 46 ms. Remains 309 /340 variables (removed 31) and now considering 232/263 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 309/340 places, 232/263 transitions.
[2023-03-12 16:58:26] [INFO ] Flatten gal took : 9 ms
[2023-03-12 16:58:26] [INFO ] Flatten gal took : 23 ms
[2023-03-12 16:58:26] [INFO ] Input system was already deterministic with 232 transitions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 263/263 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 319 transition count 242
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 319 transition count 242
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 312 transition count 235
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 312 transition count 235
Applied a total of 56 rules in 46 ms. Remains 312 /340 variables (removed 28) and now considering 235/263 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 312/340 places, 235/263 transitions.
[2023-03-12 16:58:26] [INFO ] Flatten gal took : 10 ms
[2023-03-12 16:58:26] [INFO ] Flatten gal took : 26 ms
[2023-03-12 16:58:26] [INFO ] Input system was already deterministic with 235 transitions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 263/263 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 317 transition count 240
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 317 transition count 240
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 309 transition count 232
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 309 transition count 232
Applied a total of 62 rules in 36 ms. Remains 309 /340 variables (removed 31) and now considering 232/263 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 309/340 places, 232/263 transitions.
[2023-03-12 16:58:26] [INFO ] Flatten gal took : 19 ms
[2023-03-12 16:58:26] [INFO ] Flatten gal took : 31 ms
[2023-03-12 16:58:26] [INFO ] Input system was already deterministic with 232 transitions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 263/263 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 322 transition count 245
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 322 transition count 245
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 316 transition count 239
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 316 transition count 239
Applied a total of 48 rules in 11 ms. Remains 316 /340 variables (removed 24) and now considering 239/263 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 316/340 places, 239/263 transitions.
[2023-03-12 16:58:26] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:58:26] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:58:26] [INFO ] Input system was already deterministic with 239 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 340/340 places, 263/263 transitions.
Graph (complete) has 653 edges and 340 vertex of which 339 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 338 transition count 229
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 306 transition count 227
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 304 transition count 227
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 73 Pre rules applied. Total rules applied 69 place count 304 transition count 154
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 155 rules applied. Total rules applied 224 place count 222 transition count 154
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 246 place count 200 transition count 132
Iterating global reduction 3 with 22 rules applied. Total rules applied 268 place count 200 transition count 132
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 426 place count 117 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 427 place count 116 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 428 place count 115 transition count 56
Applied a total of 428 rules in 55 ms. Remains 115 /340 variables (removed 225) and now considering 56/263 (removed 207) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 115/340 places, 56/263 transitions.
[2023-03-12 16:58:26] [INFO ] Flatten gal took : 14 ms
[2023-03-12 16:58:26] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:58:26] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 263/263 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 321 transition count 244
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 321 transition count 244
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 313 transition count 236
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 313 transition count 236
Applied a total of 54 rules in 24 ms. Remains 313 /340 variables (removed 27) and now considering 236/263 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 313/340 places, 236/263 transitions.
[2023-03-12 16:58:27] [INFO ] Flatten gal took : 21 ms
[2023-03-12 16:58:27] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:58:27] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 263/263 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 318 transition count 241
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 318 transition count 241
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 310 transition count 233
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 310 transition count 233
Applied a total of 60 rules in 13 ms. Remains 310 /340 variables (removed 30) and now considering 233/263 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 310/340 places, 233/263 transitions.
[2023-03-12 16:58:27] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:58:27] [INFO ] Flatten gal took : 22 ms
[2023-03-12 16:58:27] [INFO ] Input system was already deterministic with 233 transitions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 263/263 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 319 transition count 242
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 319 transition count 242
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 312 transition count 235
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 312 transition count 235
Applied a total of 56 rules in 13 ms. Remains 312 /340 variables (removed 28) and now considering 235/263 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 312/340 places, 235/263 transitions.
[2023-03-12 16:58:27] [INFO ] Flatten gal took : 16 ms
[2023-03-12 16:58:27] [INFO ] Flatten gal took : 20 ms
[2023-03-12 16:58:27] [INFO ] Input system was already deterministic with 235 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 340/340 places, 263/263 transitions.
Graph (trivial) has 160 edges and 340 vertex of which 6 / 340 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 647 edges and 335 vertex of which 334 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 333 transition count 212
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 290 transition count 212
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 88 place count 290 transition count 147
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 228 place count 215 transition count 147
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 249 place count 194 transition count 126
Iterating global reduction 2 with 21 rules applied. Total rules applied 270 place count 194 transition count 126
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 430 place count 110 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 432 place count 109 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 433 place count 108 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 434 place count 107 transition count 48
Applied a total of 434 rules in 57 ms. Remains 107 /340 variables (removed 233) and now considering 48/263 (removed 215) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 107/340 places, 48/263 transitions.
[2023-03-12 16:58:27] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:58:27] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:58:27] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 263/263 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 320 transition count 243
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 320 transition count 243
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 313 transition count 236
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 313 transition count 236
Applied a total of 54 rules in 16 ms. Remains 313 /340 variables (removed 27) and now considering 236/263 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 313/340 places, 236/263 transitions.
[2023-03-12 16:58:27] [INFO ] Flatten gal took : 7 ms
[2023-03-12 16:58:27] [INFO ] Flatten gal took : 20 ms
[2023-03-12 16:58:27] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 340/340 places, 263/263 transitions.
Graph (trivial) has 162 edges and 340 vertex of which 6 / 340 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 647 edges and 335 vertex of which 334 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 333 transition count 212
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 89 place count 290 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 289 transition count 211
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 90 place count 289 transition count 146
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 229 place count 215 transition count 146
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 251 place count 193 transition count 124
Iterating global reduction 3 with 22 rules applied. Total rules applied 273 place count 193 transition count 124
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 433 place count 109 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 435 place count 108 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 436 place count 107 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 437 place count 106 transition count 46
Applied a total of 437 rules in 48 ms. Remains 106 /340 variables (removed 234) and now considering 46/263 (removed 217) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 106/340 places, 46/263 transitions.
[2023-03-12 16:58:27] [INFO ] Flatten gal took : 5 ms
[2023-03-12 16:58:27] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:58:27] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 263/263 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 322 transition count 245
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 322 transition count 245
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 316 transition count 239
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 316 transition count 239
Applied a total of 48 rules in 16 ms. Remains 316 /340 variables (removed 24) and now considering 239/263 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 316/340 places, 239/263 transitions.
[2023-03-12 16:58:27] [INFO ] Flatten gal took : 9 ms
[2023-03-12 16:58:27] [INFO ] Flatten gal took : 9 ms
[2023-03-12 16:58:27] [INFO ] Input system was already deterministic with 239 transitions.
[2023-03-12 16:58:27] [INFO ] Flatten gal took : 9 ms
[2023-03-12 16:58:27] [INFO ] Flatten gal took : 10 ms
[2023-03-12 16:58:27] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-12 16:58:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 340 places, 263 transitions and 760 arcs took 2 ms.
Total runtime 7490 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/525/ctl_0_ --ctl=/tmp/525/ctl_1_ --ctl=/tmp/525/ctl_2_ --ctl=/tmp/525/ctl_3_ --ctl=/tmp/525/ctl_4_ --ctl=/tmp/525/ctl_5_ --ctl=/tmp/525/ctl_6_ --ctl=/tmp/525/ctl_7_ --ctl=/tmp/525/ctl_8_ --ctl=/tmp/525/ctl_9_ --ctl=/tmp/525/ctl_10_ --ctl=/tmp/525/ctl_11_ --ctl=/tmp/525/ctl_12_ --ctl=/tmp/525/ctl_13_ --ctl=/tmp/525/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 169260 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098904 kB
Could not compute solution for formula : BusinessProcesses-PT-06-CTLFireability-00
Could not compute solution for formula : BusinessProcesses-PT-06-CTLFireability-01
Could not compute solution for formula : BusinessProcesses-PT-06-CTLFireability-02
Could not compute solution for formula : BusinessProcesses-PT-06-CTLFireability-03
Could not compute solution for formula : BusinessProcesses-PT-06-CTLFireability-04
Could not compute solution for formula : BusinessProcesses-PT-06-CTLFireability-05
Could not compute solution for formula : BusinessProcesses-PT-06-CTLFireability-06
Could not compute solution for formula : BusinessProcesses-PT-06-CTLFireability-07
Could not compute solution for formula : BusinessProcesses-PT-06-CTLFireability-08
Could not compute solution for formula : BusinessProcesses-PT-06-CTLFireability-09
Could not compute solution for formula : BusinessProcesses-PT-06-CTLFireability-11
Could not compute solution for formula : BusinessProcesses-PT-06-CTLFireability-12
Could not compute solution for formula : BusinessProcesses-PT-06-CTLFireability-13
Could not compute solution for formula : BusinessProcesses-PT-06-CTLFireability-14
Could not compute solution for formula : BusinessProcesses-PT-06-CTLFireability-15
BK_STOP 1678643879106
--------------------
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-06-CTLFireability-00
ctl formula formula --ctl=/tmp/525/ctl_0_
ctl formula name BusinessProcesses-PT-06-CTLFireability-01
ctl formula formula --ctl=/tmp/525/ctl_1_
ctl formula name BusinessProcesses-PT-06-CTLFireability-02
ctl formula formula --ctl=/tmp/525/ctl_2_
ctl formula name BusinessProcesses-PT-06-CTLFireability-03
ctl formula formula --ctl=/tmp/525/ctl_3_
ctl formula name BusinessProcesses-PT-06-CTLFireability-04
ctl formula formula --ctl=/tmp/525/ctl_4_
ctl formula name BusinessProcesses-PT-06-CTLFireability-05
ctl formula formula --ctl=/tmp/525/ctl_5_
ctl formula name BusinessProcesses-PT-06-CTLFireability-06
ctl formula formula --ctl=/tmp/525/ctl_6_
ctl formula name BusinessProcesses-PT-06-CTLFireability-07
ctl formula formula --ctl=/tmp/525/ctl_7_
ctl formula name BusinessProcesses-PT-06-CTLFireability-08
ctl formula formula --ctl=/tmp/525/ctl_8_
ctl formula name BusinessProcesses-PT-06-CTLFireability-09
ctl formula formula --ctl=/tmp/525/ctl_9_
ctl formula name BusinessProcesses-PT-06-CTLFireability-11
ctl formula formula --ctl=/tmp/525/ctl_10_
ctl formula name BusinessProcesses-PT-06-CTLFireability-12
ctl formula formula --ctl=/tmp/525/ctl_11_
ctl formula name BusinessProcesses-PT-06-CTLFireability-13
ctl formula formula --ctl=/tmp/525/ctl_12_
ctl formula name BusinessProcesses-PT-06-CTLFireability-14
ctl formula formula --ctl=/tmp/525/ctl_13_
ctl formula name BusinessProcesses-PT-06-CTLFireability-15
ctl formula formula --ctl=/tmp/525/ctl_14_
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 340 places, 263 transitions and 760 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 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: 263->261 groups
pnml2lts-sym: Regrouping took 0.060 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 340; there are 261 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: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
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: Exploration took 11301787 group checks and 0 next state calls
pnml2lts-sym: reachability took 230.050 real 916.220 user 2.170 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.480 real 1.900 user 0.000 sys
pnml2lts-sym: state space has 2.09328962261873e+18 states, 1598211 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: 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: 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: 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: 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
Killing (15) : 533
Killing (9) : 533
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-06"
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-06, 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-167813694800490"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-06.tgz
mv BusinessProcesses-PT-06 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 '
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 ;