About the Execution of 2023-gold for DLCflexbar-PT-7b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1928.056 | 237215.00 | 320375.00 | 891.60 | FFFTTFFFTTTTFFTT | normal |
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-171624288300060.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-7b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-171624288300060
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.9K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 12 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 12 13:03 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 14M 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-7b-ReachabilityFireability-2024-00
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-2024-01
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-2024-02
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-2024-03
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-2024-04
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-2024-05
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-2024-06
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-2024-07
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-2024-08
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-2024-09
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-2024-10
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-2024-11
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-2024-12
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-2024-13
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-2024-14
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716381128897
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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCflexbar-PT-7b
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-22 12:32:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 12:32:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 12:32:13] [INFO ] Load time of PNML (sax parser for PT used): 1318 ms
[2024-05-22 12:32:15] [INFO ] Transformed 35101 places.
[2024-05-22 12:32:15] [INFO ] Transformed 55507 transitions.
[2024-05-22 12:32:15] [INFO ] Found NUPN structural information;
[2024-05-22 12:32:17] [INFO ] Parsed PT model containing 35101 places and 55507 transitions and 156636 arcs in 5111 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1211 ms. (steps per millisecond=8 ) properties (out of 16) seen :1
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 49409 steps, run timeout after 3005 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 49409 steps, saw 48859 distinct states, run finished after 3009 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 55507 rows 35101 cols
[2024-05-22 12:32:31] [INFO ] Computed 2171 invariants in 569 ms
[2024-05-22 12:32:55] [INFO ] After 23747ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2343)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:621)
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 12:33:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-22 12:33:20] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 483 out of 35101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35101/35101 places, 55507/55507 transitions.
Graph (trivial) has 30771 edges and 35101 vertex of which 1836 / 35101 are part of one of the 134 SCC in 132 ms
Free SCC test removed 1702 places
Drop transitions removed 1933 transitions
Reduce isomorphic transitions removed 1933 transitions.
Drop transitions removed 15236 transitions
Trivial Post-agglo rules discarded 15236 transitions
Performed 15236 trivial Post agglomeration. Transition count delta: 15236
Iterating post reduction 0 with 15236 rules applied. Total rules applied 15237 place count 33399 transition count 38338
Reduce places removed 15236 places and 0 transitions.
Ensure Unique test removed 325 transitions
Reduce isomorphic transitions removed 325 transitions.
Drop transitions removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 1 with 15883 rules applied. Total rules applied 31120 place count 18163 transition count 37691
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 2 with 512 rules applied. Total rules applied 31632 place count 17841 transition count 37501
Reduce places removed 92 places and 0 transitions.
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Iterating post reduction 3 with 226 rules applied. Total rules applied 31858 place count 17749 transition count 37367
Reduce places removed 134 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 139 rules applied. Total rules applied 31997 place count 17615 transition count 37362
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 31999 place count 17613 transition count 37362
Performed 286 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 286 Pre rules applied. Total rules applied 31999 place count 17613 transition count 37076
Deduced a syphon composed of 286 places in 2759 ms
Reduce places removed 286 places and 0 transitions.
Iterating global reduction 6 with 572 rules applied. Total rules applied 32571 place count 17327 transition count 37076
Discarding 4733 places :
Symmetric choice reduction at 6 with 4733 rule applications. Total rules 37304 place count 12594 transition count 32343
Iterating global reduction 6 with 4733 rules applied. Total rules applied 42037 place count 12594 transition count 32343
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 6 with 32 rules applied. Total rules applied 42069 place count 12594 transition count 32311
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 42087 place count 12582 transition count 32305
Performed 2023 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2023 Pre rules applied. Total rules applied 42087 place count 12582 transition count 30282
Deduced a syphon composed of 2023 places in 2333 ms
Reduce places removed 2023 places and 0 transitions.
Iterating global reduction 8 with 4046 rules applied. Total rules applied 46133 place count 10559 transition count 30282
Discarding 174 places :
Symmetric choice reduction at 8 with 174 rule applications. Total rules 46307 place count 10385 transition count 27876
Iterating global reduction 8 with 174 rules applied. Total rules applied 46481 place count 10385 transition count 27876
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 162 transitions.
Iterating post reduction 8 with 162 rules applied. Total rules applied 46643 place count 10385 transition count 27714
Performed 2591 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 2591 places in 26 ms
Reduce places removed 2591 places and 0 transitions.
Iterating global reduction 9 with 5182 rules applied. Total rules applied 51825 place count 7794 transition count 25120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 51826 place count 7794 transition count 25119
Renaming transitions due to excessive name length > 1024 char.
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 51828 place count 7792 transition count 24883
Iterating global reduction 10 with 2 rules applied. Total rules applied 51830 place count 7792 transition count 24883
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -860
Deduced a syphon composed of 101 places in 19 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 10 with 202 rules applied. Total rules applied 52032 place count 7691 transition count 25743
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 10 with 39 rules applied. Total rules applied 52071 place count 7691 transition count 25704
Discarding 41 places :
Symmetric choice reduction at 11 with 41 rule applications. Total rules 52112 place count 7650 transition count 24966
Iterating global reduction 11 with 41 rules applied. Total rules applied 52153 place count 7650 transition count 24966
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 11 with 30 rules applied. Total rules applied 52183 place count 7650 transition count 24936
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -809
Deduced a syphon composed of 101 places in 19 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 12 with 202 rules applied. Total rules applied 52385 place count 7549 transition count 25745
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 12 with 30 rules applied. Total rules applied 52415 place count 7549 transition count 25715
Discarding 30 places :
Symmetric choice reduction at 13 with 30 rule applications. Total rules 52445 place count 7519 transition count 25175
Iterating global reduction 13 with 30 rules applied. Total rules applied 52475 place count 7519 transition count 25175
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 13 with 27 rules applied. Total rules applied 52502 place count 7519 transition count 25148
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -805
Deduced a syphon composed of 101 places in 17 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 14 with 202 rules applied. Total rules applied 52704 place count 7418 transition count 25953
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 14 with 29 rules applied. Total rules applied 52733 place count 7418 transition count 25924
Discarding 29 places :
Symmetric choice reduction at 15 with 29 rule applications. Total rules 52762 place count 7389 transition count 25402
Iterating global reduction 15 with 29 rules applied. Total rules applied 52791 place count 7389 transition count 25402
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 15 with 25 rules applied. Total rules applied 52816 place count 7389 transition count 25377
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -825
Deduced a syphon composed of 101 places in 15 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 16 with 202 rules applied. Total rules applied 53018 place count 7288 transition count 26202
Drop transitions removed 95 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 16 with 96 rules applied. Total rules applied 53114 place count 7288 transition count 26106
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 53115 place count 7287 transition count 26088
Iterating global reduction 17 with 1 rules applied. Total rules applied 53116 place count 7287 transition count 26088
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 53117 place count 7287 transition count 26087
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: -551
Deduced a syphon composed of 63 places in 10 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 18 with 126 rules applied. Total rules applied 53243 place count 7224 transition count 26638
Drop transitions removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 18 with 78 rules applied. Total rules applied 53321 place count 7224 transition count 26560
Free-agglomeration rule applied 4026 times with reduction of 1855 identical transitions.
Iterating global reduction 19 with 4026 rules applied. Total rules applied 57347 place count 7224 transition count 20679
Reduce places removed 4026 places and 0 transitions.
Drop transitions removed 4367 transitions
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 4514 transitions.
Graph (complete) has 15966 edges and 3198 vertex of which 3184 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.11 ms
Discarding 14 places :
Also discarding 0 output transitions
Iterating post reduction 19 with 8541 rules applied. Total rules applied 65888 place count 3184 transition count 16165
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 20 with 126 rules applied. Total rules applied 66014 place count 3184 transition count 16039
Discarding 106 places :
Symmetric choice reduction at 21 with 106 rule applications. Total rules 66120 place count 3078 transition count 15492
Iterating global reduction 21 with 106 rules applied. Total rules applied 66226 place count 3078 transition count 15492
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 66227 place count 3078 transition count 15491
Drop transitions removed 460 transitions
Redundant transition composition rules discarded 460 transitions
Iterating global reduction 22 with 460 rules applied. Total rules applied 66687 place count 3078 transition count 15031
Discarding 52 places :
Symmetric choice reduction at 22 with 52 rule applications. Total rules 66739 place count 3026 transition count 14636
Iterating global reduction 22 with 52 rules applied. Total rules applied 66791 place count 3026 transition count 14636
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 22 with 4 rules applied. Total rules applied 66795 place count 3024 transition count 14634
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 66796 place count 3023 transition count 14521
Iterating global reduction 22 with 1 rules applied. Total rules applied 66797 place count 3023 transition count 14521
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 66798 place count 3023 transition count 14520
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 23 with 11 rules applied. Total rules applied 66809 place count 3023 transition count 14509
Free-agglomeration rule applied 8 times.
Iterating global reduction 23 with 8 rules applied. Total rules applied 66817 place count 3023 transition count 14501
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 195 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 208 transitions.
Iterating post reduction 23 with 216 rules applied. Total rules applied 67033 place count 3015 transition count 14293
Drop transitions removed 83 transitions
Redundant transition composition rules discarded 83 transitions
Iterating global reduction 24 with 83 rules applied. Total rules applied 67116 place count 3015 transition count 14210
Discarding 17 places :
Symmetric choice reduction at 24 with 17 rule applications. Total rules 67133 place count 2998 transition count 14177
Iterating global reduction 24 with 17 rules applied. Total rules applied 67150 place count 2998 transition count 14177
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 24 with 6 rules applied. Total rules applied 67156 place count 2995 transition count 14198
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 24 with 26 rules applied. Total rules applied 67182 place count 2995 transition count 14172
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 25 with 1 rules applied. Total rules applied 67183 place count 2995 transition count 14278
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Iterating post reduction 25 with 94 rules applied. Total rules applied 67277 place count 2994 transition count 14185
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 26 with 2 rules applied. Total rules applied 67279 place count 2994 transition count 14183
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 26 with 18 rules applied. Total rules applied 67297 place count 2994 transition count 14183
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 26 with 4 rules applied. Total rules applied 67301 place count 2994 transition count 14179
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 67302 place count 2994 transition count 14179
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 67303 place count 2994 transition count 14178
Applied a total of 67303 rules in 44564 ms. Remains 2994 /35101 variables (removed 32107) and now considering 14178/55507 (removed 41329) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44569 ms. Remains : 2994/35101 places, 14178/55507 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1117 ms. (steps per millisecond=8 ) properties (out of 15) seen :7
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-22 12:34:06] [INFO ] Flow matrix only has 3501 transitions (discarded 10677 similar events)
// Phase 1: matrix 3501 rows 2994 cols
[2024-05-22 12:34:06] [INFO ] Computed 1993 invariants in 57 ms
[2024-05-22 12:34:08] [INFO ] After 991ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-22 12:34:10] [INFO ] [Nat]Absence check using 1993 positive place invariants in 1176 ms returned sat
[2024-05-22 12:34:17] [INFO ] After 6147ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2024-05-22 12:34:17] [INFO ] State equation strengthened by 820 read => feed constraints.
[2024-05-22 12:34:24] [INFO ] After 7173ms SMT Verify possible using 820 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2024-05-22 12:34:31] [INFO ] After 13968ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 1665 ms.
[2024-05-22 12:34:33] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-2024-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 509 ms.
Support contains 246 out of 2994 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2994/2994 places, 14178/14178 transitions.
Graph (trivial) has 461 edges and 2994 vertex of which 35 / 2994 are part of one of the 16 SCC in 1 ms
Free SCC test removed 19 places
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 14093 edges and 2975 vertex of which 2966 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 2966 transition count 14078
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 91 place count 2935 transition count 14078
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 91 place count 2935 transition count 14030
Deduced a syphon composed of 48 places in 7 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 187 place count 2887 transition count 14030
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 193 place count 2887 transition count 14024
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 228 place count 2852 transition count 13034
Iterating global reduction 3 with 35 rules applied. Total rules applied 263 place count 2852 transition count 13034
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 265 place count 2852 transition count 13032
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 4 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 381 place count 2794 transition count 12974
Drop transitions removed 581 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 589 transitions.
Iterating post reduction 4 with 589 rules applied. Total rules applied 970 place count 2794 transition count 12385
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 974 place count 2790 transition count 12119
Iterating global reduction 5 with 4 rules applied. Total rules applied 978 place count 2790 transition count 12119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 980 place count 2790 transition count 12117
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 10 places in 7 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 1000 place count 2780 transition count 12151
Drop transitions removed 25 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 6 with 35 rules applied. Total rules applied 1035 place count 2780 transition count 12116
Drop transitions removed 228 transitions
Redundant transition composition rules discarded 228 transitions
Iterating global reduction 7 with 228 rules applied. Total rules applied 1263 place count 2780 transition count 11888
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1275 place count 2768 transition count 11770
Iterating global reduction 7 with 12 rules applied. Total rules applied 1287 place count 2768 transition count 11770
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 1308 place count 2768 transition count 11749
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1308 place count 2768 transition count 11748
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1310 place count 2767 transition count 11748
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1318 place count 2767 transition count 11740
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1324 place count 2761 transition count 11732
Iterating global reduction 9 with 6 rules applied. Total rules applied 1330 place count 2761 transition count 11732
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 1336 place count 2758 transition count 11729
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1337 place count 2757 transition count 11622
Iterating global reduction 9 with 1 rules applied. Total rules applied 1338 place count 2757 transition count 11622
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1339 place count 2757 transition count 11621
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1341 place count 2756 transition count 11632
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1350 place count 2756 transition count 11623
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1351 place count 2756 transition count 11622
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1352 place count 2755 transition count 11517
Iterating global reduction 11 with 1 rules applied. Total rules applied 1353 place count 2755 transition count 11517
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1354 place count 2755 transition count 11516
Free-agglomeration rule applied 138 times with reduction of 32 identical transitions.
Iterating global reduction 12 with 138 rules applied. Total rules applied 1492 place count 2755 transition count 11346
Reduce places removed 138 places and 0 transitions.
Drop transitions removed 1550 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 1566 transitions.
Graph (complete) has 10547 edges and 2617 vertex of which 2578 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.9 ms
Discarding 39 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Iterating post reduction 12 with 1705 rules applied. Total rules applied 3197 place count 2578 transition count 9756
Drop transitions removed 97 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 117 transitions.
Iterating post reduction 13 with 117 rules applied. Total rules applied 3314 place count 2578 transition count 9639
Discarding 212 places :
Symmetric choice reduction at 14 with 212 rule applications. Total rules 3526 place count 2366 transition count 9011
Iterating global reduction 14 with 212 rules applied. Total rules applied 3738 place count 2366 transition count 9011
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 3740 place count 2365 transition count 9010
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 14 with 9 rules applied. Total rules applied 3749 place count 2365 transition count 9001
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 3751 place count 2364 transition count 9003
Drop transitions removed 164 transitions
Redundant transition composition rules discarded 164 transitions
Iterating global reduction 15 with 164 rules applied. Total rules applied 3915 place count 2364 transition count 8839
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 9550 edges and 2363 vertex of which 2350 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.4 ms
Discarding 13 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Iterating post reduction 15 with 2 rules applied. Total rules applied 3917 place count 2350 transition count 8829
Drop transitions removed 43 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 16 with 63 rules applied. Total rules applied 3980 place count 2350 transition count 8766
Discarding 114 places :
Symmetric choice reduction at 17 with 114 rule applications. Total rules 4094 place count 2236 transition count 8526
Iterating global reduction 17 with 114 rules applied. Total rules applied 4208 place count 2236 transition count 8526
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 4210 place count 2235 transition count 8525
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 4212 place count 2234 transition count 8531
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 4213 place count 2234 transition count 8530
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 17 with 87 rules applied. Total rules applied 4300 place count 2233 transition count 8444
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 18 with 9 rules applied. Total rules applied 4309 place count 2233 transition count 8435
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 18 with 2 rules applied. Total rules applied 4311 place count 2233 transition count 8717
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 176 transitions
Reduce isomorphic transitions removed 176 transitions.
Iterating post reduction 18 with 178 rules applied. Total rules applied 4489 place count 2231 transition count 8541
Drop transitions removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 19 with 96 rules applied. Total rules applied 4585 place count 2231 transition count 8445
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 19 with 6 rules applied. Total rules applied 4591 place count 2231 transition count 8445
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 19 with 6 rules applied. Total rules applied 4597 place count 2231 transition count 8439
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 19 with 12 rules applied. Total rules applied 4609 place count 2225 transition count 8433
Applied a total of 4609 rules in 5749 ms. Remains 2225 /2994 variables (removed 769) and now considering 8433/14178 (removed 5745) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5749 ms. Remains : 2225/2994 places, 8433/14178 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 973 ms. (steps per millisecond=10 ) properties (out of 7) seen :2
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-22 12:34:41] [INFO ] Flow matrix only has 2029 transitions (discarded 6404 similar events)
// Phase 1: matrix 2029 rows 2225 cols
[2024-05-22 12:34:41] [INFO ] Computed 1600 invariants in 31 ms
[2024-05-22 12:34:41] [INFO ] After 734ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 12:34:43] [INFO ] [Nat]Absence check using 1600 positive place invariants in 1089 ms returned sat
[2024-05-22 12:34:48] [INFO ] After 4503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 12:34:48] [INFO ] State equation strengthened by 658 read => feed constraints.
[2024-05-22 12:34:52] [INFO ] After 4054ms SMT Verify possible using 658 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-22 12:34:56] [INFO ] After 7943ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 3020 ms.
[2024-05-22 12:34:59] [INFO ] After 17950ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 21 ms.
Support contains 218 out of 2225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2225/2225 places, 8433/8433 transitions.
Graph (trivial) has 112 edges and 2225 vertex of which 5 / 2225 are part of one of the 2 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 9040 edges and 2222 vertex of which 2216 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Discarding 6 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 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 23 rules applied. Total rules applied 25 place count 2216 transition count 8397
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 2214 transition count 8397
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 27 place count 2214 transition count 8394
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 33 place count 2211 transition count 8394
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 2211 transition count 8392
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 50 place count 2196 transition count 8341
Iterating global reduction 3 with 15 rules applied. Total rules applied 65 place count 2196 transition count 8341
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 73 place count 2192 transition count 8337
Drop transitions removed 16 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 8918 edges and 2192 vertex of which 2191 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 19 rules applied. Total rules applied 92 place count 2191 transition count 8319
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 99 place count 2184 transition count 8311
Iterating global reduction 4 with 7 rules applied. Total rules applied 106 place count 2184 transition count 8311
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 2183 transition count 8317
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 116 place count 2183 transition count 8309
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 2182 transition count 8301
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 2182 transition count 8301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 119 place count 2182 transition count 8300
Free-agglomeration rule applied 17 times with reduction of 4 identical transitions.
Iterating global reduction 5 with 17 rules applied. Total rules applied 136 place count 2182 transition count 8279
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 222 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 227 transitions.
Graph (complete) has 8768 edges and 2165 vertex of which 2159 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 5 with 245 rules applied. Total rules applied 381 place count 2159 transition count 8048
Drop transitions removed 16 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 405 place count 2159 transition count 8024
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 425 place count 2139 transition count 7967
Iterating global reduction 7 with 20 rules applied. Total rules applied 445 place count 2139 transition count 7967
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 447 place count 2138 transition count 7973
Drop transitions removed 124 transitions
Redundant transition composition rules discarded 124 transitions
Iterating global reduction 7 with 124 rules applied. Total rules applied 571 place count 2138 transition count 7849
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 572 place count 2138 transition count 7850
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 573 place count 2137 transition count 7850
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 574 place count 2137 transition count 7849
Applied a total of 574 rules in 2326 ms. Remains 2137 /2225 variables (removed 88) and now considering 7849/8433 (removed 584) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2328 ms. Remains : 2137/2225 places, 7849/8433 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 767 ms. (steps per millisecond=13 ) properties (out of 5) seen :1
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-22 12:35:03] [INFO ] Flow matrix only has 1890 transitions (discarded 5959 similar events)
// Phase 1: matrix 1890 rows 2137 cols
[2024-05-22 12:35:03] [INFO ] Computed 1550 invariants in 34 ms
[2024-05-22 12:35:04] [INFO ] After 634ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 12:35:05] [INFO ] [Nat]Absence check using 1550 positive place invariants in 912 ms returned sat
[2024-05-22 12:35:09] [INFO ] After 3675ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 12:35:09] [INFO ] State equation strengthened by 613 read => feed constraints.
[2024-05-22 12:35:12] [INFO ] After 2306ms SMT Verify possible using 613 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 12:35:14] [INFO ] After 5100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2341 ms.
[2024-05-22 12:35:17] [INFO ] After 12988ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 7 ms.
Support contains 199 out of 2137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2137/2137 places, 7849/7849 transitions.
Graph (trivial) has 98 edges and 2137 vertex of which 2 / 2137 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2136 transition count 7846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 2135 transition count 7846
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 2135 transition count 7843
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 2132 transition count 7843
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 2132 transition count 7841
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 2131 transition count 7839
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 2131 transition count 7839
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 27 place count 2124 transition count 7832
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 8530 edges and 2124 vertex of which 2121 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 3 with 13 rules applied. Total rules applied 40 place count 2121 transition count 7819
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 55 place count 2121 transition count 7804
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 71 place count 2105 transition count 7753
Iterating global reduction 5 with 16 rules applied. Total rules applied 87 place count 2105 transition count 7753
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 91 place count 2103 transition count 7770
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 100 place count 2103 transition count 7761
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 103 place count 2103 transition count 7758
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 104 place count 2102 transition count 7750
Iterating global reduction 6 with 1 rules applied. Total rules applied 105 place count 2102 transition count 7750
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 114 place count 2102 transition count 7741
Free-agglomeration rule applied 12 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 126 place count 2102 transition count 7727
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 139 transitions.
Graph (complete) has 8283 edges and 2090 vertex of which 2069 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.4 ms
Discarding 21 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Iterating post reduction 7 with 152 rules applied. Total rules applied 278 place count 2069 transition count 7572
Drop transitions removed 46 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 8 with 70 rules applied. Total rules applied 348 place count 2069 transition count 7502
Discarding 122 places :
Symmetric choice reduction at 9 with 122 rule applications. Total rules 470 place count 1947 transition count 7237
Iterating global reduction 9 with 122 rules applied. Total rules applied 592 place count 1947 transition count 7237
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 598 place count 1944 transition count 7255
Applied a total of 598 rules in 1584 ms. Remains 1944 /2137 variables (removed 193) and now considering 7255/7849 (removed 594) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1584 ms. Remains : 1944/2137 places, 7255/7849 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1169 ms. (steps per millisecond=8 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 84917 steps, run timeout after 3002 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84917 steps, saw 81992 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-22 12:35:23] [INFO ] Flow matrix only has 1795 transitions (discarded 5460 similar events)
// Phase 1: matrix 1795 rows 1944 cols
[2024-05-22 12:35:23] [INFO ] Computed 1396 invariants in 16 ms
[2024-05-22 12:35:24] [INFO ] After 525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 12:35:25] [INFO ] [Nat]Absence check using 1396 positive place invariants in 741 ms returned sat
[2024-05-22 12:35:28] [INFO ] After 3102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 12:35:28] [INFO ] State equation strengthened by 579 read => feed constraints.
[2024-05-22 12:35:31] [INFO ] After 2892ms SMT Verify possible using 579 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 12:35:34] [INFO ] After 5916ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2047 ms.
[2024-05-22 12:35:36] [INFO ] After 12719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 199 out of 1944 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1944/1944 places, 7255/7255 transitions.
Applied a total of 0 rules in 202 ms. Remains 1944 /1944 variables (removed 0) and now considering 7255/7255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 1944/1944 places, 7255/7255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1944/1944 places, 7255/7255 transitions.
Applied a total of 0 rules in 204 ms. Remains 1944 /1944 variables (removed 0) and now considering 7255/7255 (removed 0) transitions.
[2024-05-22 12:35:37] [INFO ] Flow matrix only has 1795 transitions (discarded 5460 similar events)
[2024-05-22 12:35:37] [INFO ] Invariant cache hit.
[2024-05-22 12:35:43] [INFO ] Implicit Places using invariants in 5765 ms returned [152, 161, 218, 394, 569, 768, 970, 1106, 1217, 1319, 1509, 1527, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1703, 1704, 1705, 1706, 1707, 1711, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1720, 1723, 1724, 1725, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1738, 1739, 1740, 1741, 1742, 1743, 1747, 1748, 1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1768, 1769, 1770, 1771, 1776, 1777, 1778, 1779, 1780, 1781, 1782, 1783, 1784, 1785, 1788, 1789, 1790, 1791, 1792, 1793, 1794, 1799, 1800, 1801, 1802, 1803, 1804, 1805, 1806, 1807, 1808, 1809, 1810, 1811, 1812, 1813, 1814, 1815, 1816, 1817, 1818, 1819, 1820, 1821, 1822, 1823, 1824, 1827, 1828, 1829, 1830, 1831, 1832, 1833, 1834, 1835, 1836, 1837, 1838, 1839, 1840, 1841, 1842, 1843, 1844, 1845, 1846, 1849, 1850, 1854, 1855, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1863, 1864, 1865, 1866, 1867, 1868, 1869, 1870, 1871, 1872, 1873, 1874, 1875, 1876, 1877, 1878, 1879, 1880, 1881, 1882, 1883, 1884, 1885, 1886, 1887, 1888, 1889, 1890, 1891, 1898, 1899, 1900, 1901, 1902, 1903, 1904, 1905, 1908, 1909, 1910, 1911, 1912, 1913, 1914, 1915, 1916, 1917, 1918, 1919, 1920, 1921, 1922, 1925, 1926, 1927, 1928, 1929, 1930, 1931, 1938, 1939, 1940, 1941, 1942, 1943]
Discarding 211 places :
Ensure Unique test removed 492 transitions
Reduce isomorphic transitions removed 492 transitions.
Implicit Place search using SMT only with invariants took 5781 ms to find 211 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1733/1944 places, 6763/7255 transitions.
Graph (trivial) has 263 edges and 1733 vertex of which 151 / 1733 are part of one of the 68 SCC in 2 ms
Free SCC test removed 83 places
Drop transitions removed 1886 transitions
Ensure Unique test removed 220 transitions
Reduce isomorphic transitions removed 2106 transitions.
Graph (complete) has 5181 edges and 1650 vertex of which 1569 are kept as prefixes of interest. Removing 81 places using SCC suffix rule.4 ms
Discarding 81 places :
Also discarding 0 output transitions
Drop transitions removed 30 transitions
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 1569 transition count 4550
Discarding 416 places :
Symmetric choice reduction at 1 with 416 rule applications. Total rules 525 place count 1153 transition count 3437
Iterating global reduction 1 with 416 rules applied. Total rules applied 941 place count 1153 transition count 3437
Performed 4 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 949 place count 1149 transition count 3431
Drop transitions removed 4 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 960 place count 1149 transition count 3420
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 964 place count 1145 transition count 3412
Iterating global reduction 2 with 4 rules applied. Total rules applied 968 place count 1145 transition count 3412
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 978 place count 1140 transition count 3438
Drop transitions removed 1994 transitions
Redundant transition composition rules discarded 1994 transitions
Iterating global reduction 2 with 1994 rules applied. Total rules applied 2972 place count 1140 transition count 1444
Reduce places removed 362 places and 0 transitions.
Graph (complete) has 2137 edges and 778 vertex of which 646 are kept as prefixes of interest. Removing 132 places using SCC suffix rule.1 ms
Discarding 132 places :
Also discarding 32 output transitions
Drop transitions removed 32 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 2 with 364 rules applied. Total rules applied 3336 place count 646 transition count 1411
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 104 transitions
Ensure Unique test removed 203 transitions
Reduce isomorphic transitions removed 307 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 309 rules applied. Total rules applied 3645 place count 645 transition count 1103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3646 place count 644 transition count 1103
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 3646 place count 644 transition count 1091
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 3670 place count 632 transition count 1091
Discarding 45 places :
Symmetric choice reduction at 5 with 45 rule applications. Total rules 3715 place count 587 transition count 1032
Iterating global reduction 5 with 45 rules applied. Total rules applied 3760 place count 587 transition count 1032
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3762 place count 587 transition count 1030
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 3776 place count 580 transition count 1023
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1668 edges and 580 vertex of which 577 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 10 rules applied. Total rules applied 3786 place count 577 transition count 1014
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 3806 place count 567 transition count 1054
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 3807 place count 567 transition count 1053
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3807 place count 567 transition count 1052
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3809 place count 566 transition count 1052
Free-agglomeration rule applied 12 times.
Iterating global reduction 7 with 12 rules applied. Total rules applied 3821 place count 566 transition count 1040
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1620 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 16 rules applied. Total rules applied 3837 place count 553 transition count 1037
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 3838 place count 553 transition count 1036
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 3851 place count 553 transition count 1036
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 3857 place count 553 transition count 1030
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 3869 place count 547 transition count 1024
Applied a total of 3869 rules in 614 ms. Remains 547 /1733 variables (removed 1186) and now considering 1024/6763 (removed 5739) transitions.
[2024-05-22 12:35:43] [INFO ] Flow matrix only has 997 transitions (discarded 27 similar events)
// Phase 1: matrix 997 rows 547 cols
[2024-05-22 12:35:43] [INFO ] Computed 215 invariants in 6 ms
[2024-05-22 12:35:44] [INFO ] Implicit Places using invariants in 466 ms returned [1, 27, 30, 51, 52, 59, 60, 67, 68, 77, 86, 87, 92, 93, 99, 102, 107, 113, 118, 119, 120, 126, 129]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 471 ms to find 23 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 524/1944 places, 1024/7255 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 524 transition count 1015
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 515 transition count 1015
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 515 transition count 1013
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 22 place count 513 transition count 1013
Performed 20 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 62 place count 493 transition count 976
Drop transitions removed 23 transitions
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 2 with 57 rules applied. Total rules applied 119 place count 493 transition count 919
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 132 place count 480 transition count 890
Iterating global reduction 3 with 13 rules applied. Total rules applied 145 place count 480 transition count 890
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 478 transition count 888
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 151 place count 477 transition count 890
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 167 place count 477 transition count 874
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 174 place count 470 transition count 874
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 175 place count 470 transition count 873
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 176 place count 469 transition count 873
Applied a total of 176 rules in 179 ms. Remains 469 /524 variables (removed 55) and now considering 873/1024 (removed 151) transitions.
[2024-05-22 12:35:44] [INFO ] Flow matrix only has 849 transitions (discarded 24 similar events)
// Phase 1: matrix 849 rows 469 cols
[2024-05-22 12:35:44] [INFO ] Computed 172 invariants in 4 ms
[2024-05-22 12:35:44] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-22 12:35:44] [INFO ] Flow matrix only has 849 transitions (discarded 24 similar events)
[2024-05-22 12:35:44] [INFO ] Invariant cache hit.
[2024-05-22 12:35:45] [INFO ] State equation strengthened by 139 read => feed constraints.
[2024-05-22 12:35:45] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 469/1944 places, 873/7255 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8482 ms. Remains : 469/1944 places, 873/7255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 4) seen :1
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 12:35:46] [INFO ] Flow matrix only has 849 transitions (discarded 24 similar events)
[2024-05-22 12:35:46] [INFO ] Invariant cache hit.
[2024-05-22 12:35:46] [INFO ] [Real]Absence check using 172 positive place invariants in 73 ms returned sat
[2024-05-22 12:35:46] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 12:35:46] [INFO ] [Nat]Absence check using 172 positive place invariants in 73 ms returned sat
[2024-05-22 12:35:47] [INFO ] After 812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 12:35:47] [INFO ] State equation strengthened by 139 read => feed constraints.
[2024-05-22 12:35:47] [INFO ] After 381ms SMT Verify possible using 139 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 12:35:48] [INFO ] After 839ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 381 ms.
[2024-05-22 12:35:48] [INFO ] After 2312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 120 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 873/873 transitions.
Graph (trivial) has 163 edges and 469 vertex of which 71 / 469 are part of one of the 27 SCC in 0 ms
Free SCC test removed 44 places
Drop transitions removed 85 transitions
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 196 transitions.
Graph (complete) has 1115 edges and 425 vertex of which 370 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Discarding 55 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 16 rules applied. Total rules applied 18 place count 370 transition count 623
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 23 place count 365 transition count 623
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 23 place count 365 transition count 603
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 63 place count 345 transition count 603
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 78 place count 345 transition count 588
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 84 place count 339 transition count 574
Iterating global reduction 3 with 6 rules applied. Total rules applied 90 place count 339 transition count 574
Performed 8 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
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 106 place count 331 transition count 562
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 112 place count 331 transition count 556
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 330 transition count 554
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 330 transition count 554
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 118 place count 328 transition count 566
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 120 place count 328 transition count 564
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 147 place count 328 transition count 537
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 157 place count 318 transition count 537
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 161 place count 318 transition count 533
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 169 place count 314 transition count 529
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 170 place count 313 transition count 528
Iterating global reduction 7 with 1 rules applied. Total rules applied 171 place count 313 transition count 528
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 176 place count 313 transition count 523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 177 place count 312 transition count 523
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 178 place count 311 transition count 522
Iterating global reduction 8 with 1 rules applied. Total rules applied 179 place count 311 transition count 522
Applied a total of 179 rules in 155 ms. Remains 311 /469 variables (removed 158) and now considering 522/873 (removed 351) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 311/469 places, 522/873 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 3) seen :1
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-22 12:35:49] [INFO ] Flow matrix only has 511 transitions (discarded 11 similar events)
// Phase 1: matrix 511 rows 311 cols
[2024-05-22 12:35:49] [INFO ] Computed 121 invariants in 2 ms
[2024-05-22 12:35:49] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 12:35:49] [INFO ] [Nat]Absence check using 121 positive place invariants in 57 ms returned sat
[2024-05-22 12:35:50] [INFO ] After 517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 12:35:50] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-22 12:35:50] [INFO ] After 263ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 12:35:50] [INFO ] After 533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 232 ms.
[2024-05-22 12:35:51] [INFO ] After 1482ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 113 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 522/522 transitions.
Graph (trivial) has 24 edges and 311 vertex of which 9 / 311 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 809 edges and 306 vertex of which 302 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 2 place count 302 transition count 499
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 300 transition count 499
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 300 transition count 496
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 300 transition count 491
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 298 transition count 491
Applied a total of 16 rules in 41 ms. Remains 298 /311 variables (removed 13) and now considering 491/522 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 298/311 places, 491/522 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 165261 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 165261 steps, saw 155098 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 12:35:54] [INFO ] Flow matrix only has 482 transitions (discarded 9 similar events)
// Phase 1: matrix 482 rows 298 cols
[2024-05-22 12:35:54] [INFO ] Computed 116 invariants in 2 ms
[2024-05-22 12:35:54] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 12:35:55] [INFO ] [Nat]Absence check using 116 positive place invariants in 49 ms returned sat
[2024-05-22 12:35:55] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 12:35:55] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-22 12:35:55] [INFO ] After 251ms SMT Verify possible using 95 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 12:35:56] [INFO ] After 496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 215 ms.
[2024-05-22 12:35:56] [INFO ] After 1364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 113 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 491/491 transitions.
Applied a total of 0 rules in 9 ms. Remains 298 /298 variables (removed 0) and now considering 491/491 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 298/298 places, 491/491 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 491/491 transitions.
Applied a total of 0 rules in 9 ms. Remains 298 /298 variables (removed 0) and now considering 491/491 (removed 0) transitions.
[2024-05-22 12:35:56] [INFO ] Flow matrix only has 482 transitions (discarded 9 similar events)
[2024-05-22 12:35:56] [INFO ] Invariant cache hit.
[2024-05-22 12:35:56] [INFO ] Implicit Places using invariants in 202 ms returned [33, 40, 75, 131]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 204 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 294/298 places, 491/491 transitions.
Graph (trivial) has 16 edges and 294 vertex of which 2 / 294 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 768 edges and 293 vertex of which 291 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 291 transition count 477
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 288 transition count 474
Drop transitions removed 3 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 30 place count 288 transition count 462
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 287 transition count 461
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 287 transition count 455
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 41 place count 284 transition count 455
Applied a total of 41 rules in 33 ms. Remains 284 /294 variables (removed 10) and now considering 455/491 (removed 36) transitions.
[2024-05-22 12:35:56] [INFO ] Flow matrix only has 448 transitions (discarded 7 similar events)
// Phase 1: matrix 448 rows 284 cols
[2024-05-22 12:35:56] [INFO ] Computed 108 invariants in 1 ms
[2024-05-22 12:35:56] [INFO ] Implicit Places using invariants in 130 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 283/298 places, 455/491 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 454
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 282 transition count 451
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 282 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 281 transition count 448
Applied a total of 9 rules in 22 ms. Remains 281 /283 variables (removed 2) and now considering 448/455 (removed 7) transitions.
[2024-05-22 12:35:56] [INFO ] Flow matrix only has 441 transitions (discarded 7 similar events)
// Phase 1: matrix 441 rows 281 cols
[2024-05-22 12:35:56] [INFO ] Computed 106 invariants in 1 ms
[2024-05-22 12:35:56] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-22 12:35:56] [INFO ] Flow matrix only has 441 transitions (discarded 7 similar events)
[2024-05-22 12:35:56] [INFO ] Invariant cache hit.
[2024-05-22 12:35:57] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-22 12:35:57] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 281/298 places, 448/491 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 834 ms. Remains : 281/298 places, 448/491 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 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
Interrupted probabilistic random walk after 290232 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 290232 steps, saw 271674 distinct states, run finished after 3002 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 12:36:00] [INFO ] Flow matrix only has 441 transitions (discarded 7 similar events)
[2024-05-22 12:36:00] [INFO ] Invariant cache hit.
[2024-05-22 12:36:00] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 12:36:00] [INFO ] [Nat]Absence check using 106 positive place invariants in 27 ms returned sat
[2024-05-22 12:36:00] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 12:36:00] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-22 12:36:01] [INFO ] After 169ms SMT Verify possible using 83 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 12:36:01] [INFO ] After 363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 166 ms.
[2024-05-22 12:36:01] [INFO ] After 971ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 113 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 448/448 transitions.
Applied a total of 0 rules in 9 ms. Remains 281 /281 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 281/281 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 448/448 transitions.
Applied a total of 0 rules in 9 ms. Remains 281 /281 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2024-05-22 12:36:01] [INFO ] Flow matrix only has 441 transitions (discarded 7 similar events)
[2024-05-22 12:36:01] [INFO ] Invariant cache hit.
[2024-05-22 12:36:01] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 12:36:01] [INFO ] Flow matrix only has 441 transitions (discarded 7 similar events)
[2024-05-22 12:36:01] [INFO ] Invariant cache hit.
[2024-05-22 12:36:01] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-22 12:36:02] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2024-05-22 12:36:02] [INFO ] Redundant transitions in 51 ms returned []
[2024-05-22 12:36:02] [INFO ] Flow matrix only has 441 transitions (discarded 7 similar events)
[2024-05-22 12:36:02] [INFO ] Invariant cache hit.
[2024-05-22 12:36:02] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1227 ms. Remains : 281/281 places, 448/448 transitions.
Graph (trivial) has 58 edges and 281 vertex of which 36 / 281 are part of one of the 18 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions removed 38 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 71 transitions.
Graph (complete) has 557 edges and 263 vertex of which 259 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 259 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 258 transition count 376
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 13 place count 249 transition count 360
Iterating global reduction 2 with 9 rules applied. Total rules applied 22 place count 249 transition count 360
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 32 place count 244 transition count 355
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 34 place count 243 transition count 357
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 62 place count 243 transition count 329
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 12 rules applied. Total rules applied 74 place count 234 transition count 326
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 77 place count 231 transition count 326
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 78 place count 230 transition count 325
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 230 transition count 325
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 80 place count 230 transition count 324
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 91 place count 230 transition count 324
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 93 place count 230 transition count 322
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 94 place count 229 transition count 320
Iterating global reduction 6 with 1 rules applied. Total rules applied 95 place count 229 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 96 place count 229 transition count 319
Applied a total of 96 rules in 48 ms. Remains 229 /281 variables (removed 52) and now considering 319/448 (removed 129) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 319 rows 229 cols
[2024-05-22 12:36:02] [INFO ] Computed 87 invariants in 2 ms
[2024-05-22 12:36:02] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 12:36:02] [INFO ] [Nat]Absence check using 87 positive place invariants in 21 ms returned sat
[2024-05-22 12:36:03] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 12:36:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 12:36:03] [INFO ] After 123ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 12:36:03] [INFO ] After 330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 188 ms.
[2024-05-22 12:36:03] [INFO ] After 821ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-22 12:36:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-05-22 12:36:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 281 places, 448 transitions and 1949 arcs took 5 ms.
[2024-05-22 12:36:04] [INFO ] Flatten gal took : 156 ms
Total runtime 232139 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DLCflexbar-PT-7b
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/363
ReachabilityFireability
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-2024-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-2024-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1716381366112
--------------------
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 ReachabilityFireability -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/363/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/363/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/363/ReachabilityFireability.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: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: LAUNCH task # 11 (type EXCL) for 0 DLCflexbar-PT-7b-ReachabilityFireability-2024-12
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 0 DLCflexbar-PT-7b-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 0 DLCflexbar-PT-7b-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type SRCH) for 0 DLCflexbar-PT-7b-ReachabilityFireability-2024-12
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: FINISHED task # 10 (type SRCH) for DLCflexbar-PT-7b-ReachabilityFireability-2024-12
lola: result : true
lola: markings : 14
lola: fired transitions : 13
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 7 (type FNDP) for DLCflexbar-PT-7b-ReachabilityFireability-2024-12 (obsolete)
lola: CANCELED task # 8 (type EQUN) for DLCflexbar-PT-7b-ReachabilityFireability-2024-12 (obsolete)
lola: CANCELED task # 11 (type EXCL) for DLCflexbar-PT-7b-ReachabilityFireability-2024-12 (obsolete)
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: LAUNCH task # 18 (type EXCL) for 3 DLCflexbar-PT-7b-ReachabilityFireability-2024-13
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 14 (type FNDP) for 3 DLCflexbar-PT-7b-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type EQUN) for 3 DLCflexbar-PT-7b-ReachabilityFireability-2024-13
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 # 17 (type SRCH) for 3 DLCflexbar-PT-7b-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 18 (type EXCL) for DLCflexbar-PT-7b-ReachabilityFireability-2024-13
lola: result : true
lola: markings : 30
lola: fired transitions : 33
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 14 (type FNDP) for DLCflexbar-PT-7b-ReachabilityFireability-2024-13 (obsolete)
lola: CANCELED task # 15 (type EQUN) for DLCflexbar-PT-7b-ReachabilityFireability-2024-13 (obsolete)
lola: CANCELED task # 17 (type SRCH) for DLCflexbar-PT-7b-ReachabilityFireability-2024-13 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DLCflexbar-PT-7b-ReachabilityFireability-2024-12: AG false tandem / insertion
DLCflexbar-PT-7b-ReachabilityFireability-2024-13: AG false tandem / relaxed
Time elapsed: 1 secs. Pages in use: 2
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-7b"
export BK_EXAMINATION="ReachabilityFireability"
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-7b, examination is ReachabilityFireability"
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-171624288300060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCflexbar-PT-7b.tgz
mv DLCflexbar-PT-7b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;