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-167856419400783.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419400783
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679611705062

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=ReachabilityFireability
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:48:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 22:48:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 22:48:26] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2023-03-23 22:48:26] [INFO ] Transformed 5568 places.
[2023-03-23 22:48:27] [INFO ] Transformed 7799 transitions.
[2023-03-23 22:48:27] [INFO ] Parsed PT model containing 5568 places and 7799 transitions and 29646 arcs in 436 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 160 resets, run finished after 629 ms. (steps per millisecond=15 ) properties (out of 16) seen :3
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 13) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 12) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-23 22:48:29] [INFO ] Flow matrix only has 7527 transitions (discarded 272 similar events)
// Phase 1: matrix 7527 rows 5568 cols
[2023-03-23 22:48:29] [INFO ] Computed 573 place invariants in 398 ms
[2023-03-23 22:48:31] [INFO ] [Real]Absence check using 50 positive place invariants in 35 ms returned sat
[2023-03-23 22:48:31] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 245 ms returned sat
[2023-03-23 22:48:31] [INFO ] After 2135ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:9
[2023-03-23 22:48:33] [INFO ] [Nat]Absence check using 50 positive place invariants in 22 ms returned sat
[2023-03-23 22:48:33] [INFO ] [Nat]Absence check using 50 positive and 523 generalized place invariants in 235 ms returned sat
[2023-03-23 22:48:47] [INFO ] After 13764ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :5
[2023-03-23 22:48:47] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 22:48:57] [INFO ] After 9337ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :6 sat :3
[2023-03-23 22:48:57] [INFO ] After 9341ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-23 22:48:57] [INFO ] After 25083ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :3
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 49 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 5536 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.20 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions removed 1578 transitions
Trivial Post-agglo rules discarded 1578 transitions
Performed 1578 trivial Post agglomeration. Transition count delta: 1578
Iterating post reduction 0 with 1578 rules applied. Total rules applied 1579 place count 5536 transition count 6221
Reduce places removed 1578 places and 0 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Iterating post reduction 1 with 1626 rules applied. Total rules applied 3205 place count 3958 transition count 6173
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 3253 place count 3910 transition count 6173
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 3253 place count 3910 transition count 5975
Deduced a syphon composed of 198 places in 5 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 3649 place count 3712 transition count 5975
Discarding 1416 places :
Symmetric choice reduction at 3 with 1416 rule applications. Total rules 5065 place count 2296 transition count 4559
Iterating global reduction 3 with 1416 rules applied. Total rules applied 6481 place count 2296 transition count 4559
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6481 place count 2296 transition count 4556
Deduced a syphon composed of 3 places in 14 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 6487 place count 2293 transition count 4556
Discarding 220 places :
Symmetric choice reduction at 3 with 220 rule applications. Total rules 6707 place count 2073 transition count 3236
Iterating global reduction 3 with 220 rules applied. Total rules applied 6927 place count 2073 transition count 3236
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 6959 place count 2057 transition count 3220
Free-agglomeration rule (complex) applied 162 times.
Iterating global reduction 3 with 162 rules applied. Total rules applied 7121 place count 2057 transition count 4158
Reduce places removed 162 places and 0 transitions.
Iterating post reduction 3 with 162 rules applied. Total rules applied 7283 place count 1895 transition count 4158
Partial Free-agglomeration rule applied 147 times.
Drop transitions removed 147 transitions
Iterating global reduction 4 with 147 rules applied. Total rules applied 7430 place count 1895 transition count 4158
Applied a total of 7430 rules in 1622 ms. Remains 1895 /5568 variables (removed 3673) and now considering 4158/7799 (removed 3641) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1626 ms. Remains : 1895/5568 places, 4158/7799 transitions.
Incomplete random walk after 10000 steps, including 263 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 50445 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 50445 steps, saw 22637 distinct states, run finished after 3003 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-23 22:49:02] [INFO ] Flow matrix only has 3770 transitions (discarded 388 similar events)
// Phase 1: matrix 3770 rows 1895 cols
[2023-03-23 22:49:02] [INFO ] Computed 541 place invariants in 56 ms
[2023-03-23 22:49:02] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2023-03-23 22:49:02] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 110 ms returned sat
[2023-03-23 22:49:03] [INFO ] After 648ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 22:49:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 32 ms returned sat
[2023-03-23 22:49:03] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 128 ms returned sat
[2023-03-23 22:49:06] [INFO ] After 2353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 22:49:06] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 22:49:11] [INFO ] After 5531ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2023-03-23 22:49:13] [INFO ] Deduced a trap composed of 125 places in 1384 ms of which 9 ms to minimize.
[2023-03-23 22:49:15] [INFO ] Deduced a trap composed of 250 places in 1356 ms of which 3 ms to minimize.
[2023-03-23 22:49:17] [INFO ] Deduced a trap composed of 293 places in 1421 ms of which 3 ms to minimize.
[2023-03-23 22:49:18] [INFO ] Deduced a trap composed of 225 places in 1405 ms of which 6 ms to minimize.
[2023-03-23 22:49:20] [INFO ] Deduced a trap composed of 268 places in 1383 ms of which 2 ms to minimize.
[2023-03-23 22:49:21] [INFO ] Deduced a trap composed of 286 places in 1358 ms of which 2 ms to minimize.
[2023-03-23 22:49:23] [INFO ] Deduced a trap composed of 239 places in 1309 ms of which 2 ms to minimize.
[2023-03-23 22:49:25] [INFO ] Deduced a trap composed of 198 places in 1414 ms of which 2 ms to minimize.
[2023-03-23 22:49:26] [INFO ] Deduced a trap composed of 243 places in 1375 ms of which 2 ms to minimize.
[2023-03-23 22:49:28] [INFO ] Deduced a trap composed of 252 places in 1359 ms of which 1 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 22:49:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 22:49:28] [INFO ] After 25367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 30 out of 1895 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1895/1895 places, 4158/4158 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1895 transition count 4155
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1892 transition count 4155
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1892 transition count 4152
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1889 transition count 4152
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 1886 transition count 4149
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 1886 transition count 4149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 1886 transition count 4148
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 1885 transition count 4148
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 1885 transition count 4145
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 1882 transition count 4145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 1880 transition count 4143
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 1880 transition count 4143
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 1880 transition count 4143
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 1879 transition count 4142
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 1879 transition count 4142
Applied a total of 34 rules in 572 ms. Remains 1879 /1895 variables (removed 16) and now considering 4142/4158 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 572 ms. Remains : 1879/1895 places, 4142/4158 transitions.
Incomplete random walk after 10000 steps, including 264 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 2) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 22:49:29] [INFO ] Flow matrix only has 3754 transitions (discarded 388 similar events)
// Phase 1: matrix 3754 rows 1879 cols
[2023-03-23 22:49:29] [INFO ] Computed 541 place invariants in 82 ms
[2023-03-23 22:49:29] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2023-03-23 22:49:29] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 103 ms returned sat
[2023-03-23 22:49:29] [INFO ] After 396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 22:49:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2023-03-23 22:49:30] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 119 ms returned sat
[2023-03-23 22:49:31] [INFO ] After 1721ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 22:49:31] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 22:49:32] [INFO ] After 696ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 22:49:34] [INFO ] Deduced a trap composed of 242 places in 1528 ms of which 2 ms to minimize.
[2023-03-23 22:49:36] [INFO ] Deduced a trap composed of 211 places in 1556 ms of which 3 ms to minimize.
[2023-03-23 22:49:38] [INFO ] Deduced a trap composed of 226 places in 1564 ms of which 2 ms to minimize.
[2023-03-23 22:49:39] [INFO ] Deduced a trap composed of 203 places in 1524 ms of which 2 ms to minimize.
[2023-03-23 22:49:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7130 ms
[2023-03-23 22:49:40] [INFO ] After 8220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 339 ms.
[2023-03-23 22:49:40] [INFO ] After 10686ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 13 out of 1879 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1879/1879 places, 4142/4142 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1879 transition count 4140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1877 transition count 4140
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 1877 transition count 4137
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 1874 transition count 4137
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 1871 transition count 4134
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 1871 transition count 4134
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 1871 transition count 4131
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 1868 transition count 4131
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 1868 transition count 4125
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 34 place count 1862 transition count 4125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 36 place count 1860 transition count 4123
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 1860 transition count 4123
Applied a total of 38 rules in 414 ms. Remains 1860 /1879 variables (removed 19) and now considering 4123/4142 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 414 ms. Remains : 1860/1879 places, 4123/4142 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 53347 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 53347 steps, saw 23876 distinct states, run finished after 3002 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 22:49:44] [INFO ] Flow matrix only has 3734 transitions (discarded 389 similar events)
// Phase 1: matrix 3734 rows 1860 cols
[2023-03-23 22:49:44] [INFO ] Computed 541 place invariants in 57 ms
[2023-03-23 22:49:44] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2023-03-23 22:49:44] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 110 ms returned sat
[2023-03-23 22:49:44] [INFO ] After 372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 22:49:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 31 ms returned sat
[2023-03-23 22:49:44] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 112 ms returned sat
[2023-03-23 22:49:46] [INFO ] After 1594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 22:49:46] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 22:49:47] [INFO ] After 961ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 22:49:49] [INFO ] Deduced a trap composed of 258 places in 1434 ms of which 2 ms to minimize.
[2023-03-23 22:49:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1708 ms
[2023-03-23 22:49:49] [INFO ] After 2874ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 256 ms.
[2023-03-23 22:49:49] [INFO ] After 5113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 13 out of 1860 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1860/1860 places, 4123/4123 transitions.
Applied a total of 0 rules in 140 ms. Remains 1860 /1860 variables (removed 0) and now considering 4123/4123 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 1860/1860 places, 4123/4123 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1860/1860 places, 4123/4123 transitions.
Applied a total of 0 rules in 133 ms. Remains 1860 /1860 variables (removed 0) and now considering 4123/4123 (removed 0) transitions.
[2023-03-23 22:49:49] [INFO ] Flow matrix only has 3734 transitions (discarded 389 similar events)
[2023-03-23 22:49:49] [INFO ] Invariant cache hit.
[2023-03-23 22:49:53] [INFO ] Implicit Places using invariants in 3920 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 34, 44, 56, 70, 85, 99, 100, 101, 102, 103, 104, 105, 117, 127, 135, 141, 145, 147, 162, 168, 170, 171, 172, 173, 174, 175, 176, 178, 182, 189, 197, 207, 219, 232, 244, 245, 246, 247, 248, 249, 250, 260, 268, 274, 278, 280, 282, 297, 303, 305, 306, 307, 308, 309, 310, 311, 313, 315, 320, 326, 334, 344, 355, 365, 366, 367, 368, 369, 370, 371, 379, 385, 389, 391, 393, 395, 410, 416, 418, 419, 420, 421, 422, 423, 424, 426, 428, 431, 435, 441, 449, 458, 466, 467, 468, 469, 470, 471, 472, 478, 482, 484, 486, 488, 490, 505, 512, 514, 515, 516, 517, 518, 519, 520, 522, 524, 526, 528, 532, 538, 545, 551, 552, 553, 554, 555, 556, 557, 561, 563, 565, 567, 569, 571, 586, 592, 594, 595, 596, 597, 598, 599, 600, 602, 604, 606, 608, 610, 614, 619, 623, 624, 625, 626, 627, 628, 629, 631, 633, 635, 637, 639, 641, 656, 662, 664, 665, 666, 667, 668, 669, 670, 672, 674, 676, 678, 680, 682, 685, 687, 688, 689, 690, 691, 692, 693, 695, 697, 699, 701, 703, 705, 720, 726, 728, 729, 730, 731, 732, 733, 734, 736, 738, 740, 742, 744, 746, 748, 750, 751, 752, 753, 754, 755, 756, 758, 760, 762, 764, 766, 768, 783, 785, 788, 790, 791, 792, 793, 794, 795, 796, 798, 800, 802, 804, 806, 808, 810, 812, 813, 814, 815, 816, 817, 818, 820, 822, 824, 826, 828, 830, 845, 851, 853, 854, 855, 856, 857, 858, 859, 862, 864, 866, 868, 870, 872, 874, 876, 877, 878, 879, 880, 881, 882, 884, 886, 888, 890, 892, 894, 909, 915, 917, 918, 919, 920, 921, 922, 923, 925, 927, 929, 931, 933, 935, 937, 940, 941, 942, 943, 944, 945, 946, 948, 950, 952, 954, 956, 958, 973, 979, 981, 982, 983, 984, 985, 986, 987, 989, 991, 993, 995, 997, 999, 1003, 1008, 1009, 1010, 1011, 1012, 1013, 1014, 1018, 1020, 1022, 1025, 1027, 1029, 1044, 1050, 1052, 1053, 1054, 1055, 1056, 1057, 1058, 1060, 1062, 1064, 1066, 1068, 1072, 1078, 1086, 1087, 1088, 1089, 1090, 1091, 1099, 1103, 1105, 1107, 1109, 1111, 1126, 1132, 1134, 1135, 1136, 1137, 1138, 1139, 1140, 1142, 1144, 1146, 1149, 1153, 1159, 1167, 1176, 1177, 1178, 1179, 1180, 1181, 1182, 1190, 1196, 1200, 1202, 1204, 1206, 1221, 1227, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1237, 1239, 1241, 1246, 1252, 1260, 1270, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1297, 1305, 1311, 1315, 1317, 1319, 1334, 1340, 1342, 1343, 1344, 1345, 1346, 1347, 1348, 1350, 1352, 1356, 1363, 1371, 1381, 1393, 1406, 1407, 1408, 1409, 1410, 1411, 1412, 1424, 1434, 1442, 1449, 1453, 1455, 1470, 1472, 1475, 1477, 1478, 1479, 1480, 1481, 1482, 1483, 1485, 1489, 1495, 1504, 1514, 1526, 1540, 1555, 1556, 1557, 1558, 1559, 1560, 1561, 1575, 1587, 1597, 1605, 1611, 1615, 1630]
Discarding 495 places :
Implicit Place search using SMT only with invariants took 3943 ms to find 495 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1365/1860 places, 4123/4123 transitions.
Discarding 191 places :
Symmetric choice reduction at 0 with 191 rule applications. Total rules 191 place count 1174 transition count 3932
Iterating global reduction 0 with 191 rules applied. Total rules applied 382 place count 1174 transition count 3932
Discarding 191 places :
Symmetric choice reduction at 0 with 191 rule applications. Total rules 573 place count 983 transition count 3741
Iterating global reduction 0 with 191 rules applied. Total rules applied 764 place count 983 transition count 3741
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 767 place count 983 transition count 3738
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 770 place count 980 transition count 3738
Applied a total of 770 rules in 289 ms. Remains 980 /1365 variables (removed 385) and now considering 3738/4123 (removed 385) transitions.
[2023-03-23 22:49:54] [INFO ] Flow matrix only has 3349 transitions (discarded 389 similar events)
// Phase 1: matrix 3349 rows 980 cols
[2023-03-23 22:49:54] [INFO ] Computed 46 place invariants in 35 ms
[2023-03-23 22:49:55] [INFO ] Implicit Places using invariants in 1048 ms returned []
[2023-03-23 22:49:55] [INFO ] Flow matrix only has 3349 transitions (discarded 389 similar events)
[2023-03-23 22:49:55] [INFO ] Invariant cache hit.
[2023-03-23 22:49:55] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 22:50:12] [INFO ] Implicit Places using invariants and state equation in 17428 ms returned []
Implicit Place search using SMT with State Equation took 18489 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 980/1860 places, 3738/4123 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 22856 ms. Remains : 980/1860 places, 3738/4123 transitions.
Incomplete random walk after 10000 steps, including 282 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 63331 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 63331 steps, saw 26507 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 22:50:15] [INFO ] Flow matrix only has 3349 transitions (discarded 389 similar events)
[2023-03-23 22:50:15] [INFO ] Invariant cache hit.
[2023-03-23 22:50:15] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-23 22:50:15] [INFO ] [Real]Absence check using 31 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 22:50:17] [INFO ] After 1207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 22:50:17] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-23 22:50:17] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-23 22:50:18] [INFO ] After 927ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 22:50:18] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 22:50:18] [INFO ] After 822ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 22:50:19] [INFO ] After 981ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-23 22:50:19] [INFO ] After 2172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 13 out of 980 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 980/980 places, 3738/3738 transitions.
Applied a total of 0 rules in 107 ms. Remains 980 /980 variables (removed 0) and now considering 3738/3738 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 980/980 places, 3738/3738 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 980/980 places, 3738/3738 transitions.
Applied a total of 0 rules in 102 ms. Remains 980 /980 variables (removed 0) and now considering 3738/3738 (removed 0) transitions.
[2023-03-23 22:50:19] [INFO ] Flow matrix only has 3349 transitions (discarded 389 similar events)
[2023-03-23 22:50:19] [INFO ] Invariant cache hit.
[2023-03-23 22:50:20] [INFO ] Implicit Places using invariants in 1045 ms returned []
[2023-03-23 22:50:20] [INFO ] Flow matrix only has 3349 transitions (discarded 389 similar events)
[2023-03-23 22:50:20] [INFO ] Invariant cache hit.
[2023-03-23 22:50:21] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 22:50:38] [INFO ] Implicit Places using invariants and state equation in 17573 ms returned []
Implicit Place search using SMT with State Equation took 18618 ms to find 0 implicit places.
[2023-03-23 22:50:38] [INFO ] Redundant transitions in 264 ms returned []
[2023-03-23 22:50:38] [INFO ] Flow matrix only has 3349 transitions (discarded 389 similar events)
[2023-03-23 22:50:38] [INFO ] Invariant cache hit.
[2023-03-23 22:50:39] [INFO ] Dead Transitions using invariants and state equation in 1307 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20304 ms. Remains : 980/980 places, 3738/3738 transitions.
Graph (trivial) has 1017 edges and 980 vertex of which 16 / 980 are part of one of the 1 SCC in 3 ms
Free SCC test removed 15 places
Drop transitions removed 263 transitions
Ensure Unique test removed 384 transitions
Reduce isomorphic transitions removed 647 transitions.
Graph (complete) has 4330 edges and 965 vertex of which 953 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 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 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 86 rules applied. Total rules applied 88 place count 936 transition count 3005
Reduce places removed 84 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 1 with 237 rules applied. Total rules applied 325 place count 852 transition count 2852
Reduce places removed 76 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 2 with 197 rules applied. Total rules applied 522 place count 776 transition count 2731
Reduce places removed 52 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 45 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 139 rules applied. Total rules applied 661 place count 724 transition count 2644
Reduce places removed 42 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 4 with 103 rules applied. Total rules applied 764 place count 682 transition count 2583
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 19 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 5 with 62 rules applied. Total rules applied 826 place count 656 transition count 2547
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 11 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 6 with 35 rules applied. Total rules applied 861 place count 639 transition count 2529
Reduce places removed 7 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 7 with 17 rules applied. Total rules applied 878 place count 632 transition count 2519
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 888 place count 622 transition count 2519
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 13 Pre rules applied. Total rules applied 888 place count 622 transition count 2506
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 914 place count 609 transition count 2506
Discarding 215 places :
Symmetric choice reduction at 9 with 215 rule applications. Total rules 1129 place count 394 transition count 1286
Iterating global reduction 9 with 215 rules applied. Total rules applied 1344 place count 394 transition count 1286
Ensure Unique test removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Iterating post reduction 9 with 169 rules applied. Total rules applied 1513 place count 394 transition count 1117
Performed 237 Post agglomeration using F-continuation condition.Transition count delta: 237
Deduced a syphon composed of 237 places in 0 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 10 with 474 rules applied. Total rules applied 1987 place count 157 transition count 880
Drop transitions removed 235 transitions
Reduce isomorphic transitions removed 235 transitions.
Iterating post reduction 10 with 235 rules applied. Total rules applied 2222 place count 157 transition count 645
Discarding 54 places :
Symmetric choice reduction at 11 with 54 rule applications. Total rules 2276 place count 103 transition count 267
Iterating global reduction 11 with 54 rules applied. Total rules applied 2330 place count 103 transition count 267
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 11 with 32 rules applied. Total rules applied 2362 place count 103 transition count 235
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 2364 place count 101 transition count 224
Iterating global reduction 12 with 2 rules applied. Total rules applied 2366 place count 101 transition count 224
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 2368 place count 99 transition count 222
Iterating global reduction 12 with 2 rules applied. Total rules applied 2370 place count 99 transition count 222
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 12 with 27 rules applied. Total rules applied 2397 place count 99 transition count 195
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 2406 place count 90 transition count 141
Iterating global reduction 12 with 9 rules applied. Total rules applied 2415 place count 90 transition count 141
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 2427 place count 90 transition count 129
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 2428 place count 89 transition count 127
Iterating global reduction 13 with 1 rules applied. Total rules applied 2429 place count 89 transition count 127
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 2434 place count 89 transition count 122
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 2436 place count 87 transition count 119
Iterating global reduction 13 with 2 rules applied. Total rules applied 2438 place count 87 transition count 119
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 2439 place count 86 transition count 118
Iterating global reduction 13 with 1 rules applied. Total rules applied 2440 place count 86 transition count 118
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2441 place count 86 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 2442 place count 85 transition count 117
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 14 with 9 rules applied. Total rules applied 2451 place count 85 transition count 108
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 14 with 9 rules applied. Total rules applied 2460 place count 76 transition count 108
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 2461 place count 75 transition count 106
Iterating global reduction 15 with 1 rules applied. Total rules applied 2462 place count 75 transition count 106
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 15 with 41 rules applied. Total rules applied 2503 place count 75 transition count 106
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 2504 place count 74 transition count 105
Iterating global reduction 15 with 1 rules applied. Total rules applied 2505 place count 74 transition count 105
Applied a total of 2505 rules in 599 ms. Remains 74 /980 variables (removed 906) and now considering 105/3738 (removed 3633) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 105 rows 74 cols
[2023-03-23 22:50:40] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-23 22:50:40] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 22:50:40] [INFO ] [Real]Absence check using 5 positive and 13 generalized place invariants in 2 ms returned sat
[2023-03-23 22:50:40] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 22:50:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 22:50:40] [INFO ] [Nat]Absence check using 5 positive and 13 generalized place invariants in 2 ms returned sat
[2023-03-23 22:50:40] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 22:50:40] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-23 22:50:40] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-23 22:50:40] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-23 22:50:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 980 places, 3738 transitions and 18583 arcs took 22 ms.
[2023-03-23 22:50:41] [INFO ] Flatten gal took : 304 ms
Total runtime 134434 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 --inv-bin-par --invariant=/tmp/577/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 14058144 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16088776 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 ReachabilityFireability -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="ReachabilityFireability"
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 ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856419400783"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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