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.r234-tall-167856421000887.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 marciexred
Input is MultiCrashLeafsetExtension-PT-S24C12, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856421000887
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 9.6K Feb 26 03:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 03:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 03:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 03:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 03:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 03:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 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 20M 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-S24C12-ReachabilityFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679636749063

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C12
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 05:45:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 05:45:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 05:45:51] [INFO ] Load time of PNML (sax parser for PT used): 577 ms
[2023-03-24 05:45:51] [INFO ] Transformed 20612 places.
[2023-03-24 05:45:51] [INFO ] Transformed 29875 transitions.
[2023-03-24 05:45:51] [INFO ] Parsed PT model containing 20612 places and 29875 transitions and 109334 arcs in 746 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 81 resets, run finished after 732 ms. (steps per millisecond=13 ) properties (out of 16) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 8284 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8284 steps, saw 4126 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-24 05:45:55] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20612 cols
[2023-03-24 05:45:58] [INFO ] Computed 1353 place invariants in 2796 ms
[2023-03-24 05:46:04] [INFO ] [Real]Absence check using 78 positive place invariants in 100 ms returned sat
[2023-03-24 05:46:06] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 1431 ms returned sat
[2023-03-24 05:46:06] [INFO ] After 7887ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:13
[2023-03-24 05:46:11] [INFO ] [Nat]Absence check using 78 positive place invariants in 78 ms returned sat
[2023-03-24 05:46:12] [INFO ] [Nat]Absence check using 78 positive and 1275 generalized place invariants in 1344 ms returned sat
[2023-03-24 05:46:31] [INFO ] After 15448ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :8
[2023-03-24 05:46:31] [INFO ] State equation strengthened by 9202 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-24 05:46:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 05:46:31] [INFO ] After 25182ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:13
FORMULA MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 145 out of 20612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20612/20612 places, 29875/29875 transitions.
Graph (complete) has 64441 edges and 20612 vertex of which 20560 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.73 ms
Discarding 52 places :
Also discarding 0 output transitions
Drop transitions removed 6908 transitions
Trivial Post-agglo rules discarded 6908 transitions
Performed 6908 trivial Post agglomeration. Transition count delta: 6908
Iterating post reduction 0 with 6908 rules applied. Total rules applied 6909 place count 20560 transition count 22967
Reduce places removed 6908 places and 0 transitions.
Performed 276 Post agglomeration using F-continuation condition.Transition count delta: 276
Iterating post reduction 1 with 7184 rules applied. Total rules applied 14093 place count 13652 transition count 22691
Reduce places removed 276 places and 0 transitions.
Iterating post reduction 2 with 276 rules applied. Total rules applied 14369 place count 13376 transition count 22691
Performed 576 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 576 Pre rules applied. Total rules applied 14369 place count 13376 transition count 22115
Deduced a syphon composed of 576 places in 29 ms
Reduce places removed 576 places and 0 transitions.
Iterating global reduction 3 with 1152 rules applied. Total rules applied 15521 place count 12800 transition count 22115
Discarding 6561 places :
Symmetric choice reduction at 3 with 6561 rule applications. Total rules 22082 place count 6239 transition count 15554
Iterating global reduction 3 with 6561 rules applied. Total rules applied 28643 place count 6239 transition count 15554
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 28643 place count 6239 transition count 15550
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 28651 place count 6235 transition count 15550
Discarding 495 places :
Symmetric choice reduction at 3 with 495 rule applications. Total rules 29146 place count 5740 transition count 9610
Iterating global reduction 3 with 495 rules applied. Total rules applied 29641 place count 5740 transition count 9610
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 10 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 29681 place count 5720 transition count 9590
Free-agglomeration rule (complex) applied 240 times.
Iterating global reduction 3 with 240 rules applied. Total rules applied 29921 place count 5720 transition count 9350
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 3 with 240 rules applied. Total rules applied 30161 place count 5480 transition count 9350
Partial Free-agglomeration rule applied 477 times.
Drop transitions removed 477 transitions
Iterating global reduction 4 with 477 rules applied. Total rules applied 30638 place count 5480 transition count 9350
Applied a total of 30638 rules in 7313 ms. Remains 5480 /20612 variables (removed 15132) and now considering 9350/29875 (removed 20525) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7315 ms. Remains : 5480/20612 places, 9350/29875 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 9) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-24 05:46:39] [INFO ] Flow matrix only has 8510 transitions (discarded 840 similar events)
// Phase 1: matrix 8510 rows 5480 cols
[2023-03-24 05:46:40] [INFO ] Computed 1301 place invariants in 272 ms
[2023-03-24 05:46:41] [INFO ] [Real]Absence check using 49 positive place invariants in 94 ms returned sat
[2023-03-24 05:46:41] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 371 ms returned sat
[2023-03-24 05:46:42] [INFO ] After 1729ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-24 05:46:43] [INFO ] [Nat]Absence check using 49 positive place invariants in 81 ms returned sat
[2023-03-24 05:46:43] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 366 ms returned sat
[2023-03-24 05:47:02] [INFO ] After 17959ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-24 05:47:02] [INFO ] State equation strengthened by 3757 read => feed constraints.
[2023-03-24 05:47:07] [INFO ] After 5006ms SMT Verify possible using 3757 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-24 05:47:07] [INFO ] After 5008ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-24 05:47:07] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 94 ms.
Support contains 143 out of 5480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5480/5480 places, 9350/9350 transitions.
Applied a total of 0 rules in 634 ms. Remains 5480 /5480 variables (removed 0) and now considering 9350/9350 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 634 ms. Remains : 5480/5480 places, 9350/9350 transitions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 8) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 5 properties.
[2023-03-24 05:47:08] [INFO ] Flow matrix only has 8510 transitions (discarded 840 similar events)
[2023-03-24 05:47:08] [INFO ] Invariant cache hit.
[2023-03-24 05:47:09] [INFO ] [Real]Absence check using 49 positive place invariants in 78 ms returned sat
[2023-03-24 05:47:10] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 361 ms returned sat
[2023-03-24 05:47:10] [INFO ] After 1392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-24 05:47:10] [INFO ] [Nat]Absence check using 49 positive place invariants in 77 ms returned sat
[2023-03-24 05:47:11] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 365 ms returned sat
[2023-03-24 05:47:22] [INFO ] After 11137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-24 05:47:22] [INFO ] State equation strengthened by 3757 read => feed constraints.
[2023-03-24 05:47:35] [INFO ] After 12265ms SMT Verify possible using 3757 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-24 05:47:35] [INFO ] After 12266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-24 05:47:35] [INFO ] After 25065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 31 ms.
Support contains 87 out of 5480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5480/5480 places, 9350/9350 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 5480 transition count 9345
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 5475 transition count 9345
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 10 place count 5475 transition count 9333
Deduced a syphon composed of 12 places in 5 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 34 place count 5463 transition count 9333
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 51 place count 5446 transition count 9250
Iterating global reduction 2 with 17 rules applied. Total rules applied 68 place count 5446 transition count 9250
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 68 place count 5446 transition count 9248
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 5444 transition count 9248
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 5434 transition count 9128
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 5434 transition count 9128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 5433 transition count 9127
Free-agglomeration rule (complex) applied 97 times.
Iterating global reduction 2 with 97 rules applied. Total rules applied 191 place count 5433 transition count 14233
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 2 with 97 rules applied. Total rules applied 288 place count 5336 transition count 14233
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 289 place count 5335 transition count 14232
Iterating global reduction 3 with 1 rules applied. Total rules applied 290 place count 5335 transition count 14232
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 301 place count 5335 transition count 14232
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 305 place count 5331 transition count 14228
Iterating global reduction 3 with 4 rules applied. Total rules applied 309 place count 5331 transition count 14228
Applied a total of 309 rules in 5170 ms. Remains 5331 /5480 variables (removed 149) and now considering 14228/9350 (removed -4878) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5172 ms. Remains : 5331/5480 places, 14228/9350 transitions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 763 ms. (steps per millisecond=13 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C12-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-24 05:47:41] [INFO ] Flow matrix only has 13363 transitions (discarded 865 similar events)
// Phase 1: matrix 13363 rows 5331 cols
[2023-03-24 05:47:42] [INFO ] Computed 1301 place invariants in 391 ms
[2023-03-24 05:47:43] [INFO ] [Real]Absence check using 49 positive place invariants in 93 ms returned sat
[2023-03-24 05:47:43] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 372 ms returned sat
[2023-03-24 05:47:52] [INFO ] After 10045ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-24 05:47:53] [INFO ] [Nat]Absence check using 49 positive place invariants in 85 ms returned sat
[2023-03-24 05:47:53] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 340 ms returned sat
[2023-03-24 05:48:08] [INFO ] After 14805ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-24 05:48:08] [INFO ] State equation strengthened by 8784 read => feed constraints.
[2023-03-24 05:48:17] [INFO ] After 8662ms SMT Verify possible using 8784 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-24 05:48:17] [INFO ] After 8664ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-24 05:48:17] [INFO ] After 25070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 16 ms.
Support contains 15 out of 5331 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5331/5331 places, 14228/14228 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 5331 transition count 14218
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 5321 transition count 14218
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 20 place count 5321 transition count 14208
Deduced a syphon composed of 10 places in 9 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 40 place count 5311 transition count 14208
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 52 place count 5299 transition count 14174
Iterating global reduction 2 with 12 rules applied. Total rules applied 64 place count 5299 transition count 14174
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 64 place count 5299 transition count 14167
Deduced a syphon composed of 7 places in 8 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 78 place count 5292 transition count 14167
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 5289 transition count 14164
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 2 with 37 rules applied. Total rules applied 121 place count 5289 transition count 14468
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 158 place count 5252 transition count 14468
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 167 place count 5243 transition count 14459
Iterating global reduction 3 with 9 rules applied. Total rules applied 176 place count 5243 transition count 14459
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 179 place count 5243 transition count 14459
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 180 place count 5242 transition count 14458
Iterating global reduction 3 with 1 rules applied. Total rules applied 181 place count 5242 transition count 14458
Applied a total of 181 rules in 4878 ms. Remains 5242 /5331 variables (removed 89) and now considering 14458/14228 (removed -230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4878 ms. Remains : 5242/5331 places, 14458/14228 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 841 ms. (steps per millisecond=11 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 18678 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 18678 steps, saw 8848 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-24 05:48:26] [INFO ] Flow matrix only has 13576 transitions (discarded 882 similar events)
// Phase 1: matrix 13576 rows 5242 cols
[2023-03-24 05:48:26] [INFO ] Computed 1301 place invariants in 394 ms
[2023-03-24 05:48:27] [INFO ] [Real]Absence check using 49 positive place invariants in 90 ms returned sat
[2023-03-24 05:48:28] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 342 ms returned sat
[2023-03-24 05:48:28] [INFO ] After 1444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-24 05:48:29] [INFO ] [Nat]Absence check using 49 positive place invariants in 94 ms returned sat
[2023-03-24 05:48:29] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 367 ms returned sat
[2023-03-24 05:48:44] [INFO ] After 14280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-24 05:48:44] [INFO ] State equation strengthened by 9103 read => feed constraints.
[2023-03-24 05:48:53] [INFO ] After 9179ms SMT Verify possible using 9103 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-24 05:48:53] [INFO ] After 9180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-24 05:48:53] [INFO ] After 25076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 53 ms.
Support contains 15 out of 5242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5242/5242 places, 14458/14458 transitions.
Applied a total of 0 rules in 948 ms. Remains 5242 /5242 variables (removed 0) and now considering 14458/14458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 948 ms. Remains : 5242/5242 places, 14458/14458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5242/5242 places, 14458/14458 transitions.
Applied a total of 0 rules in 964 ms. Remains 5242 /5242 variables (removed 0) and now considering 14458/14458 (removed 0) transitions.
[2023-03-24 05:48:55] [INFO ] Flow matrix only has 13576 transitions (discarded 882 similar events)
[2023-03-24 05:48:55] [INFO ] Invariant cache hit.
[2023-03-24 05:49:00] [INFO ] Implicit Places using invariants in 4860 ms returned []
Implicit Place search using SMT only with invariants took 4862 ms to find 0 implicit places.
[2023-03-24 05:49:00] [INFO ] Flow matrix only has 13576 transitions (discarded 882 similar events)
[2023-03-24 05:49:00] [INFO ] Invariant cache hit.
[2023-03-24 05:49:08] [INFO ] Dead Transitions using invariants and state equation in 8254 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14084 ms. Remains : 5242/5242 places, 14458/14458 transitions.
Graph (trivial) has 3603 edges and 5242 vertex of which 24 / 5242 are part of one of the 1 SCC in 10 ms
Free SCC test removed 23 places
Drop transitions removed 607 transitions
Ensure Unique test removed 837 transitions
Reduce isomorphic transitions removed 1444 transitions.
Graph (complete) has 55066 edges and 5219 vertex of which 5197 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.7 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 383 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node10DetectsThatNode13CanReplaceNode12.Node13IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 207 rules applied. Total rules applied 209 place count 4813 transition count 12807
Ensure Unique test removed 1 places
Reduce places removed 206 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 185 transitions
Reduce isomorphic transitions removed 186 transitions.
Drop transitions removed 185 transitions
Trivial Post-agglo rules discarded 185 transitions
Performed 185 trivial Post agglomeration. Transition count delta: 185
Iterating post reduction 1 with 577 rules applied. Total rules applied 786 place count 4607 transition count 12436
Ensure Unique test removed 1 places
Reduce places removed 186 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 134 transitions
Reduce isomorphic transitions removed 166 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 2 with 483 rules applied. Total rules applied 1269 place count 4421 transition count 12139
Ensure Unique test removed 32 places
Reduce places removed 163 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 112 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 3 with 385 rules applied. Total rules applied 1654 place count 4258 transition count 11917
Ensure Unique test removed 2 places
Reduce places removed 112 places and 0 transitions.
Drop transitions removed 26 transitions
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 110 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 4 with 306 rules applied. Total rules applied 1960 place count 4146 transition count 11723
Ensure Unique test removed 26 places
Reduce places removed 110 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 84 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 5 with 276 rules applied. Total rules applied 2236 place count 4036 transition count 11557
Ensure Unique test removed 2 places
Reduce places removed 84 places and 0 transitions.
Drop transitions removed 22 transitions
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 82 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 6 with 226 rules applied. Total rules applied 2462 place count 3952 transition count 11415
Ensure Unique test removed 22 places
Reduce places removed 82 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 7 with 200 rules applied. Total rules applied 2662 place count 3870 transition count 11297
Ensure Unique test removed 2 places
Reduce places removed 60 places and 0 transitions.
Drop transitions removed 17 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 58 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 8 with 159 rules applied. Total rules applied 2821 place count 3810 transition count 11198
Ensure Unique test removed 17 places
Reduce places removed 58 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 9 with 138 rules applied. Total rules applied 2959 place count 3752 transition count 11118
Ensure Unique test removed 2 places
Reduce places removed 41 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 10 with 105 rules applied. Total rules applied 3064 place count 3711 transition count 11054
Ensure Unique test removed 14 places
Reduce places removed 39 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 11 with 87 rules applied. Total rules applied 3151 place count 3672 transition count 11006
Ensure Unique test removed 2 places
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 12 with 61 rules applied. Total rules applied 3212 place count 3647 transition count 10970
Ensure Unique test removed 10 places
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 13 with 47 rules applied. Total rules applied 3259 place count 3624 transition count 10946
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 14 with 29 rules applied. Total rules applied 3288 place count 3611 transition count 10930
Ensure Unique test removed 6 places
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 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 15 with 19 rules applied. Total rules applied 3307 place count 3600 transition count 10922
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 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 16 with 9 rules applied. Total rules applied 3316 place count 3595 transition count 10918
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 17 with 9 rules applied. Total rules applied 3325 place count 3592 transition count 10912
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 7 rules applied. Total rules applied 3332 place count 3586 transition count 10911
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 19 with 600 Pre rules applied. Total rules applied 3332 place count 3586 transition count 10311
Deduced a syphon composed of 600 places in 3 ms
Ensure Unique test removed 597 places
Reduce places removed 1197 places and 0 transitions.
Iterating global reduction 19 with 1797 rules applied. Total rules applied 5129 place count 2389 transition count 10311
Discarding 597 places :
Symmetric choice reduction at 19 with 597 rule applications. Total rules 5726 place count 1792 transition count 9714
Iterating global reduction 19 with 597 rules applied. Total rules applied 6323 place count 1792 transition count 9714
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 19 with 1 Pre rules applied. Total rules applied 6323 place count 1792 transition count 9713
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 6325 place count 1791 transition count 9713
Discarding 427 places :
Symmetric choice reduction at 19 with 427 rule applications. Total rules 6752 place count 1364 transition count 4589
Iterating global reduction 19 with 427 rules applied. Total rules applied 7179 place count 1364 transition count 4589
Ensure Unique test removed 427 transitions
Reduce isomorphic transitions removed 427 transitions.
Iterating post reduction 19 with 427 rules applied. Total rules applied 7606 place count 1364 transition count 4162
Performed 945 Post agglomeration using F-continuation condition.Transition count delta: 945
Deduced a syphon composed of 945 places in 1 ms
Reduce places removed 945 places and 0 transitions.
Iterating global reduction 20 with 1890 rules applied. Total rules applied 9496 place count 419 transition count 3217
Drop transitions removed 922 transitions
Reduce isomorphic transitions removed 922 transitions.
Iterating post reduction 20 with 922 rules applied. Total rules applied 10418 place count 419 transition count 2295
Drop transitions removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 21 with 98 rules applied. Total rules applied 10516 place count 419 transition count 2197
Ensure Unique test removed 97 places
Iterating post reduction 21 with 97 rules applied. Total rules applied 10613 place count 322 transition count 2197
Discarding 76 places :
Symmetric choice reduction at 22 with 76 rule applications. Total rules 10689 place count 246 transition count 1285
Iterating global reduction 22 with 76 rules applied. Total rules applied 10765 place count 246 transition count 1285
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 22 with 76 rules applied. Total rules applied 10841 place count 246 transition count 1209
Free-agglomeration rule applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 10842 place count 246 transition count 1208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 10843 place count 245 transition count 1208
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 24 with 13 rules applied. Total rules applied 10856 place count 245 transition count 1195
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 24 with 13 rules applied. Total rules applied 10869 place count 232 transition count 1195
Discarding 11 places :
Symmetric choice reduction at 25 with 11 rule applications. Total rules 10880 place count 221 transition count 1063
Iterating global reduction 25 with 11 rules applied. Total rules applied 10891 place count 221 transition count 1063
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 25 with 11 rules applied. Total rules applied 10902 place count 221 transition count 1052
Partial Free-agglomeration rule applied 432 times.
Drop transitions removed 432 transitions
Iterating global reduction 26 with 432 rules applied. Total rules applied 11334 place count 221 transition count 1052
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11345 place count 210 transition count 920
Iterating global reduction 26 with 11 rules applied. Total rules applied 11356 place count 210 transition count 920
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 26 with 11 rules applied. Total rules applied 11367 place count 210 transition count 909
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 27 with 1 rules applied. Total rules applied 11368 place count 210 transition count 909
Applied a total of 11368 rules in 17072 ms. Remains 210 /5242 variables (removed 5032) and now considering 909/14458 (removed 13549) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 909 rows 210 cols
[2023-03-24 05:49:25] [INFO ] Computed 56 place invariants in 31 ms
[2023-03-24 05:49:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-24 05:49:25] [INFO ] [Real]Absence check using 4 positive and 52 generalized place invariants in 7 ms returned sat
[2023-03-24 05:49:25] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-24 05:49:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-24 05:49:25] [INFO ] [Nat]Absence check using 4 positive and 52 generalized place invariants in 8 ms returned sat
[2023-03-24 05:49:26] [INFO ] After 295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-24 05:49:26] [INFO ] After 493ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-24 05:49:26] [INFO ] After 692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-24 05:49:26] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2023-03-24 05:49:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5242 places, 14458 transitions and 92896 arcs took 77 ms.
[2023-03-24 05:49:27] [INFO ] Flatten gal took : 920 ms
Total runtime 217219 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: gen
(NrP: 5242 NrTr: 14458 NrArc: 92896)

parse formulas
formulas created successfully
place and transition orderings generation:0m18.727sec

net check time: 0m 0.015sec

init dd package: 0m 2.623sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9666724 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16060204 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.803sec

39326 65195 96530 126870 152549 177921

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-S24C12"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is MultiCrashLeafsetExtension-PT-S24C12, 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 r234-tall-167856421000887"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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