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

About the Execution of Marcie+red for ASLink-PT-01a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9692.840 601545.00 635092.00 42.40 TFFFFFFFTTFTFTTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r010-oct2-167813598500010.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ASLink-PT-01a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598500010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 201K 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 ASLink-PT-01a-CTLFireability-00
FORMULA_NAME ASLink-PT-01a-CTLFireability-01
FORMULA_NAME ASLink-PT-01a-CTLFireability-02
FORMULA_NAME ASLink-PT-01a-CTLFireability-03
FORMULA_NAME ASLink-PT-01a-CTLFireability-04
FORMULA_NAME ASLink-PT-01a-CTLFireability-05
FORMULA_NAME ASLink-PT-01a-CTLFireability-06
FORMULA_NAME ASLink-PT-01a-CTLFireability-07
FORMULA_NAME ASLink-PT-01a-CTLFireability-08
FORMULA_NAME ASLink-PT-01a-CTLFireability-09
FORMULA_NAME ASLink-PT-01a-CTLFireability-10
FORMULA_NAME ASLink-PT-01a-CTLFireability-11
FORMULA_NAME ASLink-PT-01a-CTLFireability-12
FORMULA_NAME ASLink-PT-01a-CTLFireability-13
FORMULA_NAME ASLink-PT-01a-CTLFireability-14
FORMULA_NAME ASLink-PT-01a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678655296588

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=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 21:08:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 21:08:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:08:19] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2023-03-12 21:08:19] [INFO ] Transformed 431 places.
[2023-03-12 21:08:19] [INFO ] Transformed 735 transitions.
[2023-03-12 21:08:19] [INFO ] Found NUPN structural information;
[2023-03-12 21:08:19] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Support contains 139 out of 431 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 3 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 426 transition count 728
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 9 place count 422 transition count 724
Ensure Unique test removed 1 places
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 421 transition count 724
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 421 transition count 722
Applied a total of 16 rules in 54 ms. Remains 421 /431 variables (removed 10) and now considering 722/728 (removed 6) transitions.
// Phase 1: matrix 722 rows 421 cols
[2023-03-12 21:08:19] [INFO ] Computed 74 place invariants in 27 ms
[2023-03-12 21:08:19] [INFO ] Implicit Places using invariants in 804 ms returned [19, 23, 52, 70, 199, 204, 216, 221, 222, 260, 263, 281, 282, 284, 285, 302, 310, 318, 330, 342, 350, 370]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 837 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 399/431 places, 722/728 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 391 transition count 714
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 391 transition count 714
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 387 transition count 710
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 387 transition count 710
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 386 transition count 709
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 386 transition count 709
Applied a total of 26 rules in 80 ms. Remains 386 /399 variables (removed 13) and now considering 709/722 (removed 13) transitions.
// Phase 1: matrix 709 rows 386 cols
[2023-03-12 21:08:20] [INFO ] Computed 52 place invariants in 41 ms
[2023-03-12 21:08:20] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-12 21:08:20] [INFO ] Invariant cache hit.
[2023-03-12 21:08:20] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 386/431 places, 709/728 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1834 ms. Remains : 386/431 places, 709/728 transitions.
Support contains 139 out of 386 places after structural reductions.
[2023-03-12 21:08:21] [INFO ] Flatten gal took : 108 ms
[2023-03-12 21:08:21] [INFO ] Flatten gal took : 53 ms
[2023-03-12 21:08:21] [INFO ] Input system was already deterministic with 709 transitions.
Incomplete random walk after 10000 steps, including 190 resets, run finished after 572 ms. (steps per millisecond=17 ) properties (out of 94) seen :36
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 58) seen :1
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 57) seen :1
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 56) seen :0
Running SMT prover for 56 properties.
[2023-03-12 21:08:23] [INFO ] Invariant cache hit.
[2023-03-12 21:08:23] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2023-03-12 21:08:23] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 26 ms returned sat
[2023-03-12 21:08:24] [INFO ] After 1363ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:51
[2023-03-12 21:08:25] [INFO ] [Nat]Absence check using 12 positive place invariants in 12 ms returned sat
[2023-03-12 21:08:25] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 40 ms returned sat
[2023-03-12 21:08:29] [INFO ] After 3766ms SMT Verify possible using state equation in natural domain returned unsat :46 sat :10
[2023-03-12 21:08:30] [INFO ] Deduced a trap composed of 28 places in 349 ms of which 6 ms to minimize.
[2023-03-12 21:08:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 442 ms
[2023-03-12 21:08:31] [INFO ] After 4955ms SMT Verify possible using trap constraints in natural domain returned unsat :46 sat :10
Attempting to minimize the solution found.
Minimization took 697 ms.
[2023-03-12 21:08:31] [INFO ] After 7244ms SMT Verify possible using all constraints in natural domain returned unsat :46 sat :10
Fused 56 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 154 ms.
Support contains 26 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 709/709 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 385 transition count 662
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 338 transition count 662
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 95 place count 338 transition count 624
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 183 place count 288 transition count 624
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 184 place count 288 transition count 623
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 185 place count 287 transition count 623
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 185 place count 287 transition count 620
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 191 place count 284 transition count 620
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 195 place count 280 transition count 603
Iterating global reduction 4 with 4 rules applied. Total rules applied 199 place count 280 transition count 603
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 205 place count 275 transition count 602
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 206 place count 274 transition count 602
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 211 place count 269 transition count 590
Iterating global reduction 6 with 5 rules applied. Total rules applied 216 place count 269 transition count 590
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 220 place count 265 transition count 579
Iterating global reduction 6 with 4 rules applied. Total rules applied 224 place count 265 transition count 579
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 228 place count 261 transition count 568
Iterating global reduction 6 with 4 rules applied. Total rules applied 232 place count 261 transition count 568
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 235 place count 261 transition count 565
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 236 place count 260 transition count 557
Iterating global reduction 7 with 1 rules applied. Total rules applied 237 place count 260 transition count 557
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 238 place count 259 transition count 549
Iterating global reduction 7 with 1 rules applied. Total rules applied 239 place count 259 transition count 549
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 240 place count 258 transition count 541
Iterating global reduction 7 with 1 rules applied. Total rules applied 241 place count 258 transition count 541
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 279 place count 239 transition count 522
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 281 place count 237 transition count 520
Iterating global reduction 7 with 2 rules applied. Total rules applied 283 place count 237 transition count 520
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 286 place count 237 transition count 517
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 289 place count 234 transition count 517
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 290 place count 234 transition count 516
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 291 place count 233 transition count 516
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 298 place count 233 transition count 516
Applied a total of 298 rules in 192 ms. Remains 233 /386 variables (removed 153) and now considering 516/709 (removed 193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 233/386 places, 516/709 transitions.
Incomplete random walk after 10000 steps, including 244 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10000 steps, including 135 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 123 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 128 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 125 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 516 rows 233 cols
[2023-03-12 21:08:32] [INFO ] Computed 34 place invariants in 9 ms
[2023-03-12 21:08:32] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-12 21:08:32] [INFO ] [Real]Absence check using 10 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-12 21:08:33] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 21:08:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-12 21:08:33] [INFO ] [Nat]Absence check using 10 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-12 21:08:33] [INFO ] After 394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 21:08:33] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 21:08:34] [INFO ] After 282ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 21:08:34] [INFO ] After 701ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 268 ms.
[2023-03-12 21:08:34] [INFO ] After 1576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 55 ms.
Support contains 17 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 516/516 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 515
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 232 transition count 515
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 232 transition count 514
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 230 transition count 514
Applied a total of 5 rules in 44 ms. Remains 230 /233 variables (removed 3) and now considering 514/516 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 230/233 places, 514/516 transitions.
Incomplete random walk after 10000 steps, including 259 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 145 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 514 rows 230 cols
[2023-03-12 21:08:35] [INFO ] Computed 33 place invariants in 5 ms
[2023-03-12 21:08:35] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-12 21:08:35] [INFO ] [Real]Absence check using 10 positive and 23 generalized place invariants in 17 ms returned sat
[2023-03-12 21:08:35] [INFO ] After 631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 21:08:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 21:08:36] [INFO ] [Nat]Absence check using 10 positive and 23 generalized place invariants in 20 ms returned sat
[2023-03-12 21:08:36] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 21:08:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 21:08:36] [INFO ] After 92ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 21:08:36] [INFO ] After 281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-12 21:08:36] [INFO ] After 846ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 31 ms.
Support contains 6 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 514/514 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 230 transition count 512
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 228 transition count 512
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 226 transition count 503
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 226 transition count 503
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 224 transition count 494
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 224 transition count 494
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 222 transition count 485
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 222 transition count 485
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 221 transition count 477
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 221 transition count 477
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 220 transition count 469
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 220 transition count 469
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 219 transition count 461
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 219 transition count 461
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 218 transition count 453
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 218 transition count 453
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 217 transition count 445
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 217 transition count 445
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 216 transition count 437
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 216 transition count 437
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 215 transition count 429
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 215 transition count 429
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 214 transition count 428
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 214 transition count 427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 213 transition count 427
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 212 transition count 426
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 36 place count 211 transition count 426
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 36 place count 211 transition count 424
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 41 place count 208 transition count 424
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 42 place count 207 transition count 423
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 207 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 44 place count 207 transition count 422
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 46 place count 206 transition count 421
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 47 place count 206 transition count 420
Applied a total of 47 rules in 149 ms. Remains 206 /230 variables (removed 24) and now considering 420/514 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 206/230 places, 420/514 transitions.
Incomplete random walk after 10000 steps, including 258 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 137 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :0
Finished probabilistic random walk after 101147 steps, run visited all 3 properties in 484 ms. (steps per millisecond=208 )
Probabilistic random walk after 101147 steps, saw 43873 distinct states, run finished after 484 ms. (steps per millisecond=208 ) properties seen :3
Successfully simplified 46 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-01a-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 21:08:37] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-12 21:08:37] [INFO ] Flatten gal took : 33 ms
[2023-03-12 21:08:37] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA ASLink-PT-01a-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 21:08:38] [INFO ] Flatten gal took : 33 ms
[2023-03-12 21:08:38] [INFO ] Input system was already deterministic with 709 transitions.
Support contains 29 out of 386 places (down from 65) after GAL structural reductions.
FORMULA ASLink-PT-01a-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 709/709 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 385 transition count 709
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 381 transition count 692
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 381 transition count 692
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 378 transition count 682
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 378 transition count 682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 376 transition count 673
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 376 transition count 673
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 374 transition count 664
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 374 transition count 664
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 372 transition count 655
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 372 transition count 655
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 371 transition count 647
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 371 transition count 647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 370 transition count 639
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 370 transition count 639
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 369 transition count 631
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 369 transition count 631
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 368 transition count 623
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 368 transition count 623
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 367 transition count 615
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 367 transition count 615
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 366 transition count 607
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 366 transition count 607
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 365 transition count 599
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 365 transition count 599
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 364 transition count 591
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 364 transition count 591
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 363 transition count 583
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 363 transition count 583
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 362 transition count 575
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 362 transition count 575
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 361 transition count 567
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 361 transition count 567
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 360 transition count 559
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 360 transition count 559
Applied a total of 51 rules in 68 ms. Remains 360 /386 variables (removed 26) and now considering 559/709 (removed 150) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 360/386 places, 559/709 transitions.
[2023-03-12 21:08:38] [INFO ] Flatten gal took : 22 ms
[2023-03-12 21:08:38] [INFO ] Flatten gal took : 24 ms
[2023-03-12 21:08:38] [INFO ] Input system was already deterministic with 559 transitions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 709/709 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 385 transition count 709
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 381 transition count 692
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 381 transition count 692
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 378 transition count 682
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 378 transition count 682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 376 transition count 673
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 376 transition count 673
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 374 transition count 664
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 374 transition count 664
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 372 transition count 655
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 372 transition count 655
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 371 transition count 647
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 371 transition count 647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 370 transition count 639
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 370 transition count 639
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 369 transition count 631
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 369 transition count 631
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 368 transition count 623
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 368 transition count 623
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 367 transition count 615
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 367 transition count 615
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 366 transition count 607
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 366 transition count 607
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 365 transition count 599
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 365 transition count 599
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 364 transition count 591
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 364 transition count 591
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 363 transition count 583
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 363 transition count 583
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 362 transition count 575
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 362 transition count 575
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 361 transition count 567
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 361 transition count 567
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 360 transition count 559
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 360 transition count 559
Applied a total of 51 rules in 74 ms. Remains 360 /386 variables (removed 26) and now considering 559/709 (removed 150) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 360/386 places, 559/709 transitions.
[2023-03-12 21:08:38] [INFO ] Flatten gal took : 44 ms
[2023-03-12 21:08:38] [INFO ] Flatten gal took : 27 ms
[2023-03-12 21:08:38] [INFO ] Input system was already deterministic with 559 transitions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 709/709 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 385 transition count 709
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 381 transition count 692
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 381 transition count 692
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 378 transition count 682
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 378 transition count 682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 376 transition count 673
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 376 transition count 673
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 374 transition count 664
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 374 transition count 664
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 372 transition count 655
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 372 transition count 655
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 371 transition count 647
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 371 transition count 647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 370 transition count 639
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 370 transition count 639
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 369 transition count 631
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 369 transition count 631
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 368 transition count 623
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 368 transition count 623
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 367 transition count 615
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 367 transition count 615
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 366 transition count 607
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 366 transition count 607
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 365 transition count 599
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 365 transition count 599
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 364 transition count 591
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 364 transition count 591
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 363 transition count 583
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 363 transition count 583
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 362 transition count 575
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 362 transition count 575
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 361 transition count 567
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 361 transition count 567
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 360 transition count 559
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 360 transition count 559
Applied a total of 51 rules in 76 ms. Remains 360 /386 variables (removed 26) and now considering 559/709 (removed 150) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 360/386 places, 559/709 transitions.
[2023-03-12 21:08:38] [INFO ] Flatten gal took : 18 ms
[2023-03-12 21:08:38] [INFO ] Flatten gal took : 19 ms
[2023-03-12 21:08:38] [INFO ] Input system was already deterministic with 559 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 386/386 places, 709/709 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 384 transition count 658
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 333 transition count 658
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 101 place count 333 transition count 616
Deduced a syphon composed of 42 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 97 rules applied. Total rules applied 198 place count 278 transition count 616
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 202 place count 277 transition count 613
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 205 place count 274 transition count 613
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 205 place count 274 transition count 609
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 213 place count 270 transition count 609
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 219 place count 264 transition count 590
Iterating global reduction 4 with 6 rules applied. Total rules applied 225 place count 264 transition count 590
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 8 rules applied. Total rules applied 233 place count 259 transition count 587
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 235 place count 257 transition count 587
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 241 place count 251 transition count 574
Iterating global reduction 6 with 6 rules applied. Total rules applied 247 place count 251 transition count 574
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 248 place count 251 transition count 573
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 249 place count 250 transition count 573
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 254 place count 245 transition count 561
Iterating global reduction 8 with 5 rules applied. Total rules applied 259 place count 245 transition count 561
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 264 place count 240 transition count 549
Iterating global reduction 8 with 5 rules applied. Total rules applied 269 place count 240 transition count 549
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 272 place count 240 transition count 546
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 274 place count 238 transition count 537
Iterating global reduction 9 with 2 rules applied. Total rules applied 276 place count 238 transition count 537
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 294 place count 229 transition count 528
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 295 place count 228 transition count 527
Iterating global reduction 9 with 1 rules applied. Total rules applied 296 place count 228 transition count 527
Applied a total of 296 rules in 55 ms. Remains 228 /386 variables (removed 158) and now considering 527/709 (removed 182) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 228/386 places, 527/709 transitions.
[2023-03-12 21:08:38] [INFO ] Flatten gal took : 16 ms
[2023-03-12 21:08:38] [INFO ] Flatten gal took : 18 ms
[2023-03-12 21:08:38] [INFO ] Input system was already deterministic with 527 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 386/386 places, 709/709 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 385 transition count 660
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 336 transition count 660
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 98 place count 336 transition count 621
Deduced a syphon composed of 39 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 91 rules applied. Total rules applied 189 place count 284 transition count 621
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 190 place count 284 transition count 620
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 191 place count 283 transition count 620
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 191 place count 283 transition count 616
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 199 place count 279 transition count 616
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 204 place count 274 transition count 598
Iterating global reduction 4 with 5 rules applied. Total rules applied 209 place count 274 transition count 598
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 7 rules applied. Total rules applied 216 place count 269 transition count 596
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 218 place count 267 transition count 596
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 224 place count 261 transition count 583
Iterating global reduction 6 with 6 rules applied. Total rules applied 230 place count 261 transition count 583
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 231 place count 261 transition count 582
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 232 place count 260 transition count 582
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 237 place count 255 transition count 570
Iterating global reduction 8 with 5 rules applied. Total rules applied 242 place count 255 transition count 570
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 247 place count 250 transition count 558
Iterating global reduction 8 with 5 rules applied. Total rules applied 252 place count 250 transition count 558
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 255 place count 250 transition count 555
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 257 place count 248 transition count 546
Iterating global reduction 9 with 2 rules applied. Total rules applied 259 place count 248 transition count 546
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 260 place count 247 transition count 538
Iterating global reduction 9 with 1 rules applied. Total rules applied 261 place count 247 transition count 538
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 262 place count 246 transition count 530
Iterating global reduction 9 with 1 rules applied. Total rules applied 263 place count 246 transition count 530
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 264 place count 245 transition count 522
Iterating global reduction 9 with 1 rules applied. Total rules applied 265 place count 245 transition count 522
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 266 place count 244 transition count 514
Iterating global reduction 9 with 1 rules applied. Total rules applied 267 place count 244 transition count 514
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 287 place count 234 transition count 504
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 288 place count 233 transition count 503
Iterating global reduction 9 with 1 rules applied. Total rules applied 289 place count 233 transition count 503
Applied a total of 289 rules in 61 ms. Remains 233 /386 variables (removed 153) and now considering 503/709 (removed 206) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 233/386 places, 503/709 transitions.
[2023-03-12 21:08:38] [INFO ] Flatten gal took : 15 ms
[2023-03-12 21:08:38] [INFO ] Flatten gal took : 17 ms
[2023-03-12 21:08:38] [INFO ] Input system was already deterministic with 503 transitions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 709/709 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 382 transition count 692
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 382 transition count 692
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 379 transition count 682
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 379 transition count 682
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 377 transition count 673
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 377 transition count 673
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 375 transition count 664
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 375 transition count 664
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 373 transition count 655
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 373 transition count 655
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 372 transition count 647
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 372 transition count 647
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 371 transition count 639
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 371 transition count 639
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 370 transition count 631
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 370 transition count 631
Applied a total of 32 rules in 32 ms. Remains 370 /386 variables (removed 16) and now considering 631/709 (removed 78) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 370/386 places, 631/709 transitions.
[2023-03-12 21:08:38] [INFO ] Flatten gal took : 32 ms
[2023-03-12 21:08:38] [INFO ] Flatten gal took : 20 ms
[2023-03-12 21:08:39] [INFO ] Input system was already deterministic with 631 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 386/386 places, 709/709 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 384 transition count 659
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 334 transition count 659
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 99 place count 334 transition count 618
Deduced a syphon composed of 41 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 193 place count 281 transition count 618
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 197 place count 280 transition count 615
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 200 place count 277 transition count 615
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 200 place count 277 transition count 612
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 206 place count 274 transition count 612
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 212 place count 268 transition count 593
Iterating global reduction 4 with 6 rules applied. Total rules applied 218 place count 268 transition count 593
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 8 rules applied. Total rules applied 226 place count 263 transition count 590
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 228 place count 261 transition count 590
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 234 place count 255 transition count 577
Iterating global reduction 6 with 6 rules applied. Total rules applied 240 place count 255 transition count 577
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 241 place count 255 transition count 576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 242 place count 254 transition count 576
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 247 place count 249 transition count 564
Iterating global reduction 8 with 5 rules applied. Total rules applied 252 place count 249 transition count 564
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 257 place count 244 transition count 552
Iterating global reduction 8 with 5 rules applied. Total rules applied 262 place count 244 transition count 552
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 265 place count 244 transition count 549
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 267 place count 242 transition count 540
Iterating global reduction 9 with 2 rules applied. Total rules applied 269 place count 242 transition count 540
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 270 place count 241 transition count 532
Iterating global reduction 9 with 1 rules applied. Total rules applied 271 place count 241 transition count 532
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 272 place count 240 transition count 524
Iterating global reduction 9 with 1 rules applied. Total rules applied 273 place count 240 transition count 524
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 274 place count 239 transition count 516
Iterating global reduction 9 with 1 rules applied. Total rules applied 275 place count 239 transition count 516
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 276 place count 238 transition count 508
Iterating global reduction 9 with 1 rules applied. Total rules applied 277 place count 238 transition count 508
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 278 place count 237 transition count 500
Iterating global reduction 9 with 1 rules applied. Total rules applied 279 place count 237 transition count 500
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 280 place count 236 transition count 492
Iterating global reduction 9 with 1 rules applied. Total rules applied 281 place count 236 transition count 492
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 282 place count 235 transition count 484
Iterating global reduction 9 with 1 rules applied. Total rules applied 283 place count 235 transition count 484
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 284 place count 234 transition count 476
Iterating global reduction 9 with 1 rules applied. Total rules applied 285 place count 234 transition count 476
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 286 place count 233 transition count 468
Iterating global reduction 9 with 1 rules applied. Total rules applied 287 place count 233 transition count 468
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 288 place count 232 transition count 460
Iterating global reduction 9 with 1 rules applied. Total rules applied 289 place count 232 transition count 460
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 290 place count 231 transition count 452
Iterating global reduction 9 with 1 rules applied. Total rules applied 291 place count 231 transition count 452
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 292 place count 230 transition count 444
Iterating global reduction 9 with 1 rules applied. Total rules applied 293 place count 230 transition count 444
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 313 place count 220 transition count 434
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 314 place count 219 transition count 433
Iterating global reduction 9 with 1 rules applied. Total rules applied 315 place count 219 transition count 433
Applied a total of 315 rules in 82 ms. Remains 219 /386 variables (removed 167) and now considering 433/709 (removed 276) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 82 ms. Remains : 219/386 places, 433/709 transitions.
[2023-03-12 21:08:39] [INFO ] Flatten gal took : 13 ms
[2023-03-12 21:08:39] [INFO ] Flatten gal took : 13 ms
[2023-03-12 21:08:39] [INFO ] Input system was already deterministic with 433 transitions.
[2023-03-12 21:08:39] [INFO ] Flatten gal took : 24 ms
[2023-03-12 21:08:39] [INFO ] Flatten gal took : 35 ms
[2023-03-12 21:08:39] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-12 21:08:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 386 places, 709 transitions and 2609 arcs took 3 ms.
Total runtime 20418 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 386 NrTr: 709 NrArc: 2609)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.018sec

net check time: 0m 0.000sec

init dd package: 0m 2.895sec


RS generation: 0m32.443sec


-> reachability set: #nodes 26507 (2.7e+04) #states 180,562,445 (8)



starting MCC model checker
--------------------------

checking: EG [EX [0<=0]]
normalized: EG [EX [0<=0]]

abstracting: (0<=0)
states: 180,562,445 (8)
..................................................................................................................................................
before gc: list nodes free: 1399935

after gc: idd nodes used:116177, unused:63883823; list nodes free:272139203
.........................................
EG iterations: 186
-> the formula is TRUE

FORMULA ASLink-PT-01a-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m24.322sec

checking: AG [EX [EX [AG [[[p56<=0 & 0<=p56] | [p199<=0 & 0<=p199]]]]]]
normalized: ~ [E [true U ~ [EX [EX [~ [E [true U ~ [[[p199<=0 & 0<=p199] | [p56<=0 & 0<=p56]]]]]]]]]]

abstracting: (0<=p56)
states: 180,562,445 (8)
abstracting: (p56<=0)
states: 173,797,557 (8)
abstracting: (0<=p199)
states: 180,562,445 (8)
abstracting: (p199<=0)
states: 118,321,741 (8)
..-> the formula is FALSE

FORMULA ASLink-PT-01a-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m48.014sec

checking: AG [AX [AX [AX [EF [[[p310<=1 & 1<=p310] & [p313<=1 & 1<=p313]]]]]]]
normalized: ~ [E [true U EX [EX [EX [~ [E [true U [[p313<=1 & 1<=p313] & [p310<=1 & 1<=p310]]]]]]]]]

abstracting: (1<=p310)
states: 978,059 (5)
abstracting: (p310<=1)
states: 180,562,445 (8)
abstracting: (1<=p313)
states: 422,019 (5)
abstracting: (p313<=1)
states: 180,562,445 (8)
...-> the formula is FALSE

FORMULA ASLink-PT-01a-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m37.519sec

checking: [EG [~ [[p160<=1 & 1<=p160]]] | AG [[[p201<=1 & 1<=p201] & [p266<=1 & 1<=p266]]]]
normalized: [~ [E [true U ~ [[[p266<=1 & 1<=p266] & [p201<=1 & 1<=p201]]]]] | EG [~ [[p160<=1 & 1<=p160]]]]

abstracting: (1<=p160)
states: 15,816,042 (7)
abstracting: (p160<=1)
states: 180,562,445 (8)
...............................
before gc: list nodes free: 520151

after gc: idd nodes used:219943, unused:63780057; list nodes free:271699253
............................................................................................................................................................................
before gc: list nodes free: 1142598

after gc: idd nodes used:185386, unused:63814614; list nodes free:271848996
.........................................................................
EG iterations: 276
abstracting: (1<=p201)
states: 3,118,445 (6)
abstracting: (p201<=1)
states: 180,562,445 (8)
abstracting: (1<=p266)
states: 1,329,363 (6)
abstracting: (p266<=1)
states: 180,562,445 (8)
-> the formula is TRUE

FORMULA ASLink-PT-01a-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m44.478sec

checking: EG [[AF [[[p207<=1 & 1<=p207] & [p260<=1 & 1<=p260]]] & [[p38<=0 & 0<=p38] | [p237<=0 & 0<=p237]]]]
normalized: EG [[[[p237<=0 & 0<=p237] | [p38<=0 & 0<=p38]] & ~ [EG [~ [[[p260<=1 & 1<=p260] & [p207<=1 & 1<=p207]]]]]]]

abstracting: (1<=p207)
states: 605,030 (5)
abstracting: (p207<=1)
states: 180,562,445 (8)
abstracting: (1<=p260)
states: 1,341,297 (6)
abstracting: (p260<=1)
states: 180,562,445 (8)
......................
EG iterations: 22
abstracting: (0<=p38)
states: 180,562,445 (8)
abstracting: (p38<=0)
states: 175,645,060 (8)
abstracting: (0<=p237)
states: 180,562,445 (8)
abstracting: (p237<=0)
states: 180,299,490 (8)
.......................
EG iterations: 23
-> the formula is FALSE

FORMULA ASLink-PT-01a-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.899sec

checking: EG [[[AX [1<=0] | EF [[p164<=0 & 0<=p164]]] | [[p370<=1 & 1<=p370] | [EF [[[p270<=1 & 1<=p270] & [p342<=1 & 1<=p342]]] & [AF [[[p41<=1 & 1<=p41] & [p223<=1 & 1<=p223]]] & EF [[p136<=1 & 1<=p136]]]]]]]
normalized: EG [[[[[E [true U [p136<=1 & 1<=p136]] & ~ [EG [~ [[[p223<=1 & 1<=p223] & [p41<=1 & 1<=p41]]]]]] & E [true U [[p342<=1 & 1<=p342] & [p270<=1 & 1<=p270]]]] | [p370<=1 & 1<=p370]] | [E [true U [p164<=0 & 0<=p164]] | ~ [EX [~ [1<=0]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (0<=p164)
states: 180,562,445 (8)
abstracting: (p164<=0)
states: 179,599,239 (8)
abstracting: (1<=p370)
states: 4,489,813 (6)
abstracting: (p370<=1)
states: 180,562,445 (8)
abstracting: (1<=p270)
states: 13,469,439 (7)
abstracting: (p270<=1)
states: 180,562,445 (8)
abstracting: (1<=p342)
states: 13,469,439 (7)
abstracting: (p342<=1)
states: 180,562,445 (8)
abstracting: (1<=p41)
states: 4,917,385 (6)
abstracting: (p41<=1)
states: 180,562,445 (8)
abstracting: (1<=p223)
states: 4,654,430 (6)
abstracting: (p223<=1)
states: 180,562,445 (8)
.......................................................................
EG iterations: 71
abstracting: (1<=p136)
states: 29,127,618 (7)
abstracting: (p136<=1)
states: 180,562,445 (8)

EG iterations: 0
-> the formula is TRUE

FORMULA ASLink-PT-01a-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m45.322sec

checking: EF [[EG [A [[[[p214<=1 & 1<=p214] & [p275<=1 & 1<=p275]] | [[[p44<=1 & 1<=p44] & [p241<=1 & 1<=p241]] | [[p39<=1 & 1<=p39] & [p225<=1 & 1<=p225]]]] U EF [[[p205<=1 & 1<=p205] & [p267<=1 & 1<=p267]]]]] | [[[p47<=1 & 1<=p47] & [p225<=1 & 1<=p225]] | [[p249<=1 & 1<=p249] & [p306<=1 & 1<=p306]]]]]
normalized: E [true U [[[[p306<=1 & 1<=p306] & [p249<=1 & 1<=p249]] | [[p225<=1 & 1<=p225] & [p47<=1 & 1<=p47]]] | EG [[~ [EG [~ [E [true U [[p267<=1 & 1<=p267] & [p205<=1 & 1<=p205]]]]]] & ~ [E [~ [E [true U [[p267<=1 & 1<=p267] & [p205<=1 & 1<=p205]]]] U [~ [[[[[p225<=1 & 1<=p225] & [p39<=1 & 1<=p39]] | [[p241<=1 & 1<=p241] & [p44<=1 & 1<=p44]]] | [[p275<=1 & 1<=p275] & [p214<=1 & 1<=p214]]]] & ~ [E [true U [[p267<=1 & 1<=p267] & [p205<=1 & 1<=p205]]]]]]]]]]]

abstracting: (1<=p205)
states: 37,010,728 (7)
abstracting: (p205<=1)
states: 180,562,445 (8)
abstracting: (1<=p267)
states: 4,229,747 (6)
abstracting: (p267<=1)
states: 180,562,445 (8)

before gc: list nodes free: 1433243

after gc: idd nodes used:92629, unused:63907371; list nodes free:272234763
abstracting: (1<=p214)
states: 91,246,444 (7)
abstracting: (p214<=1)
states: 180,562,445 (8)
abstracting: (1<=p275)
states: 37,354 (4)
abstracting: (p275<=1)
states: 180,562,445 (8)
abstracting: (1<=p44)
states: 4,917,385 (6)
abstracting: (p44<=1)
states: 180,562,445 (8)
abstracting: (1<=p241)
states: 262,955 (5)
abstracting: (p241<=1)
states: 180,562,445 (8)
abstracting: (1<=p39)
states: 4,917,385 (6)
abstracting: (p39<=1)
states: 180,562,445 (8)
abstracting: (1<=p225)
states: 4,654,430 (6)
abstracting: (p225<=1)
states: 180,562,445 (8)
abstracting: (1<=p205)
states: 37,010,728 (7)
abstracting: (p205<=1)
states: 180,562,445 (8)
abstracting: (1<=p267)
states: 4,229,747 (6)
abstracting: (p267<=1)
states: 180,562,445 (8)
abstracting: (1<=p205)
states: 37,010,728 (7)
abstracting: (p205<=1)
states: 180,562,445 (8)
abstracting: (1<=p267)
states: 4,229,747 (6)
abstracting: (p267<=1)
states: 180,562,445 (8)
.
EG iterations: 1
.......................
EG iterations: 23
abstracting: (1<=p47)
states: 4,917,385 (6)
abstracting: (p47<=1)
states: 180,562,445 (8)
abstracting: (1<=p225)
states: 4,654,430 (6)
abstracting: (p225<=1)
states: 180,562,445 (8)
abstracting: (1<=p249)
states: 119,921,602 (8)
abstracting: (p249<=1)
states: 180,562,445 (8)
abstracting: (1<=p306)
states: 422,019 (5)
abstracting: (p306<=1)
states: 180,562,445 (8)
-> the formula is TRUE

FORMULA ASLink-PT-01a-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m36.605sec

totally nodes used: 269233764 (2.7e+08)
number of garbage collections: 4
fire ops cache: hits/miss/sum: 348892068 2000530574 2349422642
used/not used/entry size/cache size: 57105260 10003604 16 1024MB
basic ops cache: hits/miss/sum: 17285570 75956953 93242523
used/not used/entry size/cache size: 8143326 8633890 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 20390 176913 197303
used/not used/entry size/cache size: 41298 8347310 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 57095867
1 7141750
2 2109672
3 595293
4 136085
5 25344
6 4222
7 529
8 87
9 15
>= 10 0

Total processing time: 9m38.622sec


BK_STOP 1678655898133

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.002sec

2510 23229 23460 23450 15802
iterations count:559481 (789), effective:20358 (28)

initing FirstDep: 0m 0.006sec

20150
iterations count:167637 (236), effective:6110 (8)

iterations count:78256 (110), effective:1766 (2)
13536 14827 15167 14947 14258
iterations count:596672 (841), effective:14484 (20)
54603
iterations count:132113 (186), effective:3393 (4)

iterations count:724 (1), effective:1 (0)

iterations count:712 (1), effective:1 (0)
16625 17574 17989 17738 16109
iterations count:559720 (789), effective:13543 (19)
19158 27015
iterations count:243053 (342), effective:10208 (14)
16131
iterations count:161818 (228), effective:5092 (7)
16131
iterations count:161818 (228), effective:5092 (7)

iterations count:742 (1), effective:1 (0)
16131
iterations count:161818 (228), effective:5092 (7)

iterations count:718 (1), effective:1 (0)

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="ASLink-PT-01a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ASLink-PT-01a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-oct2-167813598500010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-01a.tgz
mv ASLink-PT-01a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;