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.r425-tajo-167905978000329.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVt-PT-050B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978000329
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.8K Feb 25 22:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 22:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 22:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 614K Mar 5 18:23 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 ShieldRVt-PT-050B-CTLCardinality-00
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-01
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-02
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-03
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-04
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-05
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-06
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-07
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-08
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-09
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-10
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-11
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-12
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-13
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-14
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679310265199

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 11:04:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 11:04:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:04:26] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2023-03-20 11:04:26] [INFO ] Transformed 2503 places.
[2023-03-20 11:04:26] [INFO ] Transformed 2503 transitions.
[2023-03-20 11:04:26] [INFO ] Found NUPN structural information;
[2023-03-20 11:04:26] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Support contains 94 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Discarding 521 places :
Symmetric choice reduction at 0 with 521 rule applications. Total rules 521 place count 1982 transition count 1982
Iterating global reduction 0 with 521 rules applied. Total rules applied 1042 place count 1982 transition count 1982
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1043 place count 1981 transition count 1981
Iterating global reduction 0 with 1 rules applied. Total rules applied 1044 place count 1981 transition count 1981
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1045 place count 1980 transition count 1980
Iterating global reduction 0 with 1 rules applied. Total rules applied 1046 place count 1980 transition count 1980
Applied a total of 1046 rules in 997 ms. Remains 1980 /2503 variables (removed 523) and now considering 1980/2503 (removed 523) transitions.
// Phase 1: matrix 1980 rows 1980 cols
[2023-03-20 11:04:28] [INFO ] Computed 201 place invariants in 53 ms
[2023-03-20 11:04:28] [INFO ] Implicit Places using invariants in 768 ms returned []
[2023-03-20 11:04:28] [INFO ] Invariant cache hit.
[2023-03-20 11:04:30] [INFO ] Implicit Places using invariants and state equation in 1669 ms returned []
Implicit Place search using SMT with State Equation took 2469 ms to find 0 implicit places.
[2023-03-20 11:04:30] [INFO ] Invariant cache hit.
[2023-03-20 11:04:31] [INFO ] Dead Transitions using invariants and state equation in 1004 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1980/2503 places, 1980/2503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4472 ms. Remains : 1980/2503 places, 1980/2503 transitions.
Support contains 94 out of 1980 places after structural reductions.
[2023-03-20 11:04:31] [INFO ] Flatten gal took : 156 ms
[2023-03-20 11:04:31] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA ShieldRVt-PT-050B-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 11:04:31] [INFO ] Flatten gal took : 88 ms
[2023-03-20 11:04:32] [INFO ] Input system was already deterministic with 1980 transitions.
Support contains 72 out of 1980 places (down from 94) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 726 ms. (steps per millisecond=13 ) properties (out of 41) seen :18
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-03-20 11:04:33] [INFO ] Invariant cache hit.
[2023-03-20 11:04:33] [INFO ] After 780ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-20 11:04:34] [INFO ] [Nat]Absence check using 201 positive place invariants in 75 ms returned sat
[2023-03-20 11:04:39] [INFO ] After 3622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-20 11:04:39] [INFO ] Deduced a trap composed of 25 places in 370 ms of which 10 ms to minimize.
[2023-03-20 11:04:39] [INFO ] Deduced a trap composed of 22 places in 360 ms of which 2 ms to minimize.
[2023-03-20 11:04:40] [INFO ] Deduced a trap composed of 21 places in 303 ms of which 1 ms to minimize.
[2023-03-20 11:04:40] [INFO ] Deduced a trap composed of 35 places in 325 ms of which 2 ms to minimize.
[2023-03-20 11:04:41] [INFO ] Deduced a trap composed of 25 places in 320 ms of which 2 ms to minimize.
[2023-03-20 11:04:41] [INFO ] Deduced a trap composed of 58 places in 292 ms of which 1 ms to minimize.
[2023-03-20 11:04:41] [INFO ] Deduced a trap composed of 31 places in 311 ms of which 2 ms to minimize.
[2023-03-20 11:04:42] [INFO ] Deduced a trap composed of 26 places in 290 ms of which 1 ms to minimize.
[2023-03-20 11:04:42] [INFO ] Deduced a trap composed of 50 places in 292 ms of which 1 ms to minimize.
[2023-03-20 11:04:42] [INFO ] Deduced a trap composed of 51 places in 287 ms of which 1 ms to minimize.
[2023-03-20 11:04:43] [INFO ] Deduced a trap composed of 48 places in 357 ms of which 1 ms to minimize.
[2023-03-20 11:04:43] [INFO ] Deduced a trap composed of 53 places in 291 ms of which 1 ms to minimize.
[2023-03-20 11:04:44] [INFO ] Deduced a trap composed of 50 places in 289 ms of which 1 ms to minimize.
[2023-03-20 11:04:44] [INFO ] Deduced a trap composed of 54 places in 289 ms of which 1 ms to minimize.
[2023-03-20 11:04:44] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5442 ms
[2023-03-20 11:04:45] [INFO ] Deduced a trap composed of 20 places in 480 ms of which 1 ms to minimize.
[2023-03-20 11:04:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 687 ms
[2023-03-20 11:04:46] [INFO ] Deduced a trap composed of 37 places in 654 ms of which 2 ms to minimize.
[2023-03-20 11:04:46] [INFO ] Deduced a trap composed of 36 places in 616 ms of which 1 ms to minimize.
[2023-03-20 11:04:47] [INFO ] Deduced a trap composed of 42 places in 542 ms of which 1 ms to minimize.
[2023-03-20 11:04:48] [INFO ] Deduced a trap composed of 38 places in 514 ms of which 3 ms to minimize.
[2023-03-20 11:04:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2732 ms
[2023-03-20 11:04:48] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 1 ms to minimize.
[2023-03-20 11:04:49] [INFO ] Deduced a trap composed of 29 places in 255 ms of which 1 ms to minimize.
[2023-03-20 11:04:49] [INFO ] Deduced a trap composed of 29 places in 244 ms of which 1 ms to minimize.
[2023-03-20 11:04:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1079 ms
[2023-03-20 11:04:49] [INFO ] Deduced a trap composed of 64 places in 311 ms of which 1 ms to minimize.
[2023-03-20 11:04:50] [INFO ] Deduced a trap composed of 63 places in 280 ms of which 1 ms to minimize.
[2023-03-20 11:04:50] [INFO ] Deduced a trap composed of 84 places in 304 ms of which 1 ms to minimize.
[2023-03-20 11:04:51] [INFO ] Deduced a trap composed of 61 places in 315 ms of which 1 ms to minimize.
[2023-03-20 11:04:51] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 2 ms to minimize.
[2023-03-20 11:04:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1974 ms
[2023-03-20 11:04:52] [INFO ] Deduced a trap composed of 55 places in 482 ms of which 1 ms to minimize.
[2023-03-20 11:04:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 696 ms
[2023-03-20 11:04:52] [INFO ] Deduced a trap composed of 39 places in 307 ms of which 1 ms to minimize.
[2023-03-20 11:04:53] [INFO ] Deduced a trap composed of 38 places in 310 ms of which 1 ms to minimize.
[2023-03-20 11:04:53] [INFO ] Deduced a trap composed of 69 places in 293 ms of which 1 ms to minimize.
[2023-03-20 11:04:54] [INFO ] Deduced a trap composed of 72 places in 271 ms of which 0 ms to minimize.
[2023-03-20 11:04:54] [INFO ] Deduced a trap composed of 74 places in 277 ms of which 1 ms to minimize.
[2023-03-20 11:04:54] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 4 ms to minimize.
[2023-03-20 11:04:55] [INFO ] Deduced a trap composed of 74 places in 298 ms of which 1 ms to minimize.
[2023-03-20 11:04:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2619 ms
[2023-03-20 11:04:55] [INFO ] Deduced a trap composed of 40 places in 601 ms of which 2 ms to minimize.
[2023-03-20 11:04:56] [INFO ] Deduced a trap composed of 37 places in 582 ms of which 2 ms to minimize.
[2023-03-20 11:04:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1468 ms
[2023-03-20 11:04:57] [INFO ] Deduced a trap composed of 72 places in 424 ms of which 1 ms to minimize.
[2023-03-20 11:04:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 564 ms
[2023-03-20 11:04:58] [INFO ] Deduced a trap composed of 62 places in 368 ms of which 1 ms to minimize.
[2023-03-20 11:04:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 528 ms
[2023-03-20 11:04:58] [INFO ] After 23541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-20 11:04:58] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 0 properties in 1582 ms.
Support contains 44 out of 1980 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Drop transitions removed 515 transitions
Trivial Post-agglo rules discarded 515 transitions
Performed 515 trivial Post agglomeration. Transition count delta: 515
Iterating post reduction 0 with 515 rules applied. Total rules applied 515 place count 1980 transition count 1465
Reduce places removed 515 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 525 rules applied. Total rules applied 1040 place count 1465 transition count 1455
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1050 place count 1455 transition count 1455
Performed 379 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 379 Pre rules applied. Total rules applied 1050 place count 1455 transition count 1076
Deduced a syphon composed of 379 places in 2 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 3 with 758 rules applied. Total rules applied 1808 place count 1076 transition count 1076
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1821 place count 1063 transition count 1063
Iterating global reduction 3 with 13 rules applied. Total rules applied 1834 place count 1063 transition count 1063
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 1834 place count 1063 transition count 1052
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 1856 place count 1052 transition count 1052
Performed 447 Post agglomeration using F-continuation condition.Transition count delta: 447
Deduced a syphon composed of 447 places in 1 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 3 with 894 rules applied. Total rules applied 2750 place count 605 transition count 605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2751 place count 605 transition count 604
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2753 place count 604 transition count 603
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2955 place count 503 transition count 688
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 3019 place count 471 transition count 715
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3020 place count 471 transition count 714
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3024 place count 471 transition count 710
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 3028 place count 467 transition count 710
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3029 place count 467 transition count 709
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3030 place count 466 transition count 708
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3031 place count 465 transition count 708
Applied a total of 3031 rules in 450 ms. Remains 465 /1980 variables (removed 1515) and now considering 708/1980 (removed 1272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 450 ms. Remains : 465/1980 places, 708/1980 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 23) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :1
Running SMT prover for 18 properties.
// Phase 1: matrix 708 rows 465 cols
[2023-03-20 11:05:01] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-20 11:05:01] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-20 11:05:01] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-20 11:05:02] [INFO ] After 569ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-20 11:05:02] [INFO ] State equation strengthened by 237 read => feed constraints.
[2023-03-20 11:05:03] [INFO ] After 924ms SMT Verify possible using 237 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-03-20 11:05:04] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2023-03-20 11:05:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-20 11:05:04] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2023-03-20 11:05:04] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2023-03-20 11:05:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 201 ms
[2023-03-20 11:05:04] [INFO ] After 2092ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 767 ms.
[2023-03-20 11:05:05] [INFO ] After 3742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 7 properties in 453 ms.
Support contains 14 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 708/708 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 465 transition count 700
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 457 transition count 700
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 16 place count 457 transition count 691
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 34 place count 448 transition count 691
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 68 place count 431 transition count 674
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 84 place count 423 transition count 686
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 423 transition count 685
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 420 transition count 682
Applied a total of 88 rules in 130 ms. Remains 420 /465 variables (removed 45) and now considering 682/708 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 420/465 places, 682/708 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 116392 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{1=1, 4=1}
Probabilistic random walk after 116392 steps, saw 74165 distinct states, run finished after 3004 ms. (steps per millisecond=38 ) properties seen :2
Running SMT prover for 9 properties.
// Phase 1: matrix 682 rows 420 cols
[2023-03-20 11:05:09] [INFO ] Computed 200 place invariants in 7 ms
[2023-03-20 11:05:10] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 11:05:10] [INFO ] [Nat]Absence check using 200 positive place invariants in 24 ms returned sat
[2023-03-20 11:05:10] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 11:05:10] [INFO ] After 608ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 162 ms.
[2023-03-20 11:05:11] [INFO ] After 934ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 574 ms.
Support contains 10 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 682/682 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 420 transition count 681
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 419 transition count 681
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 419 transition count 679
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 417 transition count 679
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 416 transition count 678
Applied a total of 8 rules in 32 ms. Remains 416 /420 variables (removed 4) and now considering 678/682 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 416/420 places, 678/682 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 121055 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121055 steps, saw 77669 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 678 rows 416 cols
[2023-03-20 11:05:15] [INFO ] Computed 200 place invariants in 5 ms
[2023-03-20 11:05:15] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 11:05:15] [INFO ] [Nat]Absence check using 200 positive place invariants in 27 ms returned sat
[2023-03-20 11:05:15] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 11:05:16] [INFO ] After 582ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 137 ms.
[2023-03-20 11:05:16] [INFO ] After 922ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 5 properties in 579 ms.
Support contains 4 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 678/678 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 416 transition count 675
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 413 transition count 675
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 407 transition count 681
Applied a total of 18 rules in 53 ms. Remains 407 /416 variables (removed 9) and now considering 681/678 (removed -3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 407/416 places, 681/678 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 162996 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 162996 steps, saw 104814 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 681 rows 407 cols
[2023-03-20 11:05:20] [INFO ] Computed 200 place invariants in 6 ms
[2023-03-20 11:05:20] [INFO ] [Real]Absence check using 200 positive place invariants in 23 ms returned sat
[2023-03-20 11:05:20] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 11:05:21] [INFO ] [Nat]Absence check using 200 positive place invariants in 28 ms returned sat
[2023-03-20 11:05:21] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 11:05:21] [INFO ] After 366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-20 11:05:21] [INFO ] After 590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 139 ms.
Support contains 4 out of 407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 407/407 places, 681/681 transitions.
Applied a total of 0 rules in 18 ms. Remains 407 /407 variables (removed 0) and now considering 681/681 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 407/407 places, 681/681 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 407/407 places, 681/681 transitions.
Applied a total of 0 rules in 16 ms. Remains 407 /407 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2023-03-20 11:05:21] [INFO ] Invariant cache hit.
[2023-03-20 11:05:22] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-20 11:05:22] [INFO ] Invariant cache hit.
[2023-03-20 11:05:22] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2023-03-20 11:05:22] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-20 11:05:22] [INFO ] Invariant cache hit.
[2023-03-20 11:05:22] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1120 ms. Remains : 407/407 places, 681/681 transitions.
Graph (trivial) has 189 edges and 407 vertex of which 4 / 407 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1390 edges and 405 vertex of which 403 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 186 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 399 transition count 672
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 185 edges and 397 vertex of which 6 / 397 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 394 transition count 663
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 183 edges and 391 vertex of which 8 / 391 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 387 transition count 652
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 179 edges and 383 vertex of which 8 / 383 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 379 transition count 638
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 175 edges and 375 vertex of which 8 / 375 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 371 transition count 624
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 171 edges and 367 vertex of which 8 / 367 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 363 transition count 610
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 359 vertex of which 8 / 359 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 355 transition count 596
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 351 vertex of which 8 / 351 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 347 transition count 582
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 343 vertex of which 8 / 343 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 339 transition count 568
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 335 vertex of which 8 / 335 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 331 transition count 554
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 327 vertex of which 8 / 327 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 323 transition count 540
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 147 edges and 319 vertex of which 8 / 319 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 315 transition count 526
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 143 edges and 311 vertex of which 6 / 311 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 308 transition count 512
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 139 edges and 305 vertex of which 4 / 305 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 13 with 14 rules applied. Total rules applied 239 place count 303 transition count 502
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 136 edges and 301 vertex of which 2 / 301 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 14 with 9 rules applied. Total rules applied 248 place count 300 transition count 496
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 253 place count 299 transition count 492
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 253 place count 299 transition count 491
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 256 place count 297 transition count 491
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 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 259 place count 295 transition count 490
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 133 edges and 295 vertex of which 2 / 295 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 16 with 4 rules applied. Total rules applied 263 place count 294 transition count 487
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 135 edges and 293 vertex of which 6 / 293 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 4 rules applied. Total rules applied 267 place count 290 transition count 485
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Remove reverse transitions (loop back) rule discarded transition t341.t339.t355.t570.t353 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 131 edges and 285 vertex of which 6 / 285 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 18 with 14 rules applied. Total rules applied 281 place count 282 transition count 471
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 129 edges and 279 vertex of which 8 / 279 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 15 rules applied. Total rules applied 296 place count 275 transition count 460
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 125 edges and 271 vertex of which 8 / 271 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 315 place count 267 transition count 446
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 121 edges and 263 vertex of which 8 / 263 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 334 place count 259 transition count 432
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 117 edges and 255 vertex of which 8 / 255 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 353 place count 251 transition count 418
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 113 edges and 247 vertex of which 6 / 247 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 23 with 17 rules applied. Total rules applied 370 place count 244 transition count 406
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 110 edges and 241 vertex of which 6 / 241 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 24 with 16 rules applied. Total rules applied 386 place count 238 transition count 394
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 108 edges and 235 vertex of which 6 / 235 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 25 with 15 rules applied. Total rules applied 401 place count 232 transition count 383
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 106 edges and 229 vertex of which 8 / 229 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 15 rules applied. Total rules applied 416 place count 225 transition count 372
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 733 edges and 221 vertex of which 215 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (trivial) has 99 edges and 215 vertex of which 8 / 215 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 21 rules applied. Total rules applied 437 place count 211 transition count 352
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 95 edges and 207 vertex of which 8 / 207 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 456 place count 203 transition count 338
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 91 edges and 199 vertex of which 8 / 199 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 475 place count 195 transition count 324
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 87 edges and 191 vertex of which 8 / 191 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 494 place count 187 transition count 310
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 183 vertex of which 8 / 183 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 513 place count 179 transition count 296
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 79 edges and 175 vertex of which 8 / 175 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 532 place count 171 transition count 282
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 75 edges and 167 vertex of which 8 / 167 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 551 place count 163 transition count 268
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 71 edges and 159 vertex of which 8 / 159 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 570 place count 155 transition count 254
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 67 edges and 151 vertex of which 8 / 151 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 589 place count 147 transition count 240
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 63 edges and 143 vertex of which 8 / 143 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 608 place count 139 transition count 226
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 59 edges and 135 vertex of which 8 / 135 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 627 place count 131 transition count 212
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 55 edges and 127 vertex of which 8 / 127 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 646 place count 123 transition count 198
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 51 edges and 119 vertex of which 8 / 119 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 665 place count 115 transition count 184
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 47 edges and 111 vertex of which 8 / 111 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 684 place count 107 transition count 170
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 43 edges and 103 vertex of which 8 / 103 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 703 place count 99 transition count 156
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 39 edges and 95 vertex of which 6 / 95 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 42 with 17 rules applied. Total rules applied 720 place count 92 transition count 144
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 36 edges and 89 vertex of which 6 / 89 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 43 with 17 rules applied. Total rules applied 737 place count 86 transition count 131
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 33 edges and 82 vertex of which 6 / 82 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 44 with 17 rules applied. Total rules applied 754 place count 79 transition count 119
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 31 edges and 76 vertex of which 8 / 76 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 45 with 15 rules applied. Total rules applied 769 place count 72 transition count 108
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 27 edges and 68 vertex of which 8 / 68 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 46 with 20 rules applied. Total rules applied 789 place count 64 transition count 93
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 23 edges and 60 vertex of which 8 / 60 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 47 with 19 rules applied. Total rules applied 808 place count 56 transition count 79
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 19 edges and 52 vertex of which 6 / 52 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 48 with 19 rules applied. Total rules applied 827 place count 49 transition count 65
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 15 edges and 46 vertex of which 4 / 46 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 49 with 14 rules applied. Total rules applied 841 place count 44 transition count 55
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 12 edges and 42 vertex of which 2 / 42 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 50 with 9 rules applied. Total rules applied 850 place count 41 transition count 49
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 51 with 5 rules applied. Total rules applied 855 place count 40 transition count 45
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 52 with 3 Pre rules applied. Total rules applied 855 place count 40 transition count 42
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 52 with 9 rules applied. Total rules applied 864 place count 34 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 52 with 1 rules applied. Total rules applied 865 place count 34 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 53 with 1 Pre rules applied. Total rules applied 865 place count 34 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 53 with 2 rules applied. Total rules applied 867 place count 33 transition count 40
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 2 places and 0 transitions.
Iterating global reduction 53 with 3 rules applied. Total rules applied 870 place count 31 transition count 39
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 53 with 3 rules applied. Total rules applied 873 place count 31 transition count 36
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 54 with 2 rules applied. Total rules applied 875 place count 31 transition count 34
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 54 with 1 rules applied. Total rules applied 876 place count 31 transition count 34
Applied a total of 876 rules in 142 ms. Remains 31 /407 variables (removed 376) and now considering 34/681 (removed 647) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 34 rows 31 cols
[2023-03-20 11:05:22] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-20 11:05:23] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-20 11:05:23] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 11:05:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-03-20 11:05:23] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 11:05:23] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-20 11:05:23] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-20 11:05:23] [INFO ] Flatten gal took : 56 ms
[2023-03-20 11:05:23] [INFO ] Flatten gal took : 56 ms
[2023-03-20 11:05:23] [INFO ] Input system was already deterministic with 1980 transitions.
Computed a total of 604 stabilizing places and 604 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1952 transition count 1952
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1952 transition count 1952
Applied a total of 56 rules in 165 ms. Remains 1952 /1980 variables (removed 28) and now considering 1952/1980 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 1952/1980 places, 1952/1980 transitions.
[2023-03-20 11:05:23] [INFO ] Flatten gal took : 45 ms
[2023-03-20 11:05:23] [INFO ] Flatten gal took : 41 ms
[2023-03-20 11:05:23] [INFO ] Input system was already deterministic with 1952 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1953 transition count 1953
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1953 transition count 1953
Applied a total of 54 rules in 187 ms. Remains 1953 /1980 variables (removed 27) and now considering 1953/1980 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 188 ms. Remains : 1953/1980 places, 1953/1980 transitions.
[2023-03-20 11:05:23] [INFO ] Flatten gal took : 40 ms
[2023-03-20 11:05:24] [INFO ] Flatten gal took : 41 ms
[2023-03-20 11:05:24] [INFO ] Input system was already deterministic with 1953 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 545 transitions
Trivial Post-agglo rules discarded 545 transitions
Performed 545 trivial Post agglomeration. Transition count delta: 545
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 1979 transition count 1434
Reduce places removed 545 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 546 rules applied. Total rules applied 1091 place count 1434 transition count 1433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1092 place count 1433 transition count 1433
Performed 386 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 386 Pre rules applied. Total rules applied 1092 place count 1433 transition count 1047
Deduced a syphon composed of 386 places in 1 ms
Reduce places removed 386 places and 0 transitions.
Iterating global reduction 3 with 772 rules applied. Total rules applied 1864 place count 1047 transition count 1047
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1888 place count 1023 transition count 1023
Iterating global reduction 3 with 24 rules applied. Total rules applied 1912 place count 1023 transition count 1023
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 1912 place count 1023 transition count 1003
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 1952 place count 1003 transition count 1003
Performed 397 Post agglomeration using F-continuation condition.Transition count delta: 397
Deduced a syphon composed of 397 places in 0 ms
Reduce places removed 397 places and 0 transitions.
Iterating global reduction 3 with 794 rules applied. Total rules applied 2746 place count 606 transition count 606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2747 place count 606 transition count 605
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 2749 place count 605 transition count 604
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2751 place count 603 transition count 602
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2752 place count 602 transition count 602
Applied a total of 2752 rules in 215 ms. Remains 602 /1980 variables (removed 1378) and now considering 602/1980 (removed 1378) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 215 ms. Remains : 602/1980 places, 602/1980 transitions.
[2023-03-20 11:05:24] [INFO ] Flatten gal took : 15 ms
[2023-03-20 11:05:24] [INFO ] Flatten gal took : 15 ms
[2023-03-20 11:05:24] [INFO ] Input system was already deterministic with 602 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1957 transition count 1957
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1957 transition count 1957
Applied a total of 46 rules in 151 ms. Remains 1957 /1980 variables (removed 23) and now considering 1957/1980 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 1957/1980 places, 1957/1980 transitions.
[2023-03-20 11:05:24] [INFO ] Flatten gal took : 36 ms
[2023-03-20 11:05:24] [INFO ] Flatten gal took : 36 ms
[2023-03-20 11:05:24] [INFO ] Input system was already deterministic with 1957 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 545 transitions
Trivial Post-agglo rules discarded 545 transitions
Performed 545 trivial Post agglomeration. Transition count delta: 545
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 1979 transition count 1434
Reduce places removed 545 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 546 rules applied. Total rules applied 1091 place count 1434 transition count 1433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1092 place count 1433 transition count 1433
Performed 387 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 387 Pre rules applied. Total rules applied 1092 place count 1433 transition count 1046
Deduced a syphon composed of 387 places in 2 ms
Reduce places removed 387 places and 0 transitions.
Iterating global reduction 3 with 774 rules applied. Total rules applied 1866 place count 1046 transition count 1046
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1890 place count 1022 transition count 1022
Iterating global reduction 3 with 24 rules applied. Total rules applied 1914 place count 1022 transition count 1022
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 1914 place count 1022 transition count 1002
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 1954 place count 1002 transition count 1002
Performed 393 Post agglomeration using F-continuation condition.Transition count delta: 393
Deduced a syphon composed of 393 places in 1 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 3 with 786 rules applied. Total rules applied 2740 place count 609 transition count 609
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2741 place count 609 transition count 608
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 2743 place count 608 transition count 607
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2745 place count 606 transition count 605
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2746 place count 605 transition count 605
Applied a total of 2746 rules in 174 ms. Remains 605 /1980 variables (removed 1375) and now considering 605/1980 (removed 1375) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 175 ms. Remains : 605/1980 places, 605/1980 transitions.
[2023-03-20 11:05:24] [INFO ] Flatten gal took : 14 ms
[2023-03-20 11:05:24] [INFO ] Flatten gal took : 15 ms
[2023-03-20 11:05:24] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 542 transitions
Trivial Post-agglo rules discarded 542 transitions
Performed 542 trivial Post agglomeration. Transition count delta: 542
Iterating post reduction 0 with 542 rules applied. Total rules applied 542 place count 1979 transition count 1437
Reduce places removed 542 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 544 rules applied. Total rules applied 1086 place count 1437 transition count 1435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1088 place count 1435 transition count 1435
Performed 387 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 387 Pre rules applied. Total rules applied 1088 place count 1435 transition count 1048
Deduced a syphon composed of 387 places in 1 ms
Reduce places removed 387 places and 0 transitions.
Iterating global reduction 3 with 774 rules applied. Total rules applied 1862 place count 1048 transition count 1048
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1886 place count 1024 transition count 1024
Iterating global reduction 3 with 24 rules applied. Total rules applied 1910 place count 1024 transition count 1024
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 1910 place count 1024 transition count 1004
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 1950 place count 1004 transition count 1004
Performed 393 Post agglomeration using F-continuation condition.Transition count delta: 393
Deduced a syphon composed of 393 places in 0 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 3 with 786 rules applied. Total rules applied 2736 place count 611 transition count 611
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2737 place count 611 transition count 610
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 2739 place count 610 transition count 609
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2741 place count 608 transition count 607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2742 place count 607 transition count 607
Applied a total of 2742 rules in 175 ms. Remains 607 /1980 variables (removed 1373) and now considering 607/1980 (removed 1373) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 175 ms. Remains : 607/1980 places, 607/1980 transitions.
[2023-03-20 11:05:25] [INFO ] Flatten gal took : 14 ms
[2023-03-20 11:05:25] [INFO ] Flatten gal took : 15 ms
[2023-03-20 11:05:25] [INFO ] Input system was already deterministic with 607 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1954 transition count 1954
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1954 transition count 1954
Applied a total of 52 rules in 153 ms. Remains 1954 /1980 variables (removed 26) and now considering 1954/1980 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 1954/1980 places, 1954/1980 transitions.
[2023-03-20 11:05:25] [INFO ] Flatten gal took : 34 ms
[2023-03-20 11:05:25] [INFO ] Flatten gal took : 35 ms
[2023-03-20 11:05:25] [INFO ] Input system was already deterministic with 1954 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1979 transition count 1432
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1432 transition count 1432
Performed 387 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 387 Pre rules applied. Total rules applied 1094 place count 1432 transition count 1045
Deduced a syphon composed of 387 places in 2 ms
Reduce places removed 387 places and 0 transitions.
Iterating global reduction 2 with 774 rules applied. Total rules applied 1868 place count 1045 transition count 1045
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 1891 place count 1022 transition count 1022
Iterating global reduction 2 with 23 rules applied. Total rules applied 1914 place count 1022 transition count 1022
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 1914 place count 1022 transition count 1003
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 1952 place count 1003 transition count 1003
Performed 397 Post agglomeration using F-continuation condition.Transition count delta: 397
Deduced a syphon composed of 397 places in 0 ms
Reduce places removed 397 places and 0 transitions.
Iterating global reduction 2 with 794 rules applied. Total rules applied 2746 place count 606 transition count 606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2747 place count 606 transition count 605
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 2749 place count 605 transition count 604
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2751 place count 603 transition count 602
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2752 place count 602 transition count 602
Applied a total of 2752 rules in 162 ms. Remains 602 /1980 variables (removed 1378) and now considering 602/1980 (removed 1378) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 163 ms. Remains : 602/1980 places, 602/1980 transitions.
[2023-03-20 11:05:25] [INFO ] Flatten gal took : 13 ms
[2023-03-20 11:05:25] [INFO ] Flatten gal took : 13 ms
[2023-03-20 11:05:25] [INFO ] Input system was already deterministic with 602 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1954 transition count 1954
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1954 transition count 1954
Applied a total of 52 rules in 197 ms. Remains 1954 /1980 variables (removed 26) and now considering 1954/1980 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 1954/1980 places, 1954/1980 transitions.
[2023-03-20 11:05:26] [INFO ] Flatten gal took : 33 ms
[2023-03-20 11:05:26] [INFO ] Flatten gal took : 34 ms
[2023-03-20 11:05:26] [INFO ] Input system was already deterministic with 1954 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1951 transition count 1951
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1951 transition count 1951
Applied a total of 58 rules in 166 ms. Remains 1951 /1980 variables (removed 29) and now considering 1951/1980 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 1951/1980 places, 1951/1980 transitions.
[2023-03-20 11:05:26] [INFO ] Flatten gal took : 31 ms
[2023-03-20 11:05:26] [INFO ] Flatten gal took : 32 ms
[2023-03-20 11:05:26] [INFO ] Input system was already deterministic with 1951 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1979 transition count 1432
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1432 transition count 1432
Performed 386 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 386 Pre rules applied. Total rules applied 1094 place count 1432 transition count 1046
Deduced a syphon composed of 386 places in 2 ms
Reduce places removed 386 places and 0 transitions.
Iterating global reduction 2 with 772 rules applied. Total rules applied 1866 place count 1046 transition count 1046
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 1889 place count 1023 transition count 1023
Iterating global reduction 2 with 23 rules applied. Total rules applied 1912 place count 1023 transition count 1023
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 1912 place count 1023 transition count 1004
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 1950 place count 1004 transition count 1004
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: 398
Deduced a syphon composed of 398 places in 0 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 2746 place count 606 transition count 606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2747 place count 606 transition count 605
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2749 place count 605 transition count 604
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2751 place count 603 transition count 602
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2752 place count 602 transition count 602
Applied a total of 2752 rules in 168 ms. Remains 602 /1980 variables (removed 1378) and now considering 602/1980 (removed 1378) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 169 ms. Remains : 602/1980 places, 602/1980 transitions.
[2023-03-20 11:05:26] [INFO ] Flatten gal took : 13 ms
[2023-03-20 11:05:26] [INFO ] Flatten gal took : 13 ms
[2023-03-20 11:05:26] [INFO ] Input system was already deterministic with 602 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1953 transition count 1953
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1953 transition count 1953
Applied a total of 54 rules in 165 ms. Remains 1953 /1980 variables (removed 27) and now considering 1953/1980 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 1953/1980 places, 1953/1980 transitions.
[2023-03-20 11:05:26] [INFO ] Flatten gal took : 31 ms
[2023-03-20 11:05:26] [INFO ] Flatten gal took : 32 ms
[2023-03-20 11:05:26] [INFO ] Input system was already deterministic with 1953 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1952 transition count 1952
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1952 transition count 1952
Applied a total of 56 rules in 151 ms. Remains 1952 /1980 variables (removed 28) and now considering 1952/1980 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 1952/1980 places, 1952/1980 transitions.
[2023-03-20 11:05:27] [INFO ] Flatten gal took : 31 ms
[2023-03-20 11:05:27] [INFO ] Flatten gal took : 32 ms
[2023-03-20 11:05:27] [INFO ] Input system was already deterministic with 1952 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1954 transition count 1954
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1954 transition count 1954
Applied a total of 52 rules in 150 ms. Remains 1954 /1980 variables (removed 26) and now considering 1954/1980 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 1954/1980 places, 1954/1980 transitions.
[2023-03-20 11:05:27] [INFO ] Flatten gal took : 31 ms
[2023-03-20 11:05:27] [INFO ] Flatten gal took : 31 ms
[2023-03-20 11:05:27] [INFO ] Input system was already deterministic with 1954 transitions.
[2023-03-20 11:05:27] [INFO ] Flatten gal took : 31 ms
[2023-03-20 11:05:27] [INFO ] Flatten gal took : 54 ms
[2023-03-20 11:05:27] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-20 11:05:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1980 places, 1980 transitions and 4860 arcs took 9 ms.
Total runtime 61059 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/673/ctl_0_ --ctl=/tmp/673/ctl_1_ --ctl=/tmp/673/ctl_2_ --ctl=/tmp/673/ctl_3_ --ctl=/tmp/673/ctl_4_ --ctl=/tmp/673/ctl_5_ --ctl=/tmp/673/ctl_6_ --ctl=/tmp/673/ctl_7_ --ctl=/tmp/673/ctl_8_ --ctl=/tmp/673/ctl_9_ --ctl=/tmp/673/ctl_10_ --ctl=/tmp/673/ctl_11_ --ctl=/tmp/673/ctl_12_ --ctl=/tmp/673/ctl_13_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 218516 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16093548 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2023

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="ShieldRVt-PT-050B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVt-PT-050B, 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 r425-tajo-167905978000329"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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