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-171624288100009.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 DLCflexbar-PT-2b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-171624288100009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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 4.0K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 12:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 12:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 DLCflexbar-PT-2b-ReachabilityCardinality-2024-00
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-01
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-02
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-03
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-04
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-05
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-06
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-07
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-08
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-09
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-10
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-11
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-12
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-13
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-14
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716362759048

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=DLCflexbar-PT-2b
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-22 07:26:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 07:26:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:26:03] [INFO ] Load time of PNML (sax parser for PT used): 478 ms
[2024-05-22 07:26:03] [INFO ] Transformed 4456 places.
[2024-05-22 07:26:03] [INFO ] Transformed 6272 transitions.
[2024-05-22 07:26:03] [INFO ] Found NUPN structural information;
[2024-05-22 07:26:03] [INFO ] Parsed PT model containing 4456 places and 6272 transitions and 16411 arcs in 770 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 933 ms. (steps per millisecond=10 ) properties (out of 12) seen :9
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6272 rows 4456 cols
[2024-05-22 07:26:05] [INFO ] Computed 196 invariants in 84 ms
[2024-05-22 07:26:07] [INFO ] After 2132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 07:26:09] [INFO ] [Nat]Absence check using 196 positive place invariants in 405 ms returned sat
[2024-05-22 07:26:16] [INFO ] After 6536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 07:26:19] [INFO ] Deduced a trap composed of 82 places in 2625 ms of which 41 ms to minimize.
[2024-05-22 07:26:21] [INFO ] Deduced a trap composed of 292 places in 2228 ms of which 2 ms to minimize.
[2024-05-22 07:26:24] [INFO ] Deduced a trap composed of 74 places in 2033 ms of which 3 ms to minimize.
[2024-05-22 07:26:26] [INFO ] Deduced a trap composed of 107 places in 2132 ms of which 2 ms to minimize.
[2024-05-22 07:26:28] [INFO ] Deduced a trap composed of 193 places in 1524 ms of which 2 ms to minimize.
[2024-05-22 07:26:30] [INFO ] Deduced a trap composed of 92 places in 1375 ms of which 2 ms to minimize.
[2024-05-22 07:26:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 14067 ms
[2024-05-22 07:26:32] [INFO ] Deduced a trap composed of 270 places in 1382 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-22 07:26:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-22 07:26:32] [INFO ] After 25484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 200 ms.
Support contains 42 out of 4456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4456/4456 places, 6272/6272 transitions.
Graph (trivial) has 4165 edges and 4456 vertex of which 492 / 4456 are part of one of the 36 SCC in 28 ms
Free SCC test removed 456 places
Drop transitions removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Drop transitions removed 2048 transitions
Trivial Post-agglo rules discarded 2048 transitions
Performed 2048 trivial Post agglomeration. Transition count delta: 2048
Iterating post reduction 0 with 2048 rules applied. Total rules applied 2049 place count 4000 transition count 3709
Reduce places removed 2048 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 1 with 2188 rules applied. Total rules applied 4237 place count 1952 transition count 3569
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 2 with 108 rules applied. Total rules applied 4345 place count 1884 transition count 3529
Reduce places removed 20 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 3 with 49 rules applied. Total rules applied 4394 place count 1864 transition count 3500
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 4423 place count 1835 transition count 3500
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 4423 place count 1835 transition count 3471
Deduced a syphon composed of 29 places in 73 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 4481 place count 1806 transition count 3471
Discarding 478 places :
Symmetric choice reduction at 5 with 478 rule applications. Total rules 4959 place count 1328 transition count 2993
Iterating global reduction 5 with 478 rules applied. Total rules applied 5437 place count 1328 transition count 2993
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 180 Pre rules applied. Total rules applied 5437 place count 1328 transition count 2813
Deduced a syphon composed of 180 places in 18 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 5 with 360 rules applied. Total rules applied 5797 place count 1148 transition count 2813
Discarding 57 places :
Symmetric choice reduction at 5 with 57 rule applications. Total rules 5854 place count 1091 transition count 2129
Iterating global reduction 5 with 57 rules applied. Total rules applied 5911 place count 1091 transition count 2129
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 36 rules applied. Total rules applied 5947 place count 1091 transition count 2093
Performed 277 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 277 places in 1 ms
Reduce places removed 277 places and 0 transitions.
Iterating global reduction 6 with 554 rules applied. Total rules applied 6501 place count 814 transition count 1812
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 6504 place count 814 transition count 1809
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 6506 place count 812 transition count 1763
Iterating global reduction 7 with 2 rules applied. Total rules applied 6508 place count 812 transition count 1763
Performed 77 Post agglomeration using F-continuation condition with reduction of 52 identical transitions.
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 7 with 154 rules applied. Total rules applied 6662 place count 735 transition count 2120
Drop transitions removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 7 with 44 rules applied. Total rules applied 6706 place count 735 transition count 2076
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 6721 place count 720 transition count 1947
Iterating global reduction 8 with 15 rules applied. Total rules applied 6736 place count 720 transition count 1947
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 8 with 48 rules applied. Total rules applied 6784 place count 720 transition count 1899
Drop transitions removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 9 with 43 rules applied. Total rules applied 6827 place count 720 transition count 1856
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 6833 place count 714 transition count 1850
Iterating global reduction 9 with 6 rules applied. Total rules applied 6839 place count 714 transition count 1850
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 6845 place count 708 transition count 1704
Iterating global reduction 9 with 6 rules applied. Total rules applied 6851 place count 708 transition count 1704
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 6857 place count 708 transition count 1698
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 6865 place count 704 transition count 1694
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 6869 place count 700 transition count 1598
Iterating global reduction 10 with 4 rules applied. Total rules applied 6873 place count 700 transition count 1598
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 6877 place count 700 transition count 1594
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 6881 place count 698 transition count 1615
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 6883 place count 698 transition count 1613
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 6886 place count 698 transition count 1610
Free-agglomeration rule applied 377 times with reduction of 210 identical transitions.
Iterating global reduction 12 with 377 rules applied. Total rules applied 7263 place count 698 transition count 1023
Reduce places removed 377 places and 0 transitions.
Drop transitions removed 409 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 414 transitions.
Graph (complete) has 849 edges and 321 vertex of which 292 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Iterating post reduction 12 with 792 rules applied. Total rules applied 8055 place count 292 transition count 591
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 8061 place count 292 transition count 585
Discarding 55 places :
Symmetric choice reduction at 14 with 55 rule applications. Total rules 8116 place count 237 transition count 487
Iterating global reduction 14 with 55 rules applied. Total rules applied 8171 place count 237 transition count 487
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 14 with 44 rules applied. Total rules applied 8215 place count 237 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 8216 place count 236 transition count 443
Discarding 15 places :
Symmetric choice reduction at 15 with 15 rule applications. Total rules 8231 place count 221 transition count 420
Iterating global reduction 15 with 15 rules applied. Total rules applied 8246 place count 221 transition count 420
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 8247 place count 221 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 8248 place count 220 transition count 419
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 8249 place count 220 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 8250 place count 219 transition count 418
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 17 with 2 rules applied. Total rules applied 8252 place count 219 transition count 433
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 17 with 19 rules applied. Total rules applied 8271 place count 217 transition count 416
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 8273 place count 217 transition count 414
Applied a total of 8273 rules in 1529 ms. Remains 217 /4456 variables (removed 4239) and now considering 414/6272 (removed 5858) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1529 ms. Remains : 217/4456 places, 414/6272 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :1
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 07:26:34] [INFO ] Flow matrix only has 276 transitions (discarded 138 similar events)
// Phase 1: matrix 276 rows 217 cols
[2024-05-22 07:26:34] [INFO ] Computed 98 invariants in 5 ms
[2024-05-22 07:26:34] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 07:26:34] [INFO ] [Nat]Absence check using 98 positive place invariants in 21 ms returned sat
[2024-05-22 07:26:35] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 07:26:35] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-05-22 07:26:35] [INFO ] After 100ms SMT Verify possible using 109 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 07:26:35] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-22 07:26:35] [INFO ] After 593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 32 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 414/414 transitions.
Graph (trivial) has 23 edges and 217 vertex of which 3 / 217 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 598 edges and 215 vertex of which 184 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 33 output transitions
Drop transitions removed 33 transitions
Drop transitions removed 9 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 26 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 27 rules applied. Total rules applied 29 place count 184 transition count 350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 183 transition count 350
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 30 place count 183 transition count 349
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 182 transition count 349
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 179 transition count 340
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 179 transition count 340
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 44 place count 176 transition count 337
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 49 place count 176 transition count 332
Renaming transitions due to excessive name length > 1024 char.
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 175 transition count 330
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 175 transition count 330
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 53 place count 174 transition count 336
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 174 transition count 335
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 173 transition count 332
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 173 transition count 332
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 60 place count 173 transition count 328
Applied a total of 60 rules in 67 ms. Remains 173 /217 variables (removed 44) and now considering 328/414 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 173/217 places, 328/414 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 683661 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 683661 steps, saw 508886 distinct states, run finished after 3007 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 07:26:38] [INFO ] Flow matrix only has 217 transitions (discarded 111 similar events)
// Phase 1: matrix 217 rows 173 cols
[2024-05-22 07:26:38] [INFO ] Computed 80 invariants in 4 ms
[2024-05-22 07:26:38] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 07:26:38] [INFO ] [Nat]Absence check using 80 positive place invariants in 36 ms returned sat
[2024-05-22 07:26:39] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 07:26:39] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-05-22 07:26:39] [INFO ] After 83ms SMT Verify possible using 88 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 07:26:39] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-22 07:26:39] [INFO ] After 554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 32 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 328/328 transitions.
Applied a total of 0 rules in 9 ms. Remains 173 /173 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 173/173 places, 328/328 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 328/328 transitions.
Applied a total of 0 rules in 9 ms. Remains 173 /173 variables (removed 0) and now considering 328/328 (removed 0) transitions.
[2024-05-22 07:26:39] [INFO ] Flow matrix only has 217 transitions (discarded 111 similar events)
[2024-05-22 07:26:39] [INFO ] Invariant cache hit.
[2024-05-22 07:26:39] [INFO ] Implicit Places using invariants in 261 ms returned [65, 66, 96, 97, 106, 107, 108, 109, 110, 111, 112, 113, 114, 120, 121, 122, 123, 133]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 270 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 155/173 places, 328/328 transitions.
Graph (trivial) has 36 edges and 155 vertex of which 14 / 155 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions removed 25 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 33 transitions.
Graph (complete) has 380 edges and 148 vertex of which 146 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
Drop transitions removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 146 transition count 284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 145 transition count 284
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 142 transition count 275
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 142 transition count 275
Performed 6 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 31 place count 136 transition count 263
Drop transitions removed 9 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 57 place count 136 transition count 237
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 60 place count 133 transition count 232
Iterating global reduction 3 with 3 rules applied. Total rules applied 63 place count 133 transition count 232
Drop transitions removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 3 with 53 rules applied. Total rules applied 116 place count 133 transition count 179
Reduce places removed 7 places and 0 transitions.
Graph (complete) has 274 edges and 126 vertex of which 124 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output 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 3 with 9 rules applied. Total rules applied 125 place count 124 transition count 178
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 129 place count 123 transition count 175
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 129 place count 123 transition count 173
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 133 place count 121 transition count 173
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 139 place count 115 transition count 159
Iterating global reduction 5 with 6 rules applied. Total rules applied 145 place count 115 transition count 159
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 147 place count 115 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 149 place count 113 transition count 157
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 150 place count 113 transition count 157
Applied a total of 150 rules in 70 ms. Remains 113 /155 variables (removed 42) and now considering 157/328 (removed 171) transitions.
[2024-05-22 07:26:39] [INFO ] Flow matrix only has 136 transitions (discarded 21 similar events)
// Phase 1: matrix 136 rows 113 cols
[2024-05-22 07:26:39] [INFO ] Computed 41 invariants in 2 ms
[2024-05-22 07:26:39] [INFO ] Implicit Places using invariants in 124 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 128 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 112/173 places, 157/328 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 112 transition count 156
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 111 transition count 155
Applied a total of 3 rules in 8 ms. Remains 111 /112 variables (removed 1) and now considering 155/157 (removed 2) transitions.
[2024-05-22 07:26:39] [INFO ] Flow matrix only has 134 transitions (discarded 21 similar events)
// Phase 1: matrix 134 rows 111 cols
[2024-05-22 07:26:39] [INFO ] Computed 40 invariants in 2 ms
[2024-05-22 07:26:39] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-22 07:26:39] [INFO ] Flow matrix only has 134 transitions (discarded 21 similar events)
[2024-05-22 07:26:39] [INFO ] Invariant cache hit.
[2024-05-22 07:26:40] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 07:26:40] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 111/173 places, 155/328 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 762 ms. Remains : 111/173 places, 155/328 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1330140 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :{}
Probabilistic random walk after 1330140 steps, saw 899994 distinct states, run finished after 3007 ms. (steps per millisecond=442 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 07:26:43] [INFO ] Flow matrix only has 134 transitions (discarded 21 similar events)
[2024-05-22 07:26:43] [INFO ] Invariant cache hit.
[2024-05-22 07:26:43] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 07:26:43] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2024-05-22 07:26:43] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 07:26:43] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 07:26:43] [INFO ] After 39ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 07:26:43] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-22 07:26:43] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 32 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 155/155 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 111/111 places, 155/155 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 155/155 transitions.
Applied a total of 0 rules in 5 ms. Remains 111 /111 variables (removed 0) and now considering 155/155 (removed 0) transitions.
[2024-05-22 07:26:43] [INFO ] Flow matrix only has 134 transitions (discarded 21 similar events)
[2024-05-22 07:26:43] [INFO ] Invariant cache hit.
[2024-05-22 07:26:43] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-22 07:26:43] [INFO ] Flow matrix only has 134 transitions (discarded 21 similar events)
[2024-05-22 07:26:43] [INFO ] Invariant cache hit.
[2024-05-22 07:26:43] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 07:26:43] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-05-22 07:26:43] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-22 07:26:43] [INFO ] Flow matrix only has 134 transitions (discarded 21 similar events)
[2024-05-22 07:26:43] [INFO ] Invariant cache hit.
[2024-05-22 07:26:44] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 495 ms. Remains : 111/111 places, 155/155 transitions.
Graph (trivial) has 64 edges and 111 vertex of which 22 / 111 are part of one of the 11 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions removed 33 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 161 edges and 100 vertex of which 86 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 86 transition count 105
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 84 transition count 105
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 84 transition count 103
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 82 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 81 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 81 transition count 102
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 2 with 4 rules applied. Total rules applied 16 place count 79 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 79 transition count 98
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 35 place count 79 transition count 81
Reduce places removed 6 places and 0 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 3 with 9 rules applied. Total rules applied 44 place count 73 transition count 78
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 48 place count 70 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 49 place count 69 transition count 77
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 49 place count 69 transition count 76
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 51 place count 68 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 53 place count 67 transition count 76
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 54 place count 67 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 55 place count 66 transition count 75
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 58 place count 66 transition count 75
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 59 place count 65 transition count 73
Iterating global reduction 7 with 1 rules applied. Total rules applied 60 place count 65 transition count 73
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 61 place count 65 transition count 72
Applied a total of 61 rules in 35 ms. Remains 65 /111 variables (removed 46) and now considering 72/155 (removed 83) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 65 cols
[2024-05-22 07:26:44] [INFO ] Computed 20 invariants in 1 ms
[2024-05-22 07:26:44] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 07:26:44] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2024-05-22 07:26:44] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 07:26:44] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-22 07:26:44] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-22 07:26:44] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2024-05-22 07:26:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 111 places, 155 transitions and 537 arcs took 4 ms.
[2024-05-22 07:26:44] [INFO ] Flatten gal took : 116 ms
Total runtime 42329 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DLCflexbar-PT-2b
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
ReachabilityCardinality

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

BK_STOP 1716362806407

--------------------
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/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/ReachabilityCardinality.xml
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 # 7 (type EXCL) for 0 DLCflexbar-PT-2b-ReachabilityCardinality-2024-11
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 DLCflexbar-PT-2b-ReachabilityCardinality-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 DLCflexbar-PT-2b-ReachabilityCardinality-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 6 (type SRCH) for 0 DLCflexbar-PT-2b-ReachabilityCardinality-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 7 (type EXCL) for DLCflexbar-PT-2b-ReachabilityCardinality-2024-11
lola: result : true
lola: markings : 18
lola: fired transitions : 18
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for DLCflexbar-PT-2b-ReachabilityCardinality-2024-11 (obsolete)
lola: CANCELED task # 4 (type EQUN) for DLCflexbar-PT-2b-ReachabilityCardinality-2024-11 (obsolete)
lola: CANCELED task # 6 (type SRCH) for DLCflexbar-PT-2b-ReachabilityCardinality-2024-11 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DLCflexbar-PT-2b-ReachabilityCardinality-2024-11: EF true tandem / relaxed


Time elapsed: 0 secs. Pages in use: 1

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="DLCflexbar-PT-2b"
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 DLCflexbar-PT-2b, 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-171624288100009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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