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-167856419400790.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-S16C07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419400790
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 13K Feb 26 02:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 02:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 02:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K 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 5.1K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 02:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Feb 26 02:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 02:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K 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.7M 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-S16C07-ReachabilityCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679613716573

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-S16C07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 23:21:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 23:21:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 23:21:58] [INFO ] Load time of PNML (sax parser for PT used): 334 ms
[2023-03-23 23:21:58] [INFO ] Transformed 6222 places.
[2023-03-23 23:21:58] [INFO ] Transformed 8685 transitions.
[2023-03-23 23:21:58] [INFO ] Parsed PT model containing 6222 places and 8685 transitions and 32582 arcs in 440 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 137 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 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 3 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 3 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 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 22718 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22718 steps, saw 10882 distinct states, run finished after 3002 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-23 23:22:02] [INFO ] Flow matrix only has 8413 transitions (discarded 272 similar events)
// Phase 1: matrix 8413 rows 6222 cols
[2023-03-23 23:22:03] [INFO ] Computed 611 place invariants in 388 ms
[2023-03-23 23:22:05] [INFO ] After 2386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-23 23:22:07] [INFO ] [Nat]Absence check using 52 positive place invariants in 36 ms returned sat
[2023-03-23 23:22:07] [INFO ] [Nat]Absence check using 52 positive and 559 generalized place invariants in 275 ms returned sat
[2023-03-23 23:22:21] [INFO ] After 13795ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :4
[2023-03-23 23:22:21] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:22:30] [INFO ] After 8255ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :12 sat :3
[2023-03-23 23:22:30] [INFO ] After 8777ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-23 23:22:30] [INFO ] After 25064ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :2
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 5 out of 6222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6222/6222 places, 8685/8685 transitions.
Graph (complete) has 19247 edges and 6222 vertex of which 6188 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.37 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions removed 1900 transitions
Trivial Post-agglo rules discarded 1900 transitions
Performed 1900 trivial Post agglomeration. Transition count delta: 1900
Iterating post reduction 0 with 1900 rules applied. Total rules applied 1901 place count 6188 transition count 6785
Reduce places removed 1900 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1901 rules applied. Total rules applied 3802 place count 4288 transition count 6784
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3803 place count 4287 transition count 6784
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 238 Pre rules applied. Total rules applied 3803 place count 4287 transition count 6546
Deduced a syphon composed of 238 places in 6 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 3 with 476 rules applied. Total rules applied 4279 place count 4049 transition count 6546
Discarding 1662 places :
Symmetric choice reduction at 3 with 1662 rule applications. Total rules 5941 place count 2387 transition count 4884
Iterating global reduction 3 with 1662 rules applied. Total rules applied 7603 place count 2387 transition count 4884
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 7603 place count 2387 transition count 4874
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 7623 place count 2377 transition count 4874
Discarding 234 places :
Symmetric choice reduction at 3 with 234 rule applications. Total rules 7857 place count 2143 transition count 3236
Iterating global reduction 3 with 234 rules applied. Total rules applied 8091 place count 2143 transition count 3236
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 8125 place count 2126 transition count 3219
Free-agglomeration rule (complex) applied 164 times.
Iterating global reduction 3 with 164 rules applied. Total rules applied 8289 place count 2126 transition count 4459
Reduce places removed 164 places and 0 transitions.
Iterating post reduction 3 with 164 rules applied. Total rules applied 8453 place count 1962 transition count 4459
Partial Free-agglomeration rule applied 68 times.
Drop transitions removed 68 transitions
Iterating global reduction 4 with 68 rules applied. Total rules applied 8521 place count 1962 transition count 4459
Applied a total of 8521 rules in 2292 ms. Remains 1962 /6222 variables (removed 4260) and now considering 4459/8685 (removed 4226) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2294 ms. Remains : 1962/6222 places, 4459/8685 transitions.
Incomplete random walk after 10000 steps, including 229 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 23:22:33] [INFO ] Flow matrix only has 4061 transitions (discarded 398 similar events)
// Phase 1: matrix 4061 rows 1962 cols
[2023-03-23 23:22:33] [INFO ] Computed 577 place invariants in 60 ms
[2023-03-23 23:22:34] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 23:22:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-23 23:22:34] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 115 ms returned sat
[2023-03-23 23:22:36] [INFO ] After 1792ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 23:22:36] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:22:38] [INFO ] After 1886ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 23:22:44] [INFO ] Deduced a trap composed of 330 places in 1594 ms of which 12 ms to minimize.
[2023-03-23 23:22:46] [INFO ] Deduced a trap composed of 214 places in 1533 ms of which 2 ms to minimize.
[2023-03-23 23:22:48] [INFO ] Deduced a trap composed of 305 places in 1517 ms of which 6 ms to minimize.
[2023-03-23 23:22:49] [INFO ] Deduced a trap composed of 217 places in 1534 ms of which 2 ms to minimize.
[2023-03-23 23:22:51] [INFO ] Deduced a trap composed of 266 places in 1557 ms of which 2 ms to minimize.
[2023-03-23 23:22:54] [INFO ] Deduced a trap composed of 259 places in 1501 ms of which 2 ms to minimize.
[2023-03-23 23:22:56] [INFO ] Deduced a trap composed of 308 places in 1514 ms of which 2 ms to minimize.
[2023-03-23 23:22:57] [INFO ] Deduced a trap composed of 296 places in 1472 ms of which 3 ms to minimize.
[2023-03-23 23:22:59] [INFO ] Deduced a trap composed of 262 places in 1532 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
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 23:22:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 23:22:59] [INFO ] After 25628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 1962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1962/1962 places, 4459/4459 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1962 transition count 4458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1961 transition count 4458
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1961 transition count 4457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 1960 transition count 4457
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 1959 transition count 4456
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 1959 transition count 4456
Applied a total of 6 rules in 472 ms. Remains 1959 /1962 variables (removed 3) and now considering 4456/4459 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 480 ms. Remains : 1959/1962 places, 4456/4459 transitions.
Incomplete random walk after 10000 steps, including 229 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 2) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 23:23:00] [INFO ] Flow matrix only has 4058 transitions (discarded 398 similar events)
// Phase 1: matrix 4058 rows 1959 cols
[2023-03-23 23:23:00] [INFO ] Computed 577 place invariants in 51 ms
[2023-03-23 23:23:00] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:23:01] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2023-03-23 23:23:01] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 119 ms returned sat
[2023-03-23 23:23:02] [INFO ] After 1606ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 23:23:02] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:23:03] [INFO ] After 507ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 23:23:03] [INFO ] After 712ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-23 23:23:03] [INFO ] After 2854ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1959 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1959/1959 places, 4456/4456 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1959 transition count 4455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1958 transition count 4455
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1958 transition count 4453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 1956 transition count 4453
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 8 place count 1954 transition count 4451
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 1954 transition count 4451
Applied a total of 10 rules in 395 ms. Remains 1954 /1959 variables (removed 5) and now considering 4451/4456 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 1954/1959 places, 4451/4456 transitions.
Incomplete random walk after 10000 steps, including 229 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 57263 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57263 steps, saw 25512 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 23:23:07] [INFO ] Flow matrix only has 4053 transitions (discarded 398 similar events)
// Phase 1: matrix 4053 rows 1954 cols
[2023-03-23 23:23:07] [INFO ] Computed 577 place invariants in 55 ms
[2023-03-23 23:23:07] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:23:07] [INFO ] [Nat]Absence check using 33 positive place invariants in 31 ms returned sat
[2023-03-23 23:23:07] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 128 ms returned sat
[2023-03-23 23:23:09] [INFO ] After 1458ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 23:23:09] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:23:10] [INFO ] After 483ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 23:23:10] [INFO ] After 687ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-23 23:23:10] [INFO ] After 2709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1954/1954 places, 4451/4451 transitions.
Applied a total of 0 rules in 143 ms. Remains 1954 /1954 variables (removed 0) and now considering 4451/4451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 1954/1954 places, 4451/4451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1954/1954 places, 4451/4451 transitions.
Applied a total of 0 rules in 142 ms. Remains 1954 /1954 variables (removed 0) and now considering 4451/4451 (removed 0) transitions.
[2023-03-23 23:23:10] [INFO ] Flow matrix only has 4053 transitions (discarded 398 similar events)
[2023-03-23 23:23:10] [INFO ] Invariant cache hit.
[2023-03-23 23:23:15] [INFO ] Implicit Places using invariants in 4450 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 20, 26, 34, 44, 56, 70, 85, 99, 100, 101, 102, 103, 104, 105, 106, 118, 128, 136, 142, 146, 148, 165, 171, 173, 174, 175, 176, 177, 178, 179, 180, 182, 186, 192, 200, 210, 222, 235, 247, 248, 249, 250, 251, 252, 253, 254, 264, 272, 278, 282, 284, 286, 303, 309, 311, 312, 313, 314, 315, 316, 317, 318, 320, 322, 326, 332, 340, 350, 361, 371, 372, 373, 374, 375, 376, 377, 378, 386, 392, 396, 398, 400, 402, 419, 425, 427, 428, 429, 430, 431, 432, 433, 434, 436, 438, 440, 444, 450, 458, 467, 475, 476, 477, 478, 479, 480, 481, 482, 488, 492, 494, 496, 498, 500, 517, 523, 525, 526, 527, 528, 529, 530, 531, 532, 534, 536, 538, 540, 544, 550, 557, 563, 564, 565, 566, 567, 568, 569, 570, 574, 576, 578, 580, 582, 584, 601, 607, 609, 610, 611, 612, 613, 614, 615, 616, 618, 620, 622, 624, 626, 630, 635, 639, 640, 641, 642, 643, 644, 645, 646, 648, 650, 652, 654, 656, 658, 675, 681, 683, 684, 685, 686, 687, 688, 689, 690, 692, 694, 696, 698, 700, 702, 705, 707, 708, 709, 710, 711, 712, 713, 714, 716, 718, 720, 722, 724, 726, 743, 749, 751, 752, 753, 754, 755, 756, 757, 758, 760, 762, 764, 766, 768, 770, 772, 774, 775, 776, 777, 778, 779, 780, 781, 783, 785, 787, 789, 791, 793, 810, 812, 815, 817, 818, 819, 820, 821, 823, 824, 826, 828, 830, 834, 836, 838, 840, 842, 843, 844, 845, 846, 847, 848, 849, 851, 853, 855, 857, 859, 861, 878, 884, 886, 887, 888, 889, 890, 891, 892, 893, 895, 897, 899, 901, 903, 905, 907, 909, 910, 911, 912, 913, 914, 915, 916, 918, 920, 922, 924, 926, 928, 945, 951, 953, 954, 955, 956, 957, 958, 959, 960, 962, 964, 966, 968, 970, 972, 974, 977, 978, 979, 980, 981, 982, 983, 984, 986, 988, 990, 992, 994, 996, 1013, 1019, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1030, 1032, 1034, 1036, 1038, 1040, 1044, 1049, 1050, 1051, 1052, 1053, 1054, 1055, 1056, 1060, 1062, 1064, 1066, 1068, 1070, 1087, 1093, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1102, 1104, 1106, 1108, 1110, 1112, 1116, 1122, 1129, 1130, 1131, 1132, 1133, 1134, 1135, 1136, 1142, 1146, 1148, 1150, 1152, 1154, 1171, 1177, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1188, 1190, 1192, 1194, 1198, 1204, 1212, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1236, 1242, 1246, 1248, 1250, 1252, 1269, 1275, 1277, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1286, 1288, 1290, 1294, 1300, 1308, 1318, 1329, 1330, 1331, 1332, 1333, 1334, 1335, 1336, 1346, 1354, 1360, 1364, 1366, 1368, 1385, 1391, 1393, 1394, 1395, 1396, 1397, 1398, 1399, 1400, 1402, 1404, 1408, 1414, 1422, 1432, 1444, 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1476, 1486, 1494, 1500, 1504, 1506, 1523, 1525, 1528, 1530, 1531, 1532, 1533, 1534, 1535, 1536, 1537, 1539, 1543, 1549, 1557, 1567, 1579, 1593, 1608, 1609, 1610, 1611, 1612, 1613, 1614, 1615, 1629, 1641, 1651, 1659, 1665, 1669, 1686]
Discarding 529 places :
Implicit Place search using SMT only with invariants took 4465 ms to find 529 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1425/1954 places, 4451/4451 transitions.
Discarding 223 places :
Symmetric choice reduction at 0 with 223 rule applications. Total rules 223 place count 1202 transition count 4228
Iterating global reduction 0 with 223 rules applied. Total rules applied 446 place count 1202 transition count 4228
Discarding 223 places :
Symmetric choice reduction at 0 with 223 rule applications. Total rules 669 place count 979 transition count 4005
Iterating global reduction 0 with 223 rules applied. Total rules applied 892 place count 979 transition count 4005
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 895 place count 979 transition count 4002
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 898 place count 976 transition count 4002
Applied a total of 898 rules in 289 ms. Remains 976 /1425 variables (removed 449) and now considering 4002/4451 (removed 449) transitions.
[2023-03-23 23:23:15] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2023-03-23 23:23:15] [INFO ] Computed 48 place invariants in 37 ms
[2023-03-23 23:23:16] [INFO ] Implicit Places using invariants in 1161 ms returned []
[2023-03-23 23:23:16] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2023-03-23 23:23:16] [INFO ] Invariant cache hit.
[2023-03-23 23:23:17] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:23:38] [INFO ] Implicit Places using invariants and state equation in 22056 ms returned []
Implicit Place search using SMT with State Equation took 23219 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 976/1954 places, 4002/4451 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 28115 ms. Remains : 976/1954 places, 4002/4451 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 72927 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72927 steps, saw 30571 distinct states, run finished after 3003 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 23:23:41] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2023-03-23 23:23:41] [INFO ] Invariant cache hit.
[2023-03-23 23:23:41] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:23:42] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-23 23:23:42] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2023-03-23 23:23:43] [INFO ] After 938ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 23:23:43] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:23:43] [INFO ] After 337ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 23:23:43] [INFO ] After 486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-23 23:23:43] [INFO ] After 1672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 976 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 976/976 places, 4002/4002 transitions.
Applied a total of 0 rules in 103 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 976/976 places, 4002/4002 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 976/976 places, 4002/4002 transitions.
Applied a total of 0 rules in 106 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
[2023-03-23 23:23:43] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2023-03-23 23:23:43] [INFO ] Invariant cache hit.
[2023-03-23 23:23:44] [INFO ] Implicit Places using invariants in 1141 ms returned []
[2023-03-23 23:23:44] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2023-03-23 23:23:44] [INFO ] Invariant cache hit.
[2023-03-23 23:23:45] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:24:07] [INFO ] Implicit Places using invariants and state equation in 22467 ms returned []
Implicit Place search using SMT with State Equation took 23618 ms to find 0 implicit places.
[2023-03-23 23:24:07] [INFO ] Redundant transitions in 295 ms returned []
[2023-03-23 23:24:07] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2023-03-23 23:24:07] [INFO ] Invariant cache hit.
[2023-03-23 23:24:09] [INFO ] Dead Transitions using invariants and state equation in 1493 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25519 ms. Remains : 976/976 places, 4002/4002 transitions.
Graph (trivial) has 1052 edges and 976 vertex of which 17 / 976 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 4570 edges and 960 vertex of which 946 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 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 929 transition count 3233
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 832 transition count 3040
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 736 transition count 2872
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 664 transition count 2730
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 594 transition count 2610
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 544 transition count 2512
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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1335 place count 496 transition count 2432
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1429 place count 464 transition count 2370
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1507 place count 434 transition count 2322
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 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 9 with 52 rules applied. Total rules applied 1559 place count 416 transition count 2288
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 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 40 rules applied. Total rules applied 1599 place count 400 transition count 2264
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 1621 place count 392 transition count 2250
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 1635 place count 386 transition count 2242
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 383 transition count 2240
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 1640 place count 383 transition count 2225
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 14 with 30 rules applied. Total rules applied 1670 place count 368 transition count 2225
Discarding 284 places :
Symmetric choice reduction at 14 with 284 rule applications. Total rules 1954 place count 84 transition count 333
Iterating global reduction 14 with 284 rules applied. Total rules applied 2238 place count 84 transition count 333
Ensure Unique test removed 246 transitions
Reduce isomorphic transitions removed 246 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 14 with 253 rules applied. Total rules applied 2491 place count 84 transition count 80
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 2498 place count 77 transition count 80
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2498 place count 77 transition count 79
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 2500 place count 76 transition count 79
Discarding 12 places :
Symmetric choice reduction at 16 with 12 rule applications. Total rules 2512 place count 64 transition count 62
Iterating global reduction 16 with 12 rules applied. Total rules applied 2524 place count 64 transition count 62
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 2529 place count 59 transition count 57
Iterating global reduction 16 with 5 rules applied. Total rules applied 2534 place count 59 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 2538 place count 57 transition count 55
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2539 place count 56 transition count 53
Iterating global reduction 16 with 1 rules applied. Total rules applied 2540 place count 56 transition count 53
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 16 with 14 rules applied. Total rules applied 2554 place count 56 transition count 39
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 16 with 14 rules applied. Total rules applied 2568 place count 42 transition count 39
Applied a total of 2568 rules in 413 ms. Remains 42 /976 variables (removed 934) and now considering 39/4002 (removed 3963) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 42 cols
[2023-03-23 23:24:09] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-23 23:24:09] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:24:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 23:24:09] [INFO ] [Nat]Absence check using 2 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 23:24:09] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 23:24:09] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-23 23:24:09] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-23 23:24:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-23 23:24:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 976 places, 4002 transitions and 19956 arcs took 24 ms.
[2023-03-23 23:24:10] [INFO ] Flatten gal took : 339 ms
Total runtime 132068 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/562/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 14896104 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16087244 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-S16C07"
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-S16C07, 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-167856419400790"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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