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.r039-tajo-167813692700561.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 lolaxred
Input is BusinessProcesses-PT-15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692700561
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:45 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.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 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 157K 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-15-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678503380409

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=lolaxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-15
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:56:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:56:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:56:22] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-11 02:56:22] [INFO ] Transformed 630 places.
[2023-03-11 02:56:22] [INFO ] Transformed 566 transitions.
[2023-03-11 02:56:22] [INFO ] Found NUPN structural information;
[2023-03-11 02:56:22] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-15-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 117 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 625 transition count 562
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 73 place count 553 transition count 490
Iterating global reduction 1 with 72 rules applied. Total rules applied 145 place count 553 transition count 490
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 175 place count 523 transition count 460
Iterating global reduction 1 with 30 rules applied. Total rules applied 205 place count 523 transition count 460
Applied a total of 205 rules in 101 ms. Remains 523 /626 variables (removed 103) and now considering 460/562 (removed 102) transitions.
// Phase 1: matrix 460 rows 523 cols
[2023-03-11 02:56:22] [INFO ] Computed 101 place invariants in 27 ms
[2023-03-11 02:56:22] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-11 02:56:22] [INFO ] Invariant cache hit.
[2023-03-11 02:56:23] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
[2023-03-11 02:56:23] [INFO ] Invariant cache hit.
[2023-03-11 02:56:23] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 523/626 places, 460/562 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1305 ms. Remains : 523/626 places, 460/562 transitions.
Support contains 117 out of 523 places after structural reductions.
[2023-03-11 02:56:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 02:56:23] [INFO ] Flatten gal took : 59 ms
FORMULA BusinessProcesses-PT-15-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 02:56:23] [INFO ] Flatten gal took : 31 ms
[2023-03-11 02:56:23] [INFO ] Input system was already deterministic with 460 transitions.
Support contains 110 out of 523 places (down from 117) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 56) seen :21
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) 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 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 35) 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 35) 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 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) 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 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 35) 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 35) 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 35) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 34) 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 34) 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 34) 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 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) 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 34) 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 34) 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 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) seen :0
Running SMT prover for 34 properties.
[2023-03-11 02:56:24] [INFO ] Invariant cache hit.
[2023-03-11 02:56:24] [INFO ] After 337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:34
[2023-03-11 02:56:25] [INFO ] [Nat]Absence check using 60 positive place invariants in 16 ms returned sat
[2023-03-11 02:56:25] [INFO ] [Nat]Absence check using 60 positive and 41 generalized place invariants in 9 ms returned sat
[2023-03-11 02:56:26] [INFO ] After 854ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :30
[2023-03-11 02:56:26] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 8 ms to minimize.
[2023-03-11 02:56:26] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 1 ms to minimize.
[2023-03-11 02:56:26] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2023-03-11 02:56:26] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 1 ms to minimize.
[2023-03-11 02:56:26] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2023-03-11 02:56:26] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 0 ms to minimize.
[2023-03-11 02:56:27] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2023-03-11 02:56:27] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2023-03-11 02:56:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1022 ms
[2023-03-11 02:56:27] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 1 ms to minimize.
[2023-03-11 02:56:27] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2023-03-11 02:56:27] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2023-03-11 02:56:27] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 0 ms to minimize.
[2023-03-11 02:56:27] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2023-03-11 02:56:27] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2023-03-11 02:56:27] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 0 ms to minimize.
[2023-03-11 02:56:28] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2023-03-11 02:56:28] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2023-03-11 02:56:28] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2023-03-11 02:56:28] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2023-03-11 02:56:28] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1120 ms
[2023-03-11 02:56:28] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2023-03-11 02:56:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-03-11 02:56:28] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 0 ms to minimize.
[2023-03-11 02:56:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-11 02:56:29] [INFO ] Deduced a trap composed of 94 places in 171 ms of which 1 ms to minimize.
[2023-03-11 02:56:29] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 0 ms to minimize.
[2023-03-11 02:56:29] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 0 ms to minimize.
[2023-03-11 02:56:29] [INFO ] Deduced a trap composed of 98 places in 160 ms of which 1 ms to minimize.
[2023-03-11 02:56:29] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
[2023-03-11 02:56:29] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2023-03-11 02:56:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 857 ms
[2023-03-11 02:56:30] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 1 ms to minimize.
[2023-03-11 02:56:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-11 02:56:30] [INFO ] Deduced a trap composed of 98 places in 159 ms of which 1 ms to minimize.
[2023-03-11 02:56:30] [INFO ] Deduced a trap composed of 104 places in 151 ms of which 1 ms to minimize.
[2023-03-11 02:56:30] [INFO ] Deduced a trap composed of 99 places in 139 ms of which 1 ms to minimize.
[2023-03-11 02:56:30] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 0 ms to minimize.
[2023-03-11 02:56:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 731 ms
[2023-03-11 02:56:31] [INFO ] After 6248ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :30
Attempting to minimize the solution found.
Minimization took 578 ms.
[2023-03-11 02:56:32] [INFO ] After 7308ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :30
Fused 34 Parikh solutions to 30 different solutions.
Parikh walk visited 6 properties in 899 ms.
Support contains 49 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 460/460 transitions.
Graph (trivial) has 210 edges and 523 vertex of which 4 / 523 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 1152 edges and 520 vertex of which 517 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 517 transition count 403
Reduce places removed 52 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 58 rules applied. Total rules applied 112 place count 465 transition count 397
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 118 place count 459 transition count 397
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 118 place count 459 transition count 316
Deduced a syphon composed of 81 places in 6 ms
Ensure Unique test removed 11 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 173 rules applied. Total rules applied 291 place count 367 transition count 316
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 305 place count 353 transition count 302
Iterating global reduction 3 with 14 rules applied. Total rules applied 319 place count 353 transition count 302
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 319 place count 353 transition count 299
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 325 place count 350 transition count 299
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 223 rules applied. Total rules applied 548 place count 238 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 550 place count 237 transition count 192
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 553 place count 237 transition count 189
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 556 place count 234 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 557 place count 233 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 558 place count 232 transition count 188
Applied a total of 558 rules in 173 ms. Remains 232 /523 variables (removed 291) and now considering 188/460 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 232/523 places, 188/460 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 679 ms. (steps per millisecond=14 ) properties (out of 24) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 188 rows 232 cols
[2023-03-11 02:56:35] [INFO ] Computed 86 place invariants in 5 ms
[2023-03-11 02:56:35] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 02:56:35] [INFO ] [Nat]Absence check using 57 positive place invariants in 9 ms returned sat
[2023-03-11 02:56:35] [INFO ] [Nat]Absence check using 57 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-11 02:56:35] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 02:56:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:56:35] [INFO ] After 40ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 02:56:35] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2023-03-11 02:56:36] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 4 ms to minimize.
[2023-03-11 02:56:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2023-03-11 02:56:36] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 0 ms to minimize.
[2023-03-11 02:56:36] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 0 ms to minimize.
[2023-03-11 02:56:36] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 0 ms to minimize.
[2023-03-11 02:56:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 302 ms
[2023-03-11 02:56:36] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2023-03-11 02:56:36] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2023-03-11 02:56:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2023-03-11 02:56:36] [INFO ] After 656ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-11 02:56:36] [INFO ] After 929ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 69 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=69 )
Parikh walk visited 5 properties in 4 ms.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-15-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 02:56:36] [INFO ] Flatten gal took : 22 ms
[2023-03-11 02:56:36] [INFO ] Flatten gal took : 21 ms
[2023-03-11 02:56:36] [INFO ] Input system was already deterministic with 460 transitions.
Computed a total of 223 stabilizing places and 193 stable transitions
Graph (complete) has 1156 edges and 523 vertex of which 520 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.14 ms
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 521 transition count 460
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 495 transition count 434
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 495 transition count 434
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 65 place count 484 transition count 423
Iterating global reduction 1 with 11 rules applied. Total rules applied 76 place count 484 transition count 423
Applied a total of 76 rules in 57 ms. Remains 484 /523 variables (removed 39) and now considering 423/460 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 484/523 places, 423/460 transitions.
[2023-03-11 02:56:36] [INFO ] Flatten gal took : 15 ms
[2023-03-11 02:56:36] [INFO ] Flatten gal took : 16 ms
[2023-03-11 02:56:36] [INFO ] Input system was already deterministic with 423 transitions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 521 transition count 460
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 497 transition count 436
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 497 transition count 436
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 60 place count 487 transition count 426
Iterating global reduction 1 with 10 rules applied. Total rules applied 70 place count 487 transition count 426
Applied a total of 70 rules in 44 ms. Remains 487 /523 variables (removed 36) and now considering 426/460 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 487/523 places, 426/460 transitions.
[2023-03-11 02:56:36] [INFO ] Flatten gal took : 16 ms
[2023-03-11 02:56:36] [INFO ] Flatten gal took : 19 ms
[2023-03-11 02:56:36] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Graph (trivial) has 256 edges and 523 vertex of which 7 / 523 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1149 edges and 517 vertex of which 514 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 513 transition count 384
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 446 transition count 384
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 136 place count 446 transition count 285
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 352 place count 329 transition count 285
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 376 place count 305 transition count 261
Iterating global reduction 2 with 24 rules applied. Total rules applied 400 place count 305 transition count 261
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 400 place count 305 transition count 257
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 409 place count 300 transition count 257
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 247 rules applied. Total rules applied 656 place count 175 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 657 place count 174 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 658 place count 173 transition count 134
Applied a total of 658 rules in 72 ms. Remains 173 /523 variables (removed 350) and now considering 134/460 (removed 326) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72 ms. Remains : 173/523 places, 134/460 transitions.
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 10 ms
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 9 ms
[2023-03-11 02:56:37] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 522 transition count 460
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 499 transition count 437
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 499 transition count 437
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 489 transition count 427
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 489 transition count 427
Applied a total of 67 rules in 66 ms. Remains 489 /523 variables (removed 34) and now considering 427/460 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 489/523 places, 427/460 transitions.
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 19 ms
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 19 ms
[2023-03-11 02:56:37] [INFO ] Input system was already deterministic with 427 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Graph (trivial) has 245 edges and 523 vertex of which 4 / 523 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 1153 edges and 520 vertex of which 517 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 516 transition count 393
Reduce places removed 62 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 454 transition count 391
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 452 transition count 391
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 130 place count 452 transition count 291
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 349 place count 333 transition count 291
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 369 place count 313 transition count 271
Iterating global reduction 3 with 20 rules applied. Total rules applied 389 place count 313 transition count 271
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 389 place count 313 transition count 266
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 400 place count 307 transition count 266
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 239 rules applied. Total rules applied 639 place count 186 transition count 148
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 640 place count 186 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 641 place count 185 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 642 place count 184 transition count 147
Applied a total of 642 rules in 70 ms. Remains 184 /523 variables (removed 339) and now considering 147/460 (removed 313) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 70 ms. Remains : 184/523 places, 147/460 transitions.
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:56:37] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 521 transition count 460
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 496 transition count 435
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 496 transition count 435
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 63 place count 485 transition count 424
Iterating global reduction 1 with 11 rules applied. Total rules applied 74 place count 485 transition count 424
Applied a total of 74 rules in 27 ms. Remains 485 /523 variables (removed 38) and now considering 424/460 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 485/523 places, 424/460 transitions.
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 13 ms
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 15 ms
[2023-03-11 02:56:37] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 521 transition count 460
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 495 transition count 434
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 495 transition count 434
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 65 place count 484 transition count 423
Iterating global reduction 1 with 11 rules applied. Total rules applied 76 place count 484 transition count 423
Applied a total of 76 rules in 28 ms. Remains 484 /523 variables (removed 39) and now considering 423/460 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 484/523 places, 423/460 transitions.
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 14 ms
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 14 ms
[2023-03-11 02:56:37] [INFO ] Input system was already deterministic with 423 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Graph (trivial) has 249 edges and 523 vertex of which 7 / 523 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1149 edges and 517 vertex of which 514 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 513 transition count 388
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 450 transition count 387
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 449 transition count 387
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 130 place count 449 transition count 291
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 340 place count 335 transition count 291
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 362 place count 313 transition count 269
Iterating global reduction 3 with 22 rules applied. Total rules applied 384 place count 313 transition count 269
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 384 place count 313 transition count 264
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 395 place count 307 transition count 264
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 239 rules applied. Total rules applied 634 place count 186 transition count 146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 635 place count 185 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 636 place count 184 transition count 145
Applied a total of 636 rules in 53 ms. Remains 184 /523 variables (removed 339) and now considering 145/460 (removed 315) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 184/523 places, 145/460 transitions.
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:56:37] [INFO ] Input system was already deterministic with 145 transitions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 521 transition count 460
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 496 transition count 435
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 496 transition count 435
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 63 place count 485 transition count 424
Iterating global reduction 1 with 11 rules applied. Total rules applied 74 place count 485 transition count 424
Applied a total of 74 rules in 23 ms. Remains 485 /523 variables (removed 38) and now considering 424/460 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 485/523 places, 424/460 transitions.
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 13 ms
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 14 ms
[2023-03-11 02:56:37] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Graph (trivial) has 256 edges and 523 vertex of which 7 / 523 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1149 edges and 517 vertex of which 515 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 514 transition count 386
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 449 transition count 386
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 132 place count 449 transition count 284
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 356 place count 327 transition count 284
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 380 place count 303 transition count 260
Iterating global reduction 2 with 24 rules applied. Total rules applied 404 place count 303 transition count 260
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 404 place count 303 transition count 255
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 415 place count 297 transition count 255
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 241 rules applied. Total rules applied 656 place count 175 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 657 place count 174 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 658 place count 173 transition count 135
Applied a total of 658 rules in 37 ms. Remains 173 /523 variables (removed 350) and now considering 135/460 (removed 325) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 173/523 places, 135/460 transitions.
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:56:37] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Graph (trivial) has 256 edges and 523 vertex of which 7 / 523 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 1149 edges and 517 vertex of which 514 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 513 transition count 386
Reduce places removed 65 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 67 rules applied. Total rules applied 134 place count 448 transition count 384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 136 place count 446 transition count 384
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 136 place count 446 transition count 285
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 353 place count 328 transition count 285
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 377 place count 304 transition count 261
Iterating global reduction 3 with 24 rules applied. Total rules applied 401 place count 304 transition count 261
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 401 place count 304 transition count 256
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 412 place count 298 transition count 256
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 243 rules applied. Total rules applied 655 place count 175 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 656 place count 174 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 657 place count 173 transition count 135
Applied a total of 657 rules in 38 ms. Remains 173 /523 variables (removed 350) and now considering 135/460 (removed 325) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 173/523 places, 135/460 transitions.
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:56:37] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Graph (trivial) has 243 edges and 523 vertex of which 7 / 523 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 1149 edges and 517 vertex of which 514 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 513 transition count 389
Reduce places removed 62 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 451 transition count 387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 449 transition count 387
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 130 place count 449 transition count 295
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 330 place count 341 transition count 295
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 350 place count 321 transition count 275
Iterating global reduction 3 with 20 rules applied. Total rules applied 370 place count 321 transition count 275
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 370 place count 321 transition count 272
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 377 place count 317 transition count 272
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 619 place count 195 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 620 place count 194 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 621 place count 193 transition count 151
Applied a total of 621 rules in 39 ms. Remains 193 /523 variables (removed 330) and now considering 151/460 (removed 309) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 193/523 places, 151/460 transitions.
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:56:37] [INFO ] Input system was already deterministic with 151 transitions.
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 13 ms
[2023-03-11 02:56:37] [INFO ] Flatten gal took : 14 ms
[2023-03-11 02:56:37] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-11 02:56:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 523 places, 460 transitions and 1453 arcs took 3 ms.
Total runtime 15990 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-15
BK_EXAMINATION: CTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/368

FORMULA BusinessProcesses-PT-15-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678503399019

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/368/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/368/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/368/CTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: rewrite Frontend/Parser/formula_rewrite.k:463
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:472
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: RELEASE
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: RELEASE
lola: RELEASE
lola: RELEASE
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:472
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: RELEASE
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: RELEASE
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: LAUNCH task # 7 (type EXCL) for 6 BusinessProcesses-PT-15-CTLCardinality-02
lola: time limit : 257 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: FINISHED task # 7 (type EXCL) for BusinessProcesses-PT-15-CTLCardinality-02
lola: result : true
lola: markings : 13962
lola: fired transitions : 41741
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 BusinessProcesses-PT-15-CTLCardinality-01
lola: time limit : 276 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: FINISHED task # 4 (type EXCL) for BusinessProcesses-PT-15-CTLCardinality-01
lola: result : false
lola: markings : 308
lola: fired transitions : 387
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 33 (type EXCL) for 32 BusinessProcesses-PT-15-CTLCardinality-10
lola: time limit : 300 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 47 (type FNDP) for 12 BusinessProcesses-PT-15-CTLCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 48 (type EQUN) for 12 BusinessProcesses-PT-15-CTLCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 50 (type SRCH) for 12 BusinessProcesses-PT-15-CTLCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 50 (type SRCH) for BusinessProcesses-PT-15-CTLCardinality-05
lola: result : unknown
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 47 (type FNDP) for BusinessProcesses-PT-15-CTLCardinality-05
lola: result : true
lola: fired transitions : 85
lola: tried executions : 17
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 48 (type EQUN) for BusinessProcesses-PT-15-CTLCardinality-05 (obsolete)
sara: try reading problem file /home/mcc/execution/368/CTLCardinality-48.sara.
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 48 (type EQUN) for BusinessProcesses-PT-15-CTLCardinality-05
lola: result : true
lola: FINISHED task # 33 (type EXCL) for BusinessProcesses-PT-15-CTLCardinality-10
lola: result : true
lola: markings : 9141
lola: fired transitions : 12516
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 27 (type EXCL) for 26 BusinessProcesses-PT-15-CTLCardinality-07
lola: time limit : 450 sec
lola: memory limit: 32 pages
lola: FINISHED task # 27 (type EXCL) for BusinessProcesses-PT-15-CTLCardinality-07
lola: result : true
lola: markings : 6941
lola: fired transitions : 7428
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 BusinessProcesses-PT-15-CTLCardinality-04
lola: time limit : 514 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for BusinessProcesses-PT-15-CTLCardinality-04
lola: result : false
lola: markings : 2326
lola: fired transitions : 4481
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 BusinessProcesses-PT-15-CTLCardinality-00
lola: time limit : 600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for BusinessProcesses-PT-15-CTLCardinality-00
lola: result : false
lola: markings : 160
lola: fired transitions : 159
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 46 (type EXCL) for 23 BusinessProcesses-PT-15-CTLCardinality-06
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: FINISHED task # 46 (type EXCL) for BusinessProcesses-PT-15-CTLCardinality-06
lola: result : true
lola: markings : 11347
lola: fired transitions : 26096
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 44 (type EXCL) for 29 BusinessProcesses-PT-15-CTLCardinality-08
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 44 (type EXCL) for BusinessProcesses-PT-15-CTLCardinality-08
lola: result : false
lola: markings : 77
lola: fired transitions : 113
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 39 (type EXCL) for 38 BusinessProcesses-PT-15-CTLCardinality-12
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 39 (type EXCL) for BusinessProcesses-PT-15-CTLCardinality-12
lola: result : true
lola: markings : 14
lola: fired transitions : 14
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 36 (type EXCL) for 35 BusinessProcesses-PT-15-CTLCardinality-11
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 36 (type EXCL) for BusinessProcesses-PT-15-CTLCardinality-11
lola: result : false
lola: markings : 5007
lola: fired transitions : 18074
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 42 (type EXCL) for 41 BusinessProcesses-PT-15-CTLCardinality-13
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 42 (type EXCL) for BusinessProcesses-PT-15-CTLCardinality-13
lola: result : true
lola: markings : 32
lola: fired transitions : 36
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-15-CTLCardinality-00: CTL false CTL model checker
BusinessProcesses-PT-15-CTLCardinality-01: CTL false CTL model checker
BusinessProcesses-PT-15-CTLCardinality-02: AGEF true tscc_search
BusinessProcesses-PT-15-CTLCardinality-04: CTL false CTL model checker
BusinessProcesses-PT-15-CTLCardinality-05: DISJ true findpath
BusinessProcesses-PT-15-CTLCardinality-06: SP ECTL false LTL model checker
BusinessProcesses-PT-15-CTLCardinality-07: CTL true CTL model checker
BusinessProcesses-PT-15-CTLCardinality-08: SP ACTL false LTL model checker
BusinessProcesses-PT-15-CTLCardinality-10: CTL true CTL model checker
BusinessProcesses-PT-15-CTLCardinality-11: CTL false CTL model checker
BusinessProcesses-PT-15-CTLCardinality-12: CTL true CTL model checker
BusinessProcesses-PT-15-CTLCardinality-13: CTL true CTL model checker


Time elapsed: 0 secs. Pages in use: 2

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-15"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is BusinessProcesses-PT-15, 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 r039-tajo-167813692700561"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-15.tgz
mv BusinessProcesses-PT-15 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 ;