fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r234-tall-167856420900823
Last Updated
May 14, 2023

About the Execution of Marcie+red for MultiCrashLeafsetExtension-PT-S24C04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6021.323 3600000.00 3687879.00 9288.00 TFT??FTTTFFTTFFF normal

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-167856420900823.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-S24C04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420900823
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 15K Feb 26 03:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 03:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 03:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 03:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 03:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K 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 10M 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-S24C04-ReachabilityFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679610231150

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-S24C04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 22:23:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 22:23:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 22:23:53] [INFO ] Load time of PNML (sax parser for PT used): 403 ms
[2023-03-23 22:23:53] [INFO ] Transformed 9748 places.
[2023-03-23 22:23:53] [INFO ] Transformed 14659 transitions.
[2023-03-23 22:23:53] [INFO ] Parsed PT model containing 9748 places and 14659 transitions and 58838 arcs in 541 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 240 resets, run finished after 651 ms. (steps per millisecond=15 ) properties (out of 16) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 14) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-23 22:23:55] [INFO ] Flow matrix only has 14059 transitions (discarded 600 similar events)
// Phase 1: matrix 14059 rows 9748 cols
[2023-03-23 22:23:56] [INFO ] Computed 921 place invariants in 851 ms
[2023-03-23 22:23:59] [INFO ] [Real]Absence check using 62 positive place invariants in 76 ms returned sat
[2023-03-23 22:24:00] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 512 ms returned sat
[2023-03-23 22:24:13] [INFO ] After 12586ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:10
[2023-03-23 22:24:13] [INFO ] State equation strengthened by 4402 read => feed constraints.
[2023-03-23 22:24:14] [INFO ] After 890ms SMT Verify possible using 4402 Read/Feed constraints in real domain returned unsat :1 sat :0 real:11
[2023-03-23 22:24:14] [INFO ] After 17439ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2023-03-23 22:24:16] [INFO ] [Nat]Absence check using 62 positive place invariants in 44 ms returned sat
[2023-03-23 22:24:16] [INFO ] [Nat]Absence check using 62 positive and 859 generalized place invariants in 490 ms returned sat
[2023-03-23 22:24:39] [INFO ] After 21134ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
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-23 22:24:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 22:24:39] [INFO ] After 25076ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:11
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 92 out of 9748 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9748/9748 places, 14659/14659 transitions.
Graph (complete) has 33897 edges and 9748 vertex of which 9712 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.38 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions removed 2268 transitions
Trivial Post-agglo rules discarded 2268 transitions
Performed 2268 trivial Post agglomeration. Transition count delta: 2268
Iterating post reduction 0 with 2268 rules applied. Total rules applied 2269 place count 9712 transition count 12391
Reduce places removed 2268 places and 0 transitions.
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Iterating post reduction 1 with 2399 rules applied. Total rules applied 4668 place count 7444 transition count 12260
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 2 with 131 rules applied. Total rules applied 4799 place count 7313 transition count 12260
Performed 189 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 189 Pre rules applied. Total rules applied 4799 place count 7313 transition count 12071
Deduced a syphon composed of 189 places in 11 ms
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 3 with 378 rules applied. Total rules applied 5177 place count 7124 transition count 12071
Discarding 2188 places :
Symmetric choice reduction at 3 with 2188 rule applications. Total rules 7365 place count 4936 transition count 9883
Iterating global reduction 3 with 2188 rules applied. Total rules applied 9553 place count 4936 transition count 9883
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9553 place count 4936 transition count 9882
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9555 place count 4935 transition count 9882
Discarding 529 places :
Symmetric choice reduction at 3 with 529 rule applications. Total rules 10084 place count 4406 transition count 7766
Iterating global reduction 3 with 529 rules applied. Total rules applied 10613 place count 4406 transition count 7766
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 5 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 10659 place count 4383 transition count 7743
Free-agglomeration rule (complex) applied 249 times.
Iterating global reduction 3 with 249 rules applied. Total rules applied 10908 place count 4383 transition count 7494
Reduce places removed 249 places and 0 transitions.
Iterating post reduction 3 with 249 rules applied. Total rules applied 11157 place count 4134 transition count 7494
Partial Free-agglomeration rule applied 164 times.
Drop transitions removed 164 transitions
Iterating global reduction 4 with 164 rules applied. Total rules applied 11321 place count 4134 transition count 7494
Applied a total of 11321 rules in 5539 ms. Remains 4134 /9748 variables (removed 5614) and now considering 7494/14659 (removed 7165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5543 ms. Remains : 4134/9748 places, 7494/14659 transitions.
Incomplete random walk after 10000 steps, including 337 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 9) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-23 22:24:45] [INFO ] Flow matrix only has 6645 transitions (discarded 849 similar events)
// Phase 1: matrix 6645 rows 4134 cols
[2023-03-23 22:24:45] [INFO ] Computed 885 place invariants in 163 ms
[2023-03-23 22:24:46] [INFO ] [Real]Absence check using 49 positive place invariants in 53 ms returned sat
[2023-03-23 22:24:46] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 212 ms returned sat
[2023-03-23 22:24:50] [INFO ] After 4973ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 22:24:51] [INFO ] [Nat]Absence check using 49 positive place invariants in 57 ms returned sat
[2023-03-23 22:24:51] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 208 ms returned sat
[2023-03-23 22:24:56] [INFO ] After 4707ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 22:24:56] [INFO ] State equation strengthened by 2815 read => feed constraints.
[2023-03-23 22:25:13] [INFO ] After 16860ms SMT Verify possible using 2815 Read/Feed constraints in natural domain returned unsat :4 sat :3
[2023-03-23 22:25:15] [INFO ] After 18959ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-23 22:25:15] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 29 out of 4134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4134/4134 places, 7494/7494 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4134 transition count 7493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4133 transition count 7493
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 4133 transition count 7488
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 4128 transition count 7488
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 25 place count 4115 transition count 7454
Iterating global reduction 2 with 13 rules applied. Total rules applied 38 place count 4115 transition count 7454
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 38 place count 4115 transition count 7453
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 4114 transition count 7453
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 46 place count 4108 transition count 7429
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 4108 transition count 7429
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 4106 transition count 7427
Free-agglomeration rule (complex) applied 93 times.
Iterating global reduction 2 with 93 rules applied. Total rules applied 149 place count 4106 transition count 8960
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 2 with 93 rules applied. Total rules applied 242 place count 4013 transition count 8960
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 246 place count 4013 transition count 8960
Applied a total of 246 rules in 2809 ms. Remains 4013 /4134 variables (removed 121) and now considering 8960/7494 (removed -1466) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2824 ms. Remains : 4013/4134 places, 8960/7494 transitions.
Incomplete random walk after 10000 steps, including 394 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 25073 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{2=1}
Probabilistic random walk after 25073 steps, saw 11373 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2023-03-23 22:25:22] [INFO ] Flow matrix only has 8074 transitions (discarded 886 similar events)
// Phase 1: matrix 8074 rows 4013 cols
[2023-03-23 22:25:22] [INFO ] Computed 885 place invariants in 210 ms
[2023-03-23 22:25:22] [INFO ] [Real]Absence check using 49 positive place invariants in 70 ms returned sat
[2023-03-23 22:25:23] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 217 ms returned sat
[2023-03-23 22:25:23] [INFO ] After 872ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 22:25:23] [INFO ] [Nat]Absence check using 49 positive place invariants in 86 ms returned sat
[2023-03-23 22:25:23] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 214 ms returned sat
[2023-03-23 22:25:28] [INFO ] After 4228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 22:25:28] [INFO ] State equation strengthened by 4402 read => feed constraints.
[2023-03-23 22:25:31] [INFO ] After 2717ms SMT Verify possible using 4402 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 22:25:35] [INFO ] Deduced a trap composed of 269 places in 3921 ms of which 13 ms to minimize.
[2023-03-23 22:25:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4811 ms
[2023-03-23 22:25:41] [INFO ] Deduced a trap composed of 358 places in 3748 ms of which 14 ms to minimize.
[2023-03-23 22:25:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4431 ms
[2023-03-23 22:25:41] [INFO ] After 13512ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1677 ms.
[2023-03-23 22:25:43] [INFO ] After 20302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 25 out of 4013 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4013/4013 places, 8960/8960 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4013 transition count 8959
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4012 transition count 8959
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 4011 transition count 8958
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 4011 transition count 8958
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 4011 transition count 8957
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4010 transition count 8957
Applied a total of 6 rules in 806 ms. Remains 4010 /4013 variables (removed 3) and now considering 8957/8960 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 807 ms. Remains : 4010/4013 places, 8957/8960 transitions.
Incomplete random walk after 10000 steps, including 395 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 25282 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25282 steps, saw 11472 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 22:25:47] [INFO ] Flow matrix only has 8071 transitions (discarded 886 similar events)
// Phase 1: matrix 8071 rows 4010 cols
[2023-03-23 22:25:48] [INFO ] Computed 885 place invariants in 205 ms
[2023-03-23 22:25:48] [INFO ] [Real]Absence check using 49 positive place invariants in 127 ms returned sat
[2023-03-23 22:25:48] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 212 ms returned sat
[2023-03-23 22:25:51] [INFO ] After 3794ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 22:25:52] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2023-03-23 22:25:52] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 220 ms returned sat
[2023-03-23 22:25:57] [INFO ] After 4315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 22:25:57] [INFO ] State equation strengthened by 4402 read => feed constraints.
[2023-03-23 22:25:59] [INFO ] After 2835ms SMT Verify possible using 4402 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 22:26:04] [INFO ] Deduced a trap composed of 291 places in 3952 ms of which 4 ms to minimize.
[2023-03-23 22:26:09] [INFO ] Deduced a trap composed of 289 places in 3824 ms of which 13 ms to minimize.
[2023-03-23 22:26:13] [INFO ] Deduced a trap composed of 297 places in 3855 ms of which 4 ms to minimize.
[2023-03-23 22:26:17] [INFO ] Deduced a trap composed of 227 places in 3861 ms of which 4 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:26:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 22:26:17] [INFO ] After 25787ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 8 ms.
Support contains 25 out of 4010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4010/4010 places, 8957/8957 transitions.
Applied a total of 0 rules in 468 ms. Remains 4010 /4010 variables (removed 0) and now considering 8957/8957 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 468 ms. Remains : 4010/4010 places, 8957/8957 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4010/4010 places, 8957/8957 transitions.
Applied a total of 0 rules in 465 ms. Remains 4010 /4010 variables (removed 0) and now considering 8957/8957 (removed 0) transitions.
[2023-03-23 22:26:18] [INFO ] Flow matrix only has 8071 transitions (discarded 886 similar events)
[2023-03-23 22:26:18] [INFO ] Invariant cache hit.
[2023-03-23 22:26:23] [INFO ] Implicit Places using invariants in 4800 ms returned []
[2023-03-23 22:26:23] [INFO ] Flow matrix only has 8071 transitions (discarded 886 similar events)
[2023-03-23 22:26:23] [INFO ] Invariant cache hit.
[2023-03-23 22:26:28] [INFO ] Implicit Places using invariants and state equation in 4714 ms returned []
Implicit Place search using SMT with State Equation took 9516 ms to find 0 implicit places.
[2023-03-23 22:26:29] [INFO ] Redundant transitions in 1130 ms returned []
[2023-03-23 22:26:29] [INFO ] Flow matrix only has 8071 transitions (discarded 886 similar events)
[2023-03-23 22:26:29] [INFO ] Invariant cache hit.
[2023-03-23 22:26:34] [INFO ] Dead Transitions using invariants and state equation in 4970 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16094 ms. Remains : 4010/4010 places, 8957/8957 transitions.
Graph (trivial) has 3221 edges and 4010 vertex of which 25 / 4010 are part of one of the 1 SCC in 19 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 24081 edges and 3986 vertex of which 3964 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 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 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 241 rules applied. Total rules applied 243 place count 3578 transition count 7230
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 238 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 1 with 717 rules applied. Total rules applied 960 place count 3338 transition count 6753
Ensure Unique test removed 1 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 238 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 675 rules applied. Total rules applied 1635 place count 3099 transition count 6317
Ensure Unique test removed 40 places
Reduce places removed 238 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 3 with 632 rules applied. Total rules applied 2267 place count 2861 transition count 5923
Ensure Unique test removed 2 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 196 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 4 with 553 rules applied. Total rules applied 2820 place count 2663 transition count 5568
Ensure Unique test removed 36 places
Reduce places removed 195 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 157 transitions
Reduce isomorphic transitions removed 159 transitions.
Drop transitions removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 5 with 511 rules applied. Total rules applied 3331 place count 2468 transition count 5252
Ensure Unique test removed 2 places
Reduce places removed 159 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 157 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 6 with 441 rules applied. Total rules applied 3772 place count 2309 transition count 4970
Ensure Unique test removed 32 places
Reduce places removed 157 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 123 transitions
Reduce isomorphic transitions removed 125 transitions.
Drop transitions removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 7 with 405 rules applied. Total rules applied 4177 place count 2152 transition count 4722
Ensure Unique test removed 2 places
Reduce places removed 125 places and 0 transitions.
Drop transitions removed 25 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 123 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 8 with 345 rules applied. Total rules applied 4522 place count 2027 transition count 4502
Ensure Unique test removed 25 places
Reduce places removed 122 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 9 with 314 rules applied. Total rules applied 4836 place count 1905 transition count 4310
Ensure Unique test removed 2 places
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 10 with 263 rules applied. Total rules applied 5099 place count 1808 transition count 4144
Ensure Unique test removed 24 places
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 11 with 235 rules applied. Total rules applied 5334 place count 1713 transition count 4004
Ensure Unique test removed 2 places
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 19 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 190 rules applied. Total rules applied 5524 place count 1642 transition count 3885
Ensure Unique test removed 19 places
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 167 rules applied. Total rules applied 5691 place count 1573 transition count 3787
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5821 place count 1523 transition count 3707
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 5931 place count 1475 transition count 3645
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6011 place count 1443 transition count 3597
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6075 place count 1413 transition count 3563
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6117 place count 1395 transition count 3539
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6147 place count 1379 transition count 3525
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6163 place count 1371 transition count 3517
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 21 with 10 rules applied. Total rules applied 6173 place count 1365 transition count 3513
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 6179 place count 1361 transition count 3511
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 200 Pre rules applied. Total rules applied 6179 place count 1361 transition count 3311
Deduced a syphon composed of 200 places in 0 ms
Ensure Unique test removed 195 places
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 23 with 595 rules applied. Total rules applied 6774 place count 966 transition count 3311
Discarding 211 places :
Symmetric choice reduction at 23 with 211 rule applications. Total rules 6985 place count 755 transition count 3100
Iterating global reduction 23 with 211 rules applied. Total rules applied 7196 place count 755 transition count 3100
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 7196 place count 755 transition count 3099
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 7198 place count 754 transition count 3099
Discarding 500 places :
Symmetric choice reduction at 23 with 500 rule applications. Total rules 7698 place count 254 transition count 1099
Iterating global reduction 23 with 500 rules applied. Total rules applied 8198 place count 254 transition count 1099
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 23 with 500 rules applied. Total rules applied 8698 place count 254 transition count 599
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 24 with 72 rules applied. Total rules applied 8770 place count 218 transition count 563
Drop transitions removed 10 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 24 with 12 rules applied. Total rules applied 8782 place count 218 transition count 551
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 25 with 5 rules applied. Total rules applied 8787 place count 218 transition count 546
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 25 with 4 rules applied. Total rules applied 8791 place count 218 transition count 542
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 8795 place count 214 transition count 542
Partial Free-agglomeration rule applied 332 times.
Drop transitions removed 332 transitions
Iterating global reduction 26 with 332 rules applied. Total rules applied 9127 place count 214 transition count 542
Discarding 21 places :
Symmetric choice reduction at 26 with 21 rule applications. Total rules 9148 place count 193 transition count 458
Iterating global reduction 26 with 21 rules applied. Total rules applied 9169 place count 193 transition count 458
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 26 with 21 rules applied. Total rules applied 9190 place count 193 transition count 437
Applied a total of 9190 rules in 4413 ms. Remains 193 /4010 variables (removed 3817) and now considering 437/8957 (removed 8520) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 437 rows 193 cols
[2023-03-23 22:26:38] [INFO ] Computed 45 place invariants in 10 ms
[2023-03-23 22:26:38] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-23 22:26:38] [INFO ] [Real]Absence check using 4 positive and 41 generalized place invariants in 8 ms returned sat
[2023-03-23 22:26:38] [INFO ] After 103ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-23 22:26:38] [INFO ] After 122ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-23 22:26:38] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-23 22:26:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-23 22:26:38] [INFO ] [Nat]Absence check using 4 positive and 41 generalized place invariants in 7 ms returned sat
[2023-03-23 22:26:39] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 22:26:39] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-23 22:26:39] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-23 22:26:39] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-23 22:26:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4010 places, 8957 transitions and 51399 arcs took 50 ms.
[2023-03-23 22:26:40] [INFO ] Flatten gal took : 555 ms
Total runtime 167473 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: 4010 NrTr: 8957 NrArc: 51399)

parse formulas
formulas created successfully
place and transition orderings generation:0m 5.032sec

net check time: 0m 0.015sec

init dd package: 0m 2.679sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 10108468 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16078612 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.327sec

42508 69591 93890 166333 223118

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-S24C04"
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-S24C04, 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-167856420900823"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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