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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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.4K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K 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 148K 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-13-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678503095857

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-13
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:51:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:51:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:51:37] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-11 02:51:37] [INFO ] Transformed 593 places.
[2023-03-11 02:51:37] [INFO ] Transformed 536 transitions.
[2023-03-11 02:51:37] [INFO ] Found NUPN structural information;
[2023-03-11 02:51:37] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BusinessProcesses-PT-13-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 92 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 581 transition count 528
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 78 place count 507 transition count 454
Iterating global reduction 1 with 74 rules applied. Total rules applied 152 place count 507 transition count 454
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 187 place count 472 transition count 419
Iterating global reduction 1 with 35 rules applied. Total rules applied 222 place count 472 transition count 419
Applied a total of 222 rules in 93 ms. Remains 472 /585 variables (removed 113) and now considering 419/528 (removed 109) transitions.
// Phase 1: matrix 419 rows 472 cols
[2023-03-11 02:51:37] [INFO ] Computed 91 place invariants in 28 ms
[2023-03-11 02:51:38] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-11 02:51:38] [INFO ] Invariant cache hit.
[2023-03-11 02:51:38] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2023-03-11 02:51:38] [INFO ] Invariant cache hit.
[2023-03-11 02:51:38] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/585 places, 419/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1085 ms. Remains : 472/585 places, 419/528 transitions.
Support contains 92 out of 472 places after structural reductions.
[2023-03-11 02:51:38] [INFO ] Flatten gal took : 94 ms
[2023-03-11 02:51:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-13-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 02:51:39] [INFO ] Flatten gal took : 36 ms
[2023-03-11 02:51:39] [INFO ] Input system was already deterministic with 419 transitions.
Support contains 90 out of 472 places (down from 92) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 51) seen :24
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
[2023-03-11 02:51:40] [INFO ] Invariant cache hit.
[2023-03-11 02:51:40] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-11 02:51:40] [INFO ] [Nat]Absence check using 53 positive place invariants in 54 ms returned sat
[2023-03-11 02:51:40] [INFO ] [Nat]Absence check using 53 positive and 38 generalized place invariants in 19 ms returned sat
[2023-03-11 02:51:42] [INFO ] After 912ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :24
[2023-03-11 02:51:42] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 6 ms to minimize.
[2023-03-11 02:51:42] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2023-03-11 02:51:42] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2023-03-11 02:51:42] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2023-03-11 02:51:42] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2023-03-11 02:51:42] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2023-03-11 02:51:42] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 0 ms to minimize.
[2023-03-11 02:51:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 816 ms
[2023-03-11 02:51:43] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
[2023-03-11 02:51:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2023-03-11 02:51:43] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2023-03-11 02:51:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-11 02:51:43] [INFO ] Deduced a trap composed of 82 places in 173 ms of which 1 ms to minimize.
[2023-03-11 02:51:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-11 02:51:43] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 0 ms to minimize.
[2023-03-11 02:51:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2023-03-11 02:51:43] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 0 ms to minimize.
[2023-03-11 02:51:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-03-11 02:51:44] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 1 ms to minimize.
[2023-03-11 02:51:44] [INFO ] Deduced a trap composed of 86 places in 220 ms of which 1 ms to minimize.
[2023-03-11 02:51:44] [INFO ] Deduced a trap composed of 83 places in 191 ms of which 2 ms to minimize.
[2023-03-11 02:51:44] [INFO ] Deduced a trap composed of 91 places in 169 ms of which 1 ms to minimize.
[2023-03-11 02:51:45] [INFO ] Deduced a trap composed of 100 places in 162 ms of which 1 ms to minimize.
[2023-03-11 02:51:45] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 1 ms to minimize.
[2023-03-11 02:51:45] [INFO ] Deduced a trap composed of 86 places in 165 ms of which 0 ms to minimize.
[2023-03-11 02:51:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1359 ms
[2023-03-11 02:51:46] [INFO ] Deduced a trap composed of 82 places in 221 ms of which 1 ms to minimize.
[2023-03-11 02:51:46] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 1 ms to minimize.
[2023-03-11 02:51:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 466 ms
[2023-03-11 02:51:46] [INFO ] After 5195ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :24
Attempting to minimize the solution found.
Minimization took 440 ms.
[2023-03-11 02:51:46] [INFO ] After 6330ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :24
Fused 27 Parikh solutions to 23 different solutions.
Parikh walk visited 7 properties in 357 ms.
Support contains 32 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 419/419 transitions.
Graph (trivial) has 195 edges and 472 vertex of which 6 / 472 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1054 edges and 467 vertex of which 466 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 466 transition count 363
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 418 transition count 361
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 102 place count 416 transition count 361
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 102 place count 416 transition count 285
Deduced a syphon composed of 76 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 266 place count 328 transition count 285
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 277 place count 317 transition count 274
Iterating global reduction 3 with 11 rules applied. Total rules applied 288 place count 317 transition count 274
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 288 place count 317 transition count 272
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 292 place count 315 transition count 272
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 512 place count 203 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 514 place count 202 transition count 168
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 516 place count 202 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 518 place count 200 transition count 166
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 519 place count 200 transition count 166
Applied a total of 519 rules in 106 ms. Remains 200 /472 variables (removed 272) and now considering 166/419 (removed 253) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 200/472 places, 166/419 transitions.
Incomplete random walk after 10000 steps, including 280 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 17) seen :16
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 166 rows 200 cols
[2023-03-11 02:51:47] [INFO ] Computed 75 place invariants in 3 ms
[2023-03-11 02:51:47] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:51:47] [INFO ] [Nat]Absence check using 53 positive place invariants in 7 ms returned sat
[2023-03-11 02:51:47] [INFO ] [Nat]Absence check using 53 positive and 22 generalized place invariants in 5 ms returned sat
[2023-03-11 02:51:47] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:51:47] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-11 02:51:47] [INFO ] After 12ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:51:47] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2023-03-11 02:51:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-11 02:51:47] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-11 02:51:47] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 46 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
Parikh walk visited 1 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2023-03-11 02:51:47] [INFO ] Flatten gal took : 21 ms
[2023-03-11 02:51:47] [INFO ] Flatten gal took : 22 ms
[2023-03-11 02:51:47] [INFO ] Input system was already deterministic with 419 transitions.
Computed a total of 131 stabilizing places and 123 stable transitions
Graph (complete) has 1061 edges and 472 vertex of which 470 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 419/419 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 471 transition count 419
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 452 transition count 400
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 452 transition count 400
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 448 transition count 396
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 448 transition count 396
Applied a total of 47 rules in 36 ms. Remains 448 /472 variables (removed 24) and now considering 396/419 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 448/472 places, 396/419 transitions.
[2023-03-11 02:51:47] [INFO ] Flatten gal took : 17 ms
[2023-03-11 02:51:47] [INFO ] Flatten gal took : 16 ms
[2023-03-11 02:51:47] [INFO ] Input system was already deterministic with 396 transitions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 419/419 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 471 transition count 419
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 453 transition count 401
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 453 transition count 401
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 448 transition count 396
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 448 transition count 396
Applied a total of 47 rules in 36 ms. Remains 448 /472 variables (removed 24) and now considering 396/419 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 448/472 places, 396/419 transitions.
[2023-03-11 02:51:47] [INFO ] Flatten gal took : 16 ms
[2023-03-11 02:51:47] [INFO ] Flatten gal took : 17 ms
[2023-03-11 02:51:47] [INFO ] Input system was already deterministic with 396 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 472/472 places, 419/419 transitions.
Graph (trivial) has 220 edges and 472 vertex of which 6 / 472 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1055 edges and 467 vertex of which 465 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 464 transition count 357
Reduce places removed 54 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 410 transition count 356
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 409 transition count 356
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 112 place count 409 transition count 263
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 203 rules applied. Total rules applied 315 place count 299 transition count 263
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 333 place count 281 transition count 245
Iterating global reduction 3 with 18 rules applied. Total rules applied 351 place count 281 transition count 245
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 351 place count 281 transition count 242
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 357 place count 278 transition count 242
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 561 place count 174 transition count 142
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 567 place count 174 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 568 place count 173 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 569 place count 172 transition count 141
Applied a total of 569 rules in 56 ms. Remains 172 /472 variables (removed 300) and now considering 141/419 (removed 278) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 172/472 places, 141/419 transitions.
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 8 ms
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 8 ms
[2023-03-11 02:51:48] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 472/472 places, 419/419 transitions.
Graph (trivial) has 226 edges and 472 vertex of which 6 / 472 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1055 edges and 467 vertex of which 465 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 464 transition count 355
Reduce places removed 56 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 408 transition count 354
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 407 transition count 354
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 116 place count 407 transition count 260
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 321 place count 296 transition count 260
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 340 place count 277 transition count 241
Iterating global reduction 3 with 19 rules applied. Total rules applied 359 place count 277 transition count 241
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 359 place count 277 transition count 238
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 365 place count 274 transition count 238
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 585 place count 162 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 586 place count 161 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 587 place count 160 transition count 129
Applied a total of 587 rules in 52 ms. Remains 160 /472 variables (removed 312) and now considering 129/419 (removed 290) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 160/472 places, 129/419 transitions.
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:51:48] [INFO ] Input system was already deterministic with 129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 419/419 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 471 transition count 419
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 451 transition count 399
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 451 transition count 399
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 447 transition count 395
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 447 transition count 395
Applied a total of 49 rules in 35 ms. Remains 447 /472 variables (removed 25) and now considering 395/419 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 447/472 places, 395/419 transitions.
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 15 ms
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 14 ms
[2023-03-11 02:51:48] [INFO ] Input system was already deterministic with 395 transitions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 419/419 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 471 transition count 419
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 451 transition count 399
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 451 transition count 399
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 446 transition count 394
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 446 transition count 394
Applied a total of 51 rules in 41 ms. Remains 446 /472 variables (removed 26) and now considering 394/419 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 446/472 places, 394/419 transitions.
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 13 ms
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 14 ms
[2023-03-11 02:51:48] [INFO ] Input system was already deterministic with 394 transitions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 419/419 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 471 transition count 419
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 453 transition count 401
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 453 transition count 401
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 449 transition count 397
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 449 transition count 397
Applied a total of 45 rules in 33 ms. Remains 449 /472 variables (removed 23) and now considering 397/419 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 449/472 places, 397/419 transitions.
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 14 ms
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 12 ms
[2023-03-11 02:51:48] [INFO ] Input system was already deterministic with 397 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 472/472 places, 419/419 transitions.
Graph (trivial) has 221 edges and 472 vertex of which 6 / 472 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1055 edges and 467 vertex of which 466 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 465 transition count 356
Reduce places removed 55 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 410 transition count 355
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 409 transition count 355
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 114 place count 409 transition count 263
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 199 rules applied. Total rules applied 313 place count 302 transition count 263
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 330 place count 285 transition count 246
Iterating global reduction 3 with 17 rules applied. Total rules applied 347 place count 285 transition count 246
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 347 place count 285 transition count 244
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 351 place count 283 transition count 244
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 573 place count 170 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 574 place count 169 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 575 place count 168 transition count 134
Applied a total of 575 rules in 37 ms. Remains 168 /472 variables (removed 304) and now considering 134/419 (removed 285) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 168/472 places, 134/419 transitions.
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:51:48] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 419/419 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 471 transition count 419
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 453 transition count 401
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 453 transition count 401
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 448 transition count 396
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 448 transition count 396
Applied a total of 47 rules in 31 ms. Remains 448 /472 variables (removed 24) and now considering 396/419 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 448/472 places, 396/419 transitions.
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 13 ms
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 14 ms
[2023-03-11 02:51:48] [INFO ] Input system was already deterministic with 396 transitions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 419/419 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 456 transition count 403
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 456 transition count 403
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 451 transition count 398
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 451 transition count 398
Applied a total of 42 rules in 33 ms. Remains 451 /472 variables (removed 21) and now considering 398/419 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 451/472 places, 398/419 transitions.
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 13 ms
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 13 ms
[2023-03-11 02:51:48] [INFO ] Input system was already deterministic with 398 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 472/472 places, 419/419 transitions.
Graph (trivial) has 217 edges and 472 vertex of which 6 / 472 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1055 edges and 467 vertex of which 465 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 464 transition count 358
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 411 transition count 358
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 108 place count 411 transition count 268
Deduced a syphon composed of 90 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 300 place count 309 transition count 268
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 316 place count 293 transition count 252
Iterating global reduction 2 with 16 rules applied. Total rules applied 332 place count 293 transition count 252
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 332 place count 293 transition count 250
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 336 place count 291 transition count 250
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 562 place count 176 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 563 place count 175 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 564 place count 174 transition count 138
Applied a total of 564 rules in 36 ms. Remains 174 /472 variables (removed 298) and now considering 138/419 (removed 281) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 174/472 places, 138/419 transitions.
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:51:48] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 472/472 places, 419/419 transitions.
Graph (trivial) has 226 edges and 472 vertex of which 6 / 472 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1055 edges and 467 vertex of which 465 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 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 464 transition count 355
Reduce places removed 56 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 408 transition count 354
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 407 transition count 354
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 116 place count 407 transition count 260
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 320 place count 297 transition count 260
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 339 place count 278 transition count 241
Iterating global reduction 3 with 19 rules applied. Total rules applied 358 place count 278 transition count 241
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 358 place count 278 transition count 238
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 364 place count 275 transition count 238
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 582 place count 164 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 583 place count 163 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 584 place count 162 transition count 130
Applied a total of 584 rules in 41 ms. Remains 162 /472 variables (removed 310) and now considering 130/419 (removed 289) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 162/472 places, 130/419 transitions.
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:51:48] [INFO ] Input system was already deterministic with 130 transitions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 419/419 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 471 transition count 419
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 452 transition count 400
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 452 transition count 400
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 447 transition count 395
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 447 transition count 395
Applied a total of 49 rules in 29 ms. Remains 447 /472 variables (removed 25) and now considering 395/419 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 447/472 places, 395/419 transitions.
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 11 ms
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 12 ms
[2023-03-11 02:51:48] [INFO ] Input system was already deterministic with 395 transitions.
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 12 ms
[2023-03-11 02:51:48] [INFO ] Flatten gal took : 13 ms
[2023-03-11 02:51:48] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-11 02:51:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 472 places, 419 transitions and 1344 arcs took 2 ms.
Total runtime 11535 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-13
BK_EXAMINATION: CTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377

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

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

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

BK_STOP 1678503109730

--------------------
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/377/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/377/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/377/CTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:138
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:138
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:331
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:296
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: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:553
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:138
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:253
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:331
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:394
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: 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: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: LAUNCH task # 7 (type EXCL) for 6 BusinessProcesses-PT-13-CTLCardinality-02
lola: time limit : 240 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for BusinessProcesses-PT-13-CTLCardinality-02
lola: result : true
lola: markings : 13
lola: fired transitions : 13
lola: time used : 0.000000
lola: memory pages used : 1
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: LAUNCH task # 19 (type EXCL) for 18 BusinessProcesses-PT-13-CTLCardinality-06
lola: time limit : 300 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 40 (type FNDP) for 15 BusinessProcesses-PT-13-CTLCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 19 (type EXCL) for BusinessProcesses-PT-13-CTLCardinality-06
lola: result : false
lola: markings : 290
lola: fired transitions : 690
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 39 (type EXCL) for 15 BusinessProcesses-PT-13-CTLCardinality-05
lola: time limit : 327 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: FINISHED task # 39 (type EXCL) for BusinessProcesses-PT-13-CTLCardinality-05
lola: result : true
lola: markings : 3
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
/home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin//../BenchKit_head.sh: line 63: 563 Segmentation fault lola --conf=$BIN_DIR/configfiles/ctlcardinalityconf --formula=$DIR/CTLCardinality.xml --verdictfile=$DIR/GenericPropertiesVerdict.xml $DIR/model.pnml

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-13"
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-13, 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-167813692700545"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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