Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r131-smll-171624288500159.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DLCround-PT-11b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-171624288500159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 12:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 13 12:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 13 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 13 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M May 18 16:42 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 DLCround-PT-11b-ReachabilityCardinality-2024-00
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-01
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-02
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-03
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-04
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-05
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-06
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-07
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-08
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-09
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-10
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-11
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-12
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-13
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-14
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716398231641

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=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-11b
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-22 17:17:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 17:17:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 17:17:15] [INFO ] Load time of PNML (sax parser for PT used): 556 ms
[2024-05-22 17:17:15] [INFO ] Transformed 4375 places.
[2024-05-22 17:17:15] [INFO ] Transformed 6991 transitions.
[2024-05-22 17:17:15] [INFO ] Found NUPN structural information;
[2024-05-22 17:17:15] [INFO ] Parsed PT model containing 4375 places and 6991 transitions and 19673 arcs in 971 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 916 ms. (steps per millisecond=10 ) properties (out of 13) seen :7
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 6991 rows 4375 cols
[2024-05-22 17:17:17] [INFO ] Computed 244 invariants in 99 ms
[2024-05-22 17:17:20] [INFO ] [Real]Absence check using 244 positive place invariants in 541 ms returned sat
[2024-05-22 17:17:20] [INFO ] After 3113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 17:17:23] [INFO ] [Nat]Absence check using 244 positive place invariants in 472 ms returned sat
[2024-05-22 17:17:33] [INFO ] After 9012ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-22 17:17:35] [INFO ] Deduced a trap composed of 126 places in 2212 ms of which 11 ms to minimize.
[2024-05-22 17:17:38] [INFO ] Deduced a trap composed of 192 places in 2213 ms of which 4 ms to minimize.
[2024-05-22 17:17:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 5575 ms
[2024-05-22 17:17:44] [INFO ] Deduced a trap composed of 298 places in 1987 ms of which 2 ms to minimize.
[2024-05-22 17:17:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2801 ms
[2024-05-22 17:17:45] [INFO ] After 21610ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-22 17:17:45] [INFO ] After 25055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 729 ms.
Support contains 117 out of 4375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4375/4375 places, 6991/6991 transitions.
Graph (trivial) has 3807 edges and 4375 vertex of which 552 / 4375 are part of one of the 49 SCC in 28 ms
Free SCC test removed 503 places
Drop transitions removed 567 transitions
Reduce isomorphic transitions removed 567 transitions.
Drop transitions removed 1546 transitions
Trivial Post-agglo rules discarded 1546 transitions
Performed 1546 trivial Post agglomeration. Transition count delta: 1546
Iterating post reduction 0 with 1546 rules applied. Total rules applied 1547 place count 3872 transition count 4878
Reduce places removed 1546 places and 0 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 1625 rules applied. Total rules applied 3172 place count 2326 transition count 4799
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 41 rules applied. Total rules applied 3213 place count 2292 transition count 4792
Reduce places removed 3 places and 0 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Iterating post reduction 3 with 51 rules applied. Total rules applied 3264 place count 2289 transition count 4744
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 50 rules applied. Total rules applied 3314 place count 2241 transition count 4742
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3315 place count 2240 transition count 4742
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 31 Pre rules applied. Total rules applied 3315 place count 2240 transition count 4711
Deduced a syphon composed of 31 places in 144 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 3377 place count 2209 transition count 4711
Discarding 533 places :
Symmetric choice reduction at 6 with 533 rule applications. Total rules 3910 place count 1676 transition count 4178
Iterating global reduction 6 with 533 rules applied. Total rules applied 4443 place count 1676 transition count 4178
Performed 214 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 214 Pre rules applied. Total rules applied 4443 place count 1676 transition count 3964
Deduced a syphon composed of 214 places in 55 ms
Reduce places removed 214 places and 0 transitions.
Iterating global reduction 6 with 428 rules applied. Total rules applied 4871 place count 1462 transition count 3964
Discarding 55 places :
Symmetric choice reduction at 6 with 55 rule applications. Total rules 4926 place count 1407 transition count 3157
Iterating global reduction 6 with 55 rules applied. Total rules applied 4981 place count 1407 transition count 3157
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 4996 place count 1407 transition count 3142
Performed 359 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 359 places in 4 ms
Reduce places removed 359 places and 0 transitions.
Iterating global reduction 7 with 718 rules applied. Total rules applied 5714 place count 1048 transition count 2775
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 5718 place count 1048 transition count 2771
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 5727 place count 1039 transition count 2636
Iterating global reduction 8 with 9 rules applied. Total rules applied 5736 place count 1039 transition count 2636
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 5737 place count 1039 transition count 2635
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -809
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 9 with 158 rules applied. Total rules applied 5895 place count 960 transition count 3444
Drop transitions removed 110 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 9 with 111 rules applied. Total rules applied 6006 place count 960 transition count 3333
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 6015 place count 951 transition count 3038
Iterating global reduction 10 with 9 rules applied. Total rules applied 6024 place count 951 transition count 3038
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 6029 place count 951 transition count 3033
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 6031 place count 950 transition count 3045
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 6033 place count 950 transition count 3043
Drop transitions removed 195 transitions
Redundant transition composition rules discarded 195 transitions
Iterating global reduction 12 with 195 rules applied. Total rules applied 6228 place count 950 transition count 2848
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 6236 place count 942 transition count 2708
Iterating global reduction 12 with 8 rules applied. Total rules applied 6244 place count 942 transition count 2708
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 6252 place count 942 transition count 2700
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 6254 place count 941 transition count 2712
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 6255 place count 941 transition count 2711
Free-agglomeration rule applied 408 times with reduction of 149 identical transitions.
Iterating global reduction 13 with 408 rules applied. Total rules applied 6663 place count 941 transition count 2154
Reduce places removed 408 places and 0 transitions.
Drop transitions removed 518 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 535 transitions.
Iterating post reduction 13 with 943 rules applied. Total rules applied 7606 place count 533 transition count 1619
Discarding 20 places :
Symmetric choice reduction at 14 with 20 rule applications. Total rules 7626 place count 513 transition count 1543
Iterating global reduction 14 with 20 rules applied. Total rules applied 7646 place count 513 transition count 1543
Drop transitions removed 168 transitions
Redundant transition composition rules discarded 168 transitions
Iterating global reduction 14 with 168 rules applied. Total rules applied 7814 place count 513 transition count 1375
Discarding 35 places :
Symmetric choice reduction at 14 with 35 rule applications. Total rules 7849 place count 478 transition count 1291
Iterating global reduction 14 with 35 rules applied. Total rules applied 7884 place count 478 transition count 1291
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 14 with 2 rules applied. Total rules applied 7886 place count 477 transition count 1292
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 7887 place count 477 transition count 1291
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 14 with 13 rules applied. Total rules applied 7900 place count 476 transition count 1279
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 7903 place count 476 transition count 1326
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 15 with 32 rules applied. Total rules applied 7935 place count 473 transition count 1297
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 16 with 17 rules applied. Total rules applied 7952 place count 473 transition count 1280
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 16 with 12 rules applied. Total rules applied 7964 place count 473 transition count 1280
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 16 with 4 rules applied. Total rules applied 7968 place count 473 transition count 1276
Applied a total of 7968 rules in 2252 ms. Remains 473 /4375 variables (removed 3902) and now considering 1276/6991 (removed 5715) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2253 ms. Remains : 473/4375 places, 1276/6991 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :1
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
[2024-05-22 17:17:49] [INFO ] Flow matrix only has 753 transitions (discarded 523 similar events)
// Phase 1: matrix 753 rows 473 cols
[2024-05-22 17:17:49] [INFO ] Computed 190 invariants in 12 ms
[2024-05-22 17:17:49] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 17:17:49] [INFO ] [Nat]Absence check using 190 positive place invariants in 66 ms returned sat
[2024-05-22 17:17:50] [INFO ] After 607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 17:17:50] [INFO ] State equation strengthened by 150 read => feed constraints.
[2024-05-22 17:17:50] [INFO ] After 352ms SMT Verify possible using 150 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 17:17:51] [INFO ] After 687ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 246 ms.
[2024-05-22 17:17:51] [INFO ] After 1791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 53 ms.
Support contains 92 out of 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 1276/1276 transitions.
Graph (trivial) has 79 edges and 473 vertex of which 17 / 473 are part of one of the 5 SCC in 1 ms
Free SCC test removed 12 places
Drop transitions removed 18 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 461 transition count 1245
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 457 transition count 1245
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 457 transition count 1244
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 456 transition count 1244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 455 transition count 1231
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 455 transition count 1231
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 41 place count 441 transition count 1217
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 60 place count 441 transition count 1198
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 64 place count 437 transition count 1175
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 437 transition count 1175
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 70 place count 436 transition count 1175
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 3 with 29 rules applied. Total rules applied 99 place count 436 transition count 1146
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 101 place count 435 transition count 1145
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 434 transition count 1129
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 434 transition count 1129
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 434 transition count 1128
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 434 transition count 1124
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 34 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 35 transitions.
Graph (complete) has 1383 edges and 430 vertex of which 427 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 40 rules applied. Total rules applied 148 place count 427 transition count 1089
Drop transitions removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 158 place count 427 transition count 1079
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 159 place count 426 transition count 1077
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 426 transition count 1077
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 161 place count 426 transition count 1076
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 426 transition count 1076
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 426 transition count 1075
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 5 with 2 rules applied. Total rules applied 165 place count 425 transition count 1074
Applied a total of 165 rules in 362 ms. Remains 425 /473 variables (removed 48) and now considering 1074/1276 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 425/473 places, 1074/1276 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 3) seen :1
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-22 17:17:52] [INFO ] Flow matrix only has 618 transitions (discarded 456 similar events)
// Phase 1: matrix 618 rows 425 cols
[2024-05-22 17:17:52] [INFO ] Computed 184 invariants in 9 ms
[2024-05-22 17:17:52] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 17:17:52] [INFO ] [Nat]Absence check using 184 positive place invariants in 77 ms returned sat
[2024-05-22 17:17:53] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 17:17:53] [INFO ] State equation strengthened by 140 read => feed constraints.
[2024-05-22 17:17:53] [INFO ] After 226ms SMT Verify possible using 140 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 17:17:53] [INFO ] After 476ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 230 ms.
[2024-05-22 17:17:53] [INFO ] After 1328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 74 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1074/1074 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 425 transition count 1072
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 423 transition count 1071
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 422 transition count 1071
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 6 place count 422 transition count 1063
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 22 place count 414 transition count 1063
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 414 transition count 1062
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 24 place count 413 transition count 1061
Iterating global reduction 4 with 1 rules applied. Total rules applied 25 place count 413 transition count 1061
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 39 place count 406 transition count 1054
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 1318 edges and 406 vertex of which 404 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 20 rules applied. Total rules applied 59 place count 404 transition count 1035
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 61 place count 404 transition count 1033
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 74 place count 391 transition count 1002
Iterating global reduction 6 with 13 rules applied. Total rules applied 87 place count 391 transition count 1002
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 95 place count 387 transition count 1011
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 99 place count 387 transition count 1007
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 102 place count 387 transition count 1004
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 107 place count 387 transition count 999
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 1228 edges and 382 vertex of which 371 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 26 rules applied. Total rules applied 133 place count 371 transition count 979
Drop transitions removed 10 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 148 place count 371 transition count 964
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 153 place count 366 transition count 956
Iterating global reduction 9 with 5 rules applied. Total rules applied 158 place count 366 transition count 956
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 161 place count 366 transition count 953
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 162 place count 365 transition count 947
Iterating global reduction 9 with 1 rules applied. Total rules applied 163 place count 365 transition count 947
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 165 place count 365 transition count 947
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 167 place count 365 transition count 945
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 171 place count 363 transition count 943
Applied a total of 171 rules in 162 ms. Remains 363 /425 variables (removed 62) and now considering 943/1074 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 363/425 places, 943/1074 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 189221 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189221 steps, saw 169423 distinct states, run finished after 3002 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 17:17:57] [INFO ] Flow matrix only has 536 transitions (discarded 407 similar events)
// Phase 1: matrix 536 rows 363 cols
[2024-05-22 17:17:57] [INFO ] Computed 157 invariants in 8 ms
[2024-05-22 17:17:57] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 17:17:57] [INFO ] [Nat]Absence check using 157 positive place invariants in 48 ms returned sat
[2024-05-22 17:17:58] [INFO ] After 480ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 17:17:58] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-22 17:17:58] [INFO ] After 321ms SMT Verify possible using 123 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 17:17:58] [INFO ] After 616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 255 ms.
[2024-05-22 17:17:59] [INFO ] After 1516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 74 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 943/943 transitions.
Applied a total of 0 rules in 14 ms. Remains 363 /363 variables (removed 0) and now considering 943/943 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 363/363 places, 943/943 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 943/943 transitions.
Applied a total of 0 rules in 14 ms. Remains 363 /363 variables (removed 0) and now considering 943/943 (removed 0) transitions.
[2024-05-22 17:17:59] [INFO ] Flow matrix only has 536 transitions (discarded 407 similar events)
[2024-05-22 17:17:59] [INFO ] Invariant cache hit.
[2024-05-22 17:17:59] [INFO ] Implicit Places using invariants in 400 ms returned [362]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 404 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 362/363 places, 943/943 transitions.
Graph (trivial) has 31 edges and 362 vertex of which 2 / 362 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 349 transition count 897
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 349 transition count 897
Applied a total of 25 rules in 20 ms. Remains 349 /362 variables (removed 13) and now considering 897/943 (removed 46) transitions.
[2024-05-22 17:17:59] [INFO ] Flow matrix only has 534 transitions (discarded 363 similar events)
// Phase 1: matrix 534 rows 349 cols
[2024-05-22 17:17:59] [INFO ] Computed 144 invariants in 10 ms
[2024-05-22 17:17:59] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-22 17:17:59] [INFO ] Flow matrix only has 534 transitions (discarded 363 similar events)
[2024-05-22 17:17:59] [INFO ] Invariant cache hit.
[2024-05-22 17:18:00] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-22 17:18:00] [INFO ] Implicit Places using invariants and state equation in 959 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1311 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 348/363 places, 897/943 transitions.
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 348 transition count 890
Graph (complete) has 1110 edges and 348 vertex of which 346 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 346 transition count 890
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 346 transition count 884
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 344 transition count 884
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 18 place count 342 transition count 882
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 342 transition count 882
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 342 transition count 881
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 23 place count 341 transition count 890
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 34 place count 341 transition count 879
Applied a total of 34 rules in 78 ms. Remains 341 /348 variables (removed 7) and now considering 879/897 (removed 18) transitions.
[2024-05-22 17:18:00] [INFO ] Flow matrix only has 526 transitions (discarded 353 similar events)
// Phase 1: matrix 526 rows 341 cols
[2024-05-22 17:18:00] [INFO ] Computed 140 invariants in 5 ms
[2024-05-22 17:18:01] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-22 17:18:01] [INFO ] Flow matrix only has 526 transitions (discarded 353 similar events)
[2024-05-22 17:18:01] [INFO ] Invariant cache hit.
[2024-05-22 17:18:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-22 17:18:02] [INFO ] Implicit Places using invariants and state equation in 1058 ms returned []
Implicit Place search using SMT with State Equation took 1418 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 341/363 places, 879/943 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3247 ms. Remains : 341/363 places, 879/943 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 185021 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 185021 steps, saw 165242 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 17:18:05] [INFO ] Flow matrix only has 526 transitions (discarded 353 similar events)
[2024-05-22 17:18:05] [INFO ] Invariant cache hit.
[2024-05-22 17:18:05] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 17:18:05] [INFO ] [Nat]Absence check using 140 positive place invariants in 45 ms returned sat
[2024-05-22 17:18:06] [INFO ] After 323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 17:18:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-22 17:18:06] [INFO ] After 231ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 17:18:06] [INFO ] After 536ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 240 ms.
[2024-05-22 17:18:06] [INFO ] After 1241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 74 out of 341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 879/879 transitions.
Applied a total of 0 rules in 13 ms. Remains 341 /341 variables (removed 0) and now considering 879/879 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 341/341 places, 879/879 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 879/879 transitions.
Applied a total of 0 rules in 12 ms. Remains 341 /341 variables (removed 0) and now considering 879/879 (removed 0) transitions.
[2024-05-22 17:18:06] [INFO ] Flow matrix only has 526 transitions (discarded 353 similar events)
[2024-05-22 17:18:06] [INFO ] Invariant cache hit.
[2024-05-22 17:18:07] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-22 17:18:07] [INFO ] Flow matrix only has 526 transitions (discarded 353 similar events)
[2024-05-22 17:18:07] [INFO ] Invariant cache hit.
[2024-05-22 17:18:07] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-22 17:18:07] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 993 ms to find 0 implicit places.
[2024-05-22 17:18:08] [INFO ] Redundant transitions in 61 ms returned []
[2024-05-22 17:18:08] [INFO ] Flow matrix only has 526 transitions (discarded 353 similar events)
[2024-05-22 17:18:08] [INFO ] Invariant cache hit.
[2024-05-22 17:18:08] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1837 ms. Remains : 341/341 places, 879/879 transitions.
Graph (trivial) has 401 edges and 341 vertex of which 52 / 341 are part of one of the 25 SCC in 0 ms
Free SCC test removed 27 places
Drop transitions removed 129 transitions
Ensure Unique test removed 344 transitions
Reduce isomorphic transitions removed 473 transitions.
Graph (complete) has 626 edges and 314 vertex of which 242 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.0 ms
Discarding 72 places :
Also discarding 0 output transitions
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 242 transition count 400
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 236 transition count 400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 236 transition count 399
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 16 place count 235 transition count 399
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 230 transition count 390
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 230 transition count 390
Performed 17 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
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 60 place count 213 transition count 362
Drop transitions removed 1 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 81 place count 213 transition count 341
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 85 place count 209 transition count 337
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 209 transition count 337
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 91 place count 208 transition count 336
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 206 transition count 337
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 3 with 58 rules applied. Total rules applied 153 place count 206 transition count 279
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 15 rules applied. Total rules applied 168 place count 192 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 169 place count 191 transition count 278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 171 place count 190 transition count 278
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 177 place count 190 transition count 272
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 183 place count 184 transition count 272
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 186 place count 184 transition count 269
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 6 with 22 rules applied. Total rules applied 208 place count 184 transition count 269
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 209 place count 184 transition count 268
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 211 place count 184 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 212 place count 183 transition count 265
Applied a total of 212 rules in 70 ms. Remains 183 /341 variables (removed 158) and now considering 265/879 (removed 614) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 265 rows 183 cols
[2024-05-22 17:18:08] [INFO ] Computed 45 invariants in 1 ms
[2024-05-22 17:18:08] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 17:18:08] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-22 17:18:09] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 17:18:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 17:18:09] [INFO ] After 70ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 17:18:09] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 91 ms.
[2024-05-22 17:18:09] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-22 17:18:09] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2024-05-22 17:18:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 341 places, 879 transitions and 4903 arcs took 13 ms.
[2024-05-22 17:18:10] [INFO ] Flatten gal took : 292 ms
Total runtime 55345 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DLCround-PT-11b
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
ReachabilityCardinality

FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716398291916

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 10 (type EXCL) for 3 DLCround-PT-11b-ReachabilityCardinality-2024-07
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 3 DLCround-PT-11b-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 3 DLCround-PT-11b-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 9 (type SRCH) for 3 DLCround-PT-11b-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 6 (type FNDP) for DLCround-PT-11b-ReachabilityCardinality-2024-07
lola: result : true
lola: fired transitions : 58
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 7 (type EQUN) for DLCround-PT-11b-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 9 (type SRCH) for DLCround-PT-11b-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 10 (type EXCL) for DLCround-PT-11b-ReachabilityCardinality-2024-07 (obsolete)
lola: LAUNCH task # 17 (type EXCL) for 0 DLCround-PT-11b-ReachabilityCardinality-2024-04
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 0 DLCround-PT-11b-ReachabilityCardinality-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 0 DLCround-PT-11b-ReachabilityCardinality-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 16 (type SRCH) for 0 DLCround-PT-11b-ReachabilityCardinality-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 13 (type FNDP) for DLCround-PT-11b-ReachabilityCardinality-2024-04
lola: result : true
lola: fired transitions : 21
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 14 (type EQUN) for DLCround-PT-11b-ReachabilityCardinality-2024-04 (obsolete)
lola: CANCELED task # 16 (type SRCH) for DLCround-PT-11b-ReachabilityCardinality-2024-04 (obsolete)
lola: CANCELED task # 17 (type EXCL) for DLCround-PT-11b-ReachabilityCardinality-2024-04 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DLCround-PT-11b-ReachabilityCardinality-2024-04: AG false findpath
DLCround-PT-11b-ReachabilityCardinality-2024-07: EF true findpath


Time elapsed: 0 secs. Pages in use: 4

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="DLCround-PT-11b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is DLCround-PT-11b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r131-smll-171624288500159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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