Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r233-tall-167856419400782.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is MultiCrashLeafsetExtension-PT-S16C06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419400782
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 13K Feb 26 03:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 03:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 03:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Feb 26 03:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 03:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 03:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.2M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679611646911

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 22:47:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 22:47:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 22:47:28] [INFO ] Load time of PNML (sax parser for PT used): 270 ms
[2023-03-23 22:47:28] [INFO ] Transformed 5568 places.
[2023-03-23 22:47:28] [INFO ] Transformed 7799 transitions.
[2023-03-23 22:47:28] [INFO ] Parsed PT model containing 5568 places and 7799 transitions and 29646 arcs in 439 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 161 resets, run finished after 551 ms. (steps per millisecond=18 ) properties (out of 16) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 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 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 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 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 26216 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26216 steps, saw 12498 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-23 22:47:32] [INFO ] Flow matrix only has 7527 transitions (discarded 272 similar events)
// Phase 1: matrix 7527 rows 5568 cols
[2023-03-23 22:47:33] [INFO ] Computed 573 place invariants in 362 ms
[2023-03-23 22:47:35] [INFO ] After 1843ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-23 22:47:36] [INFO ] [Nat]Absence check using 50 positive place invariants in 32 ms returned sat
[2023-03-23 22:47:37] [INFO ] [Nat]Absence check using 50 positive and 523 generalized place invariants in 263 ms returned sat
[2023-03-23 22:47:46] [INFO ] After 9188ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :3
[2023-03-23 22:47:46] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 22:47:52] [INFO ] After 5726ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :12 sat :3
[2023-03-23 22:48:00] [INFO ] Deduced a trap composed of 783 places in 6187 ms of which 17 ms to minimize.
[2023-03-23 22:48:00] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 6442 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-23 22:48:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 22:48:00] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 86 out of 5568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Graph (complete) has 17461 edges and 5568 vertex of which 5537 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.24 ms
Discarding 31 places :
Also discarding 0 output transitions
Drop transitions removed 1564 transitions
Trivial Post-agglo rules discarded 1564 transitions
Performed 1564 trivial Post agglomeration. Transition count delta: 1564
Iterating post reduction 0 with 1564 rules applied. Total rules applied 1565 place count 5537 transition count 6235
Reduce places removed 1564 places and 0 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Iterating post reduction 1 with 1613 rules applied. Total rules applied 3178 place count 3973 transition count 6186
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 3227 place count 3924 transition count 6186
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 197 Pre rules applied. Total rules applied 3227 place count 3924 transition count 5989
Deduced a syphon composed of 197 places in 5 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 3 with 394 rules applied. Total rules applied 3621 place count 3727 transition count 5989
Discarding 1381 places :
Symmetric choice reduction at 3 with 1381 rule applications. Total rules 5002 place count 2346 transition count 4608
Iterating global reduction 3 with 1381 rules applied. Total rules applied 6383 place count 2346 transition count 4608
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6383 place count 2346 transition count 4607
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6385 place count 2345 transition count 4607
Discarding 191 places :
Symmetric choice reduction at 3 with 191 rule applications. Total rules 6576 place count 2154 transition count 3461
Iterating global reduction 3 with 191 rules applied. Total rules applied 6767 place count 2154 transition count 3461
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 6801 place count 2137 transition count 3444
Free-agglomeration rule (complex) applied 190 times.
Iterating global reduction 3 with 190 rules applied. Total rules applied 6991 place count 2137 transition count 4009
Reduce places removed 190 places and 0 transitions.
Iterating post reduction 3 with 190 rules applied. Total rules applied 7181 place count 1947 transition count 4009
Partial Free-agglomeration rule applied 184 times.
Drop transitions removed 184 transitions
Iterating global reduction 4 with 184 rules applied. Total rules applied 7365 place count 1947 transition count 4009
Applied a total of 7365 rules in 2222 ms. Remains 1947 /5568 variables (removed 3621) and now considering 4009/7799 (removed 3790) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2236 ms. Remains : 1947/5568 places, 4009/7799 transitions.
Incomplete random walk after 10000 steps, including 256 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 3) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 22:48:02] [INFO ] Flow matrix only has 3614 transitions (discarded 395 similar events)
// Phase 1: matrix 3614 rows 1947 cols
[2023-03-23 22:48:02] [INFO ] Computed 542 place invariants in 55 ms
[2023-03-23 22:48:03] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 22:48:03] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2023-03-23 22:48:03] [INFO ] [Nat]Absence check using 31 positive and 511 generalized place invariants in 113 ms returned sat
[2023-03-23 22:48:05] [INFO ] After 1563ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 22:48:05] [INFO ] State equation strengthened by 1978 read => feed constraints.
[2023-03-23 22:48:06] [INFO ] After 956ms SMT Verify possible using 1978 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 22:48:07] [INFO ] Deduced a trap composed of 259 places in 1329 ms of which 2 ms to minimize.
[2023-03-23 22:48:09] [INFO ] Deduced a trap composed of 186 places in 1315 ms of which 2 ms to minimize.
[2023-03-23 22:48:11] [INFO ] Deduced a trap composed of 329 places in 1342 ms of which 2 ms to minimize.
[2023-03-23 22:48:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4838 ms
[2023-03-23 22:48:11] [INFO ] After 6374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 313 ms.
[2023-03-23 22:48:12] [INFO ] After 8797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 18 out of 1947 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1947/1947 places, 4009/4009 transitions.
Graph (complete) has 15555 edges and 1947 vertex of which 1946 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 1946 transition count 3993
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 1930 transition count 3993
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 33 place count 1930 transition count 3988
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 43 place count 1925 transition count 3988
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 49 place count 1919 transition count 3982
Iterating global reduction 2 with 6 rules applied. Total rules applied 55 place count 1919 transition count 3982
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 2 with 19 rules applied. Total rules applied 74 place count 1919 transition count 4128
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 93 place count 1900 transition count 4128
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 102 place count 1891 transition count 4119
Iterating global reduction 3 with 9 rules applied. Total rules applied 111 place count 1891 transition count 4119
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 133 place count 1891 transition count 4119
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 153 place count 1871 transition count 4099
Iterating global reduction 3 with 20 rules applied. Total rules applied 173 place count 1871 transition count 4099
Applied a total of 173 rules in 541 ms. Remains 1871 /1947 variables (removed 76) and now considering 4099/4009 (removed -90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 542 ms. Remains : 1871/1947 places, 4099/4009 transitions.
Incomplete random walk after 10000 steps, including 264 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 57933 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57933 steps, saw 25887 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 22:48:15] [INFO ] Flow matrix only has 3701 transitions (discarded 398 similar events)
// Phase 1: matrix 3701 rows 1871 cols
[2023-03-23 22:48:15] [INFO ] Computed 541 place invariants in 58 ms
[2023-03-23 22:48:16] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 22:48:16] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2023-03-23 22:48:16] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 104 ms returned sat
[2023-03-23 22:48:18] [INFO ] After 1625ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 22:48:18] [INFO ] State equation strengthened by 2143 read => feed constraints.
[2023-03-23 22:48:18] [INFO ] After 703ms SMT Verify possible using 2143 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 22:48:20] [INFO ] Deduced a trap composed of 250 places in 1333 ms of which 2 ms to minimize.
[2023-03-23 22:48:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1766 ms
[2023-03-23 22:48:21] [INFO ] After 2939ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 354 ms.
[2023-03-23 22:48:21] [INFO ] After 5356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 18 out of 1871 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1871/1871 places, 4099/4099 transitions.
Applied a total of 0 rules in 126 ms. Remains 1871 /1871 variables (removed 0) and now considering 4099/4099 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 1871/1871 places, 4099/4099 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1871/1871 places, 4099/4099 transitions.
Applied a total of 0 rules in 116 ms. Remains 1871 /1871 variables (removed 0) and now considering 4099/4099 (removed 0) transitions.
[2023-03-23 22:48:21] [INFO ] Flow matrix only has 3701 transitions (discarded 398 similar events)
[2023-03-23 22:48:21] [INFO ] Invariant cache hit.
[2023-03-23 22:48:25] [INFO ] Implicit Places using invariants in 4035 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 84, 98, 99, 100, 101, 102, 103, 104, 116, 126, 134, 140, 144, 146, 161, 167, 169, 170, 171, 172, 173, 174, 175, 177, 181, 187, 195, 205, 217, 230, 242, 243, 244, 245, 246, 247, 248, 258, 266, 272, 276, 278, 280, 295, 301, 303, 304, 305, 306, 307, 309, 311, 313, 317, 324, 332, 342, 353, 363, 364, 365, 366, 367, 368, 369, 377, 383, 387, 389, 391, 393, 408, 414, 416, 417, 418, 419, 420, 421, 422, 424, 426, 428, 432, 438, 446, 455, 463, 464, 465, 466, 467, 468, 469, 475, 479, 481, 483, 485, 487, 502, 508, 510, 511, 512, 513, 514, 515, 516, 518, 520, 522, 524, 528, 534, 541, 547, 548, 549, 550, 551, 552, 553, 557, 559, 561, 563, 565, 567, 582, 588, 591, 592, 593, 594, 595, 596, 599, 601, 603, 605, 607, 611, 616, 621, 622, 623, 624, 625, 626, 628, 630, 632, 634, 637, 639, 654, 660, 662, 663, 664, 665, 667, 668, 670, 673, 675, 677, 679, 681, 684, 686, 687, 688, 689, 690, 691, 692, 694, 696, 698, 700, 702, 704, 719, 725, 727, 728, 729, 730, 731, 732, 733, 735, 737, 739, 741, 743, 745, 747, 749, 750, 751, 752, 753, 754, 755, 757, 759, 761, 763, 765, 767, 782, 784, 787, 789, 790, 791, 792, 793, 794, 795, 797, 799, 801, 803, 805, 807, 809, 812, 813, 814, 815, 816, 817, 818, 820, 822, 824, 826, 828, 830, 845, 851, 853, 856, 857, 858, 859, 861, 865, 867, 871, 873, 875, 877, 879, 880, 881, 882, 883, 884, 885, 887, 889, 891, 893, 895, 897, 912, 918, 920, 921, 922, 924, 926, 928, 930, 932, 935, 938, 940, 942, 945, 946, 947, 948, 949, 950, 951, 953, 955, 957, 959, 961, 963, 978, 984, 988, 989, 990, 991, 992, 993, 996, 998, 1000, 1002, 1004, 1006, 1010, 1015, 1016, 1017, 1018, 1019, 1020, 1021, 1025, 1027, 1029, 1031, 1033, 1035, 1050, 1056, 1058, 1059, 1060, 1061, 1062, 1063, 1064, 1066, 1068, 1070, 1072, 1074, 1078, 1084, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1103, 1107, 1109, 1111, 1113, 1115, 1131, 1137, 1139, 1140, 1141, 1142, 1143, 1144, 1145, 1147, 1149, 1151, 1153, 1157, 1163, 1171, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1194, 1200, 1204, 1206, 1208, 1210, 1225, 1231, 1233, 1234, 1235, 1236, 1238, 1239, 1242, 1244, 1246, 1250, 1256, 1264, 1274, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1301, 1309, 1315, 1319, 1321, 1323, 1339, 1345, 1347, 1349, 1350, 1351, 1352, 1353, 1356, 1358, 1362, 1368, 1377, 1387, 1399, 1412, 1413, 1414, 1415, 1416, 1417, 1418, 1430, 1440, 1448, 1454, 1458, 1460, 1475, 1477, 1480, 1482, 1483, 1484, 1485, 1487, 1488, 1490, 1494, 1500, 1508, 1518, 1530, 1545, 1560, 1561, 1562, 1563, 1564, 1565, 1566, 1580, 1592, 1602, 1610, 1616, 1620, 1635]
Discarding 484 places :
Implicit Place search using SMT only with invariants took 4048 ms to find 484 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1387/1871 places, 4099/4099 transitions.
Discarding 179 places :
Symmetric choice reduction at 0 with 179 rule applications. Total rules 179 place count 1208 transition count 3920
Iterating global reduction 0 with 179 rules applied. Total rules applied 358 place count 1208 transition count 3920
Discarding 178 places :
Symmetric choice reduction at 0 with 178 rule applications. Total rules 536 place count 1030 transition count 3742
Iterating global reduction 0 with 178 rules applied. Total rules applied 714 place count 1030 transition count 3742
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 716 place count 1030 transition count 3740
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 718 place count 1028 transition count 3740
Applied a total of 718 rules in 252 ms. Remains 1028 /1387 variables (removed 359) and now considering 3740/4099 (removed 359) transitions.
[2023-03-23 22:48:26] [INFO ] Flow matrix only has 3342 transitions (discarded 398 similar events)
// Phase 1: matrix 3342 rows 1028 cols
[2023-03-23 22:48:26] [INFO ] Computed 57 place invariants in 27 ms
[2023-03-23 22:48:27] [INFO ] Implicit Places using invariants in 1218 ms returned []
[2023-03-23 22:48:27] [INFO ] Flow matrix only has 3342 transitions (discarded 398 similar events)
[2023-03-23 22:48:27] [INFO ] Invariant cache hit.
[2023-03-23 22:48:28] [INFO ] State equation strengthened by 2143 read => feed constraints.
[2023-03-23 22:48:45] [INFO ] Implicit Places using invariants and state equation in 18467 ms returned []
Implicit Place search using SMT with State Equation took 19689 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1028/1871 places, 3740/4099 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 24105 ms. Remains : 1028/1871 places, 3740/4099 transitions.
Incomplete random walk after 10000 steps, including 273 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 67172 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67172 steps, saw 28199 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 22:48:49] [INFO ] Flow matrix only has 3342 transitions (discarded 398 similar events)
[2023-03-23 22:48:49] [INFO ] Invariant cache hit.
[2023-03-23 22:48:49] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 22:48:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 22:48:49] [INFO ] [Nat]Absence check using 31 positive and 26 generalized place invariants in 6 ms returned sat
[2023-03-23 22:48:50] [INFO ] After 1228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 22:48:50] [INFO ] State equation strengthened by 2143 read => feed constraints.
[2023-03-23 22:48:51] [INFO ] After 819ms SMT Verify possible using 2143 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 22:48:51] [INFO ] After 1191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 225 ms.
[2023-03-23 22:48:52] [INFO ] After 2848ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 18 out of 1028 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1028/1028 places, 3740/3740 transitions.
Applied a total of 0 rules in 93 ms. Remains 1028 /1028 variables (removed 0) and now considering 3740/3740 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 1028/1028 places, 3740/3740 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1028/1028 places, 3740/3740 transitions.
Applied a total of 0 rules in 89 ms. Remains 1028 /1028 variables (removed 0) and now considering 3740/3740 (removed 0) transitions.
[2023-03-23 22:48:52] [INFO ] Flow matrix only has 3342 transitions (discarded 398 similar events)
[2023-03-23 22:48:52] [INFO ] Invariant cache hit.
[2023-03-23 22:48:53] [INFO ] Implicit Places using invariants in 1167 ms returned []
[2023-03-23 22:48:53] [INFO ] Flow matrix only has 3342 transitions (discarded 398 similar events)
[2023-03-23 22:48:53] [INFO ] Invariant cache hit.
[2023-03-23 22:48:54] [INFO ] State equation strengthened by 2143 read => feed constraints.
[2023-03-23 22:49:09] [INFO ] Implicit Places using invariants and state equation in 15897 ms returned []
Implicit Place search using SMT with State Equation took 17068 ms to find 0 implicit places.
[2023-03-23 22:49:09] [INFO ] Redundant transitions in 245 ms returned []
[2023-03-23 22:49:09] [INFO ] Flow matrix only has 3342 transitions (discarded 398 similar events)
[2023-03-23 22:49:09] [INFO ] Invariant cache hit.
[2023-03-23 22:49:10] [INFO ] Dead Transitions using invariants and state equation in 1342 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18760 ms. Remains : 1028/1028 places, 3740/3740 transitions.
Graph (trivial) has 1066 edges and 1028 vertex of which 17 / 1028 are part of one of the 1 SCC in 3 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4436 edges and 1012 vertex of which 998 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 981 transition count 2971
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 884 transition count 2778
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 788 transition count 2610
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 716 transition count 2468
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 646 transition count 2348
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 596 transition count 2250
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 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 6 with 127 rules applied. Total rules applied 1334 place count 548 transition count 2171
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 7 with 91 rules applied. Total rules applied 1425 place count 517 transition count 2111
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 75 rules applied. Total rules applied 1500 place count 488 transition count 2065
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 9 with 49 rules applied. Total rules applied 1549 place count 471 transition count 2033
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 38 rules applied. Total rules applied 1587 place count 456 transition count 2010
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1609 place count 448 transition count 1996
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 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 12 with 14 rules applied. Total rules applied 1623 place count 442 transition count 1988
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1628 place count 440 transition count 1985
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1630 place count 439 transition count 1984
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 24 Pre rules applied. Total rules applied 1630 place count 439 transition count 1960
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 15 with 48 rules applied. Total rules applied 1678 place count 415 transition count 1960
Discarding 258 places :
Symmetric choice reduction at 15 with 258 rule applications. Total rules 1936 place count 157 transition count 522
Iterating global reduction 15 with 258 rules applied. Total rules applied 2194 place count 157 transition count 522
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Iterating post reduction 15 with 149 rules applied. Total rules applied 2343 place count 157 transition count 373
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2343 place count 157 transition count 372
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2345 place count 156 transition count 372
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 2350 place count 151 transition count 352
Iterating global reduction 16 with 5 rules applied. Total rules applied 2355 place count 151 transition count 352
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 2359 place count 147 transition count 348
Iterating global reduction 16 with 4 rules applied. Total rules applied 2363 place count 147 transition count 348
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 16 with 20 rules applied. Total rules applied 2383 place count 137 transition count 338
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 2384 place count 137 transition count 337
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 2388 place count 135 transition count 343
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2389 place count 134 transition count 337
Iterating global reduction 17 with 1 rules applied. Total rules applied 2390 place count 134 transition count 337
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 2393 place count 134 transition count 334
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 2394 place count 134 transition count 333
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 18 with 5 rules applied. Total rules applied 2399 place count 134 transition count 328
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 18 with 5 rules applied. Total rules applied 2404 place count 129 transition count 328
Partial Free-agglomeration rule applied 115 times.
Drop transitions removed 115 transitions
Iterating global reduction 19 with 115 rules applied. Total rules applied 2519 place count 129 transition count 328
Applied a total of 2519 rules in 412 ms. Remains 129 /1028 variables (removed 899) and now considering 328/3740 (removed 3412) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 328 rows 129 cols
[2023-03-23 22:49:11] [INFO ] Computed 27 place invariants in 7 ms
[2023-03-23 22:49:11] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 22:49:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 22:49:11] [INFO ] [Nat]Absence check using 3 positive and 24 generalized place invariants in 4 ms returned sat
[2023-03-23 22:49:11] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 22:49:11] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-23 22:49:11] [INFO ] After 183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-23 22:49:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-23 22:49:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1028 places, 3740 transitions and 18631 arcs took 29 ms.
[2023-03-23 22:49:12] [INFO ] Flatten gal took : 365 ms
Total runtime 103815 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/541/inv_0_ --invariant=/tmp/541/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14845796 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16086628 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C06"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C06, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856419400782"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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