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-167813694800497.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-07, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694800497
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 9.9K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K 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 100K 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-07-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678640468408

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:01:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:01:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:01:09] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-12 17:01:09] [INFO ] Transformed 386 places.
[2023-03-12 17:01:09] [INFO ] Transformed 360 transitions.
[2023-03-12 17:01:09] [INFO ] Found NUPN structural information;
[2023-03-12 17:01:09] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Support contains 131 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 360/360 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 385 transition count 360
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 357 transition count 332
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 357 transition count 332
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 348 transition count 323
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 348 transition count 323
Applied a total of 75 rules in 61 ms. Remains 348 /386 variables (removed 38) and now considering 323/360 (removed 37) transitions.
// Phase 1: matrix 323 rows 348 cols
[2023-03-12 17:01:10] [INFO ] Computed 61 place invariants in 22 ms
[2023-03-12 17:01:10] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-12 17:01:10] [INFO ] Invariant cache hit.
[2023-03-12 17:01:10] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2023-03-12 17:01:10] [INFO ] Invariant cache hit.
[2023-03-12 17:01:10] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 348/386 places, 323/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 863 ms. Remains : 348/386 places, 323/360 transitions.
Support contains 131 out of 348 places after structural reductions.
[2023-03-12 17:01:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-12 17:01:11] [INFO ] Flatten gal took : 45 ms
[2023-03-12 17:01:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-07-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 17:01:11] [INFO ] Flatten gal took : 19 ms
[2023-03-12 17:01:11] [INFO ] Input system was already deterministic with 323 transitions.
Support contains 119 out of 348 places (down from 131) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 111 resets, run finished after 585 ms. (steps per millisecond=17 ) properties (out of 76) seen :54
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2023-03-12 17:01:11] [INFO ] Invariant cache hit.
[2023-03-12 17:01:12] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-12 17:01:12] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 11 ms returned sat
[2023-03-12 17:01:12] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-12 17:01:12] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-12 17:01:12] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-12 17:01:12] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :21
[2023-03-12 17:01:12] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 15 ms to minimize.
[2023-03-12 17:01:12] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2023-03-12 17:01:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2023-03-12 17:01:13] [INFO ] Deduced a trap composed of 101 places in 91 ms of which 1 ms to minimize.
[2023-03-12 17:01:13] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 0 ms to minimize.
[2023-03-12 17:01:13] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 0 ms to minimize.
[2023-03-12 17:01:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 304 ms
[2023-03-12 17:01:13] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 1 ms to minimize.
[2023-03-12 17:01:13] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 1 ms to minimize.
[2023-03-12 17:01:13] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 0 ms to minimize.
[2023-03-12 17:01:13] [INFO ] Deduced a trap composed of 91 places in 65 ms of which 1 ms to minimize.
[2023-03-12 17:01:13] [INFO ] Deduced a trap composed of 79 places in 67 ms of which 1 ms to minimize.
[2023-03-12 17:01:13] [INFO ] Deduced a trap composed of 86 places in 65 ms of which 0 ms to minimize.
[2023-03-12 17:01:13] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 1 ms to minimize.
[2023-03-12 17:01:14] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 0 ms to minimize.
[2023-03-12 17:01:14] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 1 ms to minimize.
[2023-03-12 17:01:14] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 1 ms to minimize.
[2023-03-12 17:01:14] [INFO ] Deduced a trap composed of 104 places in 73 ms of which 0 ms to minimize.
[2023-03-12 17:01:14] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2023-03-12 17:01:14] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1107 ms
[2023-03-12 17:01:14] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2023-03-12 17:01:14] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2023-03-12 17:01:14] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2023-03-12 17:01:14] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 0 ms to minimize.
[2023-03-12 17:01:15] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2023-03-12 17:01:15] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 0 ms to minimize.
[2023-03-12 17:01:15] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 0 ms to minimize.
[2023-03-12 17:01:15] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 1 ms to minimize.
[2023-03-12 17:01:15] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 0 ms to minimize.
[2023-03-12 17:01:15] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 0 ms to minimize.
[2023-03-12 17:01:15] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 0 ms to minimize.
[2023-03-12 17:01:15] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 0 ms to minimize.
[2023-03-12 17:01:15] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1230 ms
[2023-03-12 17:01:15] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 0 ms to minimize.
[2023-03-12 17:01:15] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 1 ms to minimize.
[2023-03-12 17:01:16] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 0 ms to minimize.
[2023-03-12 17:01:16] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 0 ms to minimize.
[2023-03-12 17:01:16] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 1 ms to minimize.
[2023-03-12 17:01:16] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
[2023-03-12 17:01:16] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 1 ms to minimize.
[2023-03-12 17:01:16] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 0 ms to minimize.
[2023-03-12 17:01:16] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 1 ms to minimize.
[2023-03-12 17:01:16] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 0 ms to minimize.
[2023-03-12 17:01:16] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 1 ms to minimize.
[2023-03-12 17:01:17] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 0 ms to minimize.
[2023-03-12 17:01:17] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 1 ms to minimize.
[2023-03-12 17:01:17] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 0 ms to minimize.
[2023-03-12 17:01:17] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 0 ms to minimize.
[2023-03-12 17:01:17] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1828 ms
[2023-03-12 17:01:17] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 0 ms to minimize.
[2023-03-12 17:01:18] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
[2023-03-12 17:01:18] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 1 ms to minimize.
[2023-03-12 17:01:18] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2023-03-12 17:01:18] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 0 ms to minimize.
[2023-03-12 17:01:18] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 1 ms to minimize.
[2023-03-12 17:01:18] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2023-03-12 17:01:18] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 0 ms to minimize.
[2023-03-12 17:01:18] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2023-03-12 17:01:18] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 0 ms to minimize.
[2023-03-12 17:01:18] [INFO ] Deduced a trap composed of 87 places in 77 ms of which 1 ms to minimize.
[2023-03-12 17:01:19] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 1 ms to minimize.
[2023-03-12 17:01:19] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 4 ms to minimize.
[2023-03-12 17:01:19] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 0 ms to minimize.
[2023-03-12 17:01:19] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2023-03-12 17:01:19] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 0 ms to minimize.
[2023-03-12 17:01:19] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 0 ms to minimize.
[2023-03-12 17:01:19] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 0 ms to minimize.
[2023-03-12 17:01:19] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 1 ms to minimize.
[2023-03-12 17:01:19] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
[2023-03-12 17:01:20] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2023-03-12 17:01:20] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 0 ms to minimize.
[2023-03-12 17:01:20] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 1 ms to minimize.
[2023-03-12 17:01:20] [INFO ] Deduced a trap composed of 83 places in 64 ms of which 1 ms to minimize.
[2023-03-12 17:01:20] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 1 ms to minimize.
[2023-03-12 17:01:20] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 2 ms to minimize.
[2023-03-12 17:01:20] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 0 ms to minimize.
[2023-03-12 17:01:20] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 1 ms to minimize.
[2023-03-12 17:01:20] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 1 ms to minimize.
[2023-03-12 17:01:21] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 1 ms to minimize.
[2023-03-12 17:01:21] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 0 ms to minimize.
[2023-03-12 17:01:21] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 0 ms to minimize.
[2023-03-12 17:01:21] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 1 ms to minimize.
[2023-03-12 17:01:21] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 0 ms to minimize.
[2023-03-12 17:01:21] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 0 ms to minimize.
[2023-03-12 17:01:21] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 1 ms to minimize.
[2023-03-12 17:01:21] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 1 ms to minimize.
[2023-03-12 17:01:22] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 1 ms to minimize.
[2023-03-12 17:01:22] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 0 ms to minimize.
[2023-03-12 17:01:22] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 1 ms to minimize.
[2023-03-12 17:01:22] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 0 ms to minimize.
[2023-03-12 17:01:22] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 1 ms to minimize.
[2023-03-12 17:01:22] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 1 ms to minimize.
[2023-03-12 17:01:22] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 1 ms to minimize.
[2023-03-12 17:01:23] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 0 ms to minimize.
[2023-03-12 17:01:23] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 1 ms to minimize.
[2023-03-12 17:01:23] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 5271 ms
[2023-03-12 17:01:23] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2023-03-12 17:01:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-12 17:01:23] [INFO ] After 10795ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :21
Attempting to minimize the solution found.
Minimization took 300 ms.
[2023-03-12 17:01:23] [INFO ] After 11365ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :21
Fused 22 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 306 ms.
Support contains 33 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 323/323 transitions.
Graph (trivial) has 143 edges and 348 vertex of which 4 / 348 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 766 edges and 345 vertex of which 344 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 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 344 transition count 279
Reduce places removed 39 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 43 rules applied. Total rules applied 84 place count 305 transition count 275
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 88 place count 301 transition count 275
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 88 place count 301 transition count 227
Deduced a syphon composed of 48 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 103 rules applied. Total rules applied 191 place count 246 transition count 227
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 209 place count 228 transition count 209
Iterating global reduction 3 with 18 rules applied. Total rules applied 227 place count 228 transition count 209
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 227 place count 228 transition count 207
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 231 place count 226 transition count 207
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 361 place count 160 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 363 place count 159 transition count 146
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 365 place count 159 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 367 place count 157 transition count 144
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 369 place count 157 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 370 place count 156 transition count 143
Applied a total of 370 rules in 81 ms. Remains 156 /348 variables (removed 192) and now considering 143/323 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 156/348 places, 143/323 transitions.
Incomplete random walk after 10000 steps, including 728 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 21) seen :20
Incomplete Best-First random walk after 10001 steps, including 170 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 143 rows 156 cols
[2023-03-12 17:01:24] [INFO ] Computed 52 place invariants in 7 ms
[2023-03-12 17:01:24] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:01:24] [INFO ] [Nat]Absence check using 31 positive place invariants in 3 ms returned sat
[2023-03-12 17:01:24] [INFO ] [Nat]Absence check using 31 positive and 21 generalized place invariants in 5 ms returned sat
[2023-03-12 17:01:24] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:01:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 17:01:24] [INFO ] After 9ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:01:24] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-12 17:01:24] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-12 17:01:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2023-03-12 17:01:24] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-12 17:01:24] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 143/143 transitions.
Graph (trivial) has 31 edges and 156 vertex of which 3 / 156 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 154 transition count 134
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 148 transition count 134
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 13 place count 148 transition count 122
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 39 place count 134 transition count 122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 133 transition count 121
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 133 transition count 121
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 66 place count 120 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 68 place count 119 transition count 114
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 119 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 118 transition count 113
Applied a total of 70 rules in 29 ms. Remains 118 /156 variables (removed 38) and now considering 113/143 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 118/156 places, 113/143 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 152 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1790626 steps, run timeout after 3001 ms. (steps per millisecond=596 ) properties seen :{}
Probabilistic random walk after 1790626 steps, saw 554792 distinct states, run finished after 3003 ms. (steps per millisecond=596 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 113 rows 118 cols
[2023-03-12 17:01:27] [INFO ] Computed 49 place invariants in 6 ms
[2023-03-12 17:01:27] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:01:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 6 ms returned sat
[2023-03-12 17:01:27] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-12 17:01:27] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:01:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 17:01:27] [INFO ] After 6ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:01:27] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 17:01:27] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 113/113 transitions.
Applied a total of 0 rules in 7 ms. Remains 118 /118 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 118/118 places, 113/113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 113/113 transitions.
Applied a total of 0 rules in 7 ms. Remains 118 /118 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2023-03-12 17:01:27] [INFO ] Invariant cache hit.
[2023-03-12 17:01:27] [INFO ] Implicit Places using invariants in 89 ms returned [0, 3, 9, 10, 11, 35, 37, 38, 39, 40, 41, 42, 43, 81]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 91 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/118 places, 113/113 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 102 ms. Remains : 104/118 places, 113/113 transitions.
Incomplete random walk after 10000 steps, including 564 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2068538 steps, run timeout after 3001 ms. (steps per millisecond=689 ) properties seen :{}
Probabilistic random walk after 2068538 steps, saw 640658 distinct states, run finished after 3001 ms. (steps per millisecond=689 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 113 rows 104 cols
[2023-03-12 17:01:30] [INFO ] Computed 35 place invariants in 4 ms
[2023-03-12 17:01:30] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:01:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-12 17:01:30] [INFO ] [Nat]Absence check using 21 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-12 17:01:30] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:01:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 17:01:30] [INFO ] After 6ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:01:30] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 17:01:30] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 113/113 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 104/104 places, 113/113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 113/113 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2023-03-12 17:01:30] [INFO ] Invariant cache hit.
[2023-03-12 17:01:31] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-12 17:01:31] [INFO ] Invariant cache hit.
[2023-03-12 17:01:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 17:01:31] [INFO ] Implicit Places using invariants and state equation in 138 ms returned [11, 32, 55, 57, 63, 65]
Discarding 6 places :
Drop transitions removed 3 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 10 transitions.
Implicit Place search using SMT with State Equation took 213 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 98/104 places, 103/113 transitions.
Graph (complete) has 330 edges and 98 vertex of which 91 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 90 transition count 102
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 13 place count 80 transition count 64
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 80 transition count 64
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 79 transition count 63
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 79 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 77 transition count 61
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 77 transition count 61
Applied a total of 30 rules in 14 ms. Remains 77 /98 variables (removed 21) and now considering 61/103 (removed 42) transitions.
// Phase 1: matrix 61 rows 77 cols
[2023-03-12 17:01:31] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-12 17:01:31] [INFO ] Implicit Places using invariants in 62 ms returned [11, 12, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 64 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 74/104 places, 61/113 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 74 transition count 58
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 71 transition count 58
Applied a total of 6 rules in 6 ms. Remains 71 /74 variables (removed 3) and now considering 58/61 (removed 3) transitions.
// Phase 1: matrix 58 rows 71 cols
[2023-03-12 17:01:31] [INFO ] Computed 23 place invariants in 0 ms
[2023-03-12 17:01:31] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-12 17:01:31] [INFO ] Invariant cache hit.
[2023-03-12 17:01:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 17:01:31] [INFO ] Implicit Places using invariants and state equation in 82 ms returned [32, 35, 37]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 139 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 68/104 places, 58/113 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 67 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 67 transition count 56
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 23 rules applied. Total rules applied 26 place count 53 transition count 47
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 50 transition count 44
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 50 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 50 transition count 43
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 35 place count 49 transition count 42
Applied a total of 35 rules in 9 ms. Remains 49 /68 variables (removed 19) and now considering 42/58 (removed 16) transitions.
// Phase 1: matrix 42 rows 49 cols
[2023-03-12 17:01:31] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-12 17:01:31] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-12 17:01:31] [INFO ] Invariant cache hit.
[2023-03-12 17:01:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 17:01:31] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 49/104 places, 42/113 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 551 ms. Remains : 49/104 places, 42/113 transitions.
Incomplete random walk after 10000 steps, including 690 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 205 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Probably explored full state space saw : 545976 states, properties seen :0
Probabilistic random walk after 1612337 steps, saw 545976 distinct states, run finished after 1629 ms. (steps per millisecond=989 ) properties seen :0
Explored full state space saw : 546118 states, properties seen :0
Exhaustive walk after 1612745 steps, saw 546118 distinct states, run finished after 1600 ms. (steps per millisecond=1007 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA BusinessProcesses-PT-07-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 17:01:34] [INFO ] Flatten gal took : 16 ms
[2023-03-12 17:01:34] [INFO ] Flatten gal took : 17 ms
[2023-03-12 17:01:34] [INFO ] Input system was already deterministic with 323 transitions.
Computed a total of 215 stabilizing places and 217 stable transitions
Graph (complete) has 770 edges and 348 vertex of which 347 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 323 transition count 298
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 323 transition count 298
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 63 place count 310 transition count 285
Iterating global reduction 0 with 13 rules applied. Total rules applied 76 place count 310 transition count 285
Applied a total of 76 rules in 13 ms. Remains 310 /348 variables (removed 38) and now considering 285/323 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 310/348 places, 285/323 transitions.
[2023-03-12 17:01:34] [INFO ] Flatten gal took : 14 ms
[2023-03-12 17:01:34] [INFO ] Flatten gal took : 35 ms
[2023-03-12 17:01:34] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 317 transition count 292
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 317 transition count 292
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 76 place count 303 transition count 278
Iterating global reduction 0 with 14 rules applied. Total rules applied 90 place count 303 transition count 278
Applied a total of 90 rules in 12 ms. Remains 303 /348 variables (removed 45) and now considering 278/323 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 303/348 places, 278/323 transitions.
[2023-03-12 17:01:34] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:01:34] [INFO ] Flatten gal took : 12 ms
[2023-03-12 17:01:35] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 318 transition count 293
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 318 transition count 293
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 73 place count 305 transition count 280
Iterating global reduction 0 with 13 rules applied. Total rules applied 86 place count 305 transition count 280
Applied a total of 86 rules in 12 ms. Remains 305 /348 variables (removed 43) and now considering 280/323 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 305/348 places, 280/323 transitions.
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 12 ms
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 29 ms
[2023-03-12 17:01:35] [INFO ] Input system was already deterministic with 280 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 321 transition count 296
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 321 transition count 296
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 64 place count 311 transition count 286
Iterating global reduction 0 with 10 rules applied. Total rules applied 74 place count 311 transition count 286
Applied a total of 74 rules in 15 ms. Remains 311 /348 variables (removed 37) and now considering 286/323 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 311/348 places, 286/323 transitions.
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 12 ms
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:01:35] [INFO ] Input system was already deterministic with 286 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 321 transition count 296
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 321 transition count 296
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 65 place count 310 transition count 285
Iterating global reduction 0 with 11 rules applied. Total rules applied 76 place count 310 transition count 285
Applied a total of 76 rules in 16 ms. Remains 310 /348 variables (removed 38) and now considering 285/323 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 310/348 places, 285/323 transitions.
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:01:35] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 319 transition count 294
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 319 transition count 294
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 71 place count 306 transition count 281
Iterating global reduction 0 with 13 rules applied. Total rules applied 84 place count 306 transition count 281
Applied a total of 84 rules in 19 ms. Remains 306 /348 variables (removed 42) and now considering 281/323 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 306/348 places, 281/323 transitions.
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 12 ms
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:01:35] [INFO ] Input system was already deterministic with 281 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 319 transition count 294
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 319 transition count 294
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 71 place count 306 transition count 281
Iterating global reduction 0 with 13 rules applied. Total rules applied 84 place count 306 transition count 281
Applied a total of 84 rules in 29 ms. Remains 306 /348 variables (removed 42) and now considering 281/323 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 306/348 places, 281/323 transitions.
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:01:35] [INFO ] Input system was already deterministic with 281 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 320 transition count 295
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 320 transition count 295
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 66 place count 310 transition count 285
Iterating global reduction 0 with 10 rules applied. Total rules applied 76 place count 310 transition count 285
Applied a total of 76 rules in 26 ms. Remains 310 /348 variables (removed 38) and now considering 285/323 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 310/348 places, 285/323 transitions.
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:01:35] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 320 transition count 295
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 320 transition count 295
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 306 transition count 281
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 306 transition count 281
Applied a total of 84 rules in 26 ms. Remains 306 /348 variables (removed 42) and now considering 281/323 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 306/348 places, 281/323 transitions.
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:01:35] [INFO ] Input system was already deterministic with 281 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Graph (trivial) has 173 edges and 348 vertex of which 7 / 348 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 763 edges and 342 vertex of which 341 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 340 transition count 264
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 290 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 289 transition count 263
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 104 place count 289 transition count 204
Deduced a syphon composed of 59 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 127 rules applied. Total rules applied 231 place count 221 transition count 204
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 256 place count 196 transition count 179
Iterating global reduction 3 with 25 rules applied. Total rules applied 281 place count 196 transition count 179
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 281 place count 196 transition count 175
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 289 place count 192 transition count 175
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 131 rules applied. Total rules applied 420 place count 125 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 421 place count 124 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 422 place count 123 transition count 110
Applied a total of 422 rules in 36 ms. Remains 123 /348 variables (removed 225) and now considering 110/323 (removed 213) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 123/348 places, 110/323 transitions.
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:01:35] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 317 transition count 292
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 317 transition count 292
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 76 place count 303 transition count 278
Iterating global reduction 0 with 14 rules applied. Total rules applied 90 place count 303 transition count 278
Applied a total of 90 rules in 26 ms. Remains 303 /348 variables (removed 45) and now considering 278/323 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 303/348 places, 278/323 transitions.
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 8 ms
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 8 ms
[2023-03-12 17:01:35] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 318 transition count 293
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 318 transition count 293
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 74 place count 304 transition count 279
Iterating global reduction 0 with 14 rules applied. Total rules applied 88 place count 304 transition count 279
Applied a total of 88 rules in 25 ms. Remains 304 /348 variables (removed 44) and now considering 279/323 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 304/348 places, 279/323 transitions.
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:01:35] [INFO ] Input system was already deterministic with 279 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 317 transition count 292
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 317 transition count 292
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 76 place count 303 transition count 278
Iterating global reduction 0 with 14 rules applied. Total rules applied 90 place count 303 transition count 278
Applied a total of 90 rules in 24 ms. Remains 303 /348 variables (removed 45) and now considering 278/323 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 303/348 places, 278/323 transitions.
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 8 ms
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:01:35] [INFO ] Input system was already deterministic with 278 transitions.
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:01:35] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:01:35] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-12 17:01:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 348 places, 323 transitions and 1035 arcs took 2 ms.
Total runtime 26017 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/823/ctl_0_ --ctl=/tmp/823/ctl_1_ --ctl=/tmp/823/ctl_2_ --ctl=/tmp/823/ctl_3_ --ctl=/tmp/823/ctl_4_ --ctl=/tmp/823/ctl_5_ --ctl=/tmp/823/ctl_6_ --ctl=/tmp/823/ctl_7_ --ctl=/tmp/823/ctl_8_ --ctl=/tmp/823/ctl_9_ --ctl=/tmp/823/ctl_10_ --ctl=/tmp/823/ctl_11_ --ctl=/tmp/823/ctl_12_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 14030816 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098924 kB
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-00
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-01
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-02
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-03
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-07
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-08
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-09
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-10
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-11
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-12
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-13
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-14
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-15

BK_STOP 1678644067327

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name BusinessProcesses-PT-07-CTLCardinality-00
ctl formula formula --ctl=/tmp/823/ctl_0_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-01
ctl formula formula --ctl=/tmp/823/ctl_1_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-02
ctl formula formula --ctl=/tmp/823/ctl_2_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-03
ctl formula formula --ctl=/tmp/823/ctl_3_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-07
ctl formula formula --ctl=/tmp/823/ctl_4_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-08
ctl formula formula --ctl=/tmp/823/ctl_5_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-09
ctl formula formula --ctl=/tmp/823/ctl_6_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-10
ctl formula formula --ctl=/tmp/823/ctl_7_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-11
ctl formula formula --ctl=/tmp/823/ctl_8_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-12
ctl formula formula --ctl=/tmp/823/ctl_9_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-13
ctl formula formula --ctl=/tmp/823/ctl_10_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-14
ctl formula formula --ctl=/tmp/823/ctl_11_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-15
ctl formula formula --ctl=/tmp/823/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 348 places, 323 transitions and 1035 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: 323->322 groups
pnml2lts-sym: Regrouping took 0.090 real 0.090 user 0.000 sys
pnml2lts-sym: state vector length is 348; there are 322 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...
Killing (15) : 829
Killing (9) : 829

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-07"
export BK_EXAMINATION="CTLCardinality"
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-07, examination is CTLCardinality"
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-167813694800497"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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