Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978600159.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVs-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978600159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 625K Mar 5 18:23 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 ShieldRVs-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679344395796

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=ShieldRVs-PT-050B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 20:33:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 20:33:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 20:33:17] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2023-03-20 20:33:17] [INFO ] Transformed 2003 places.
[2023-03-20 20:33:17] [INFO ] Transformed 2253 transitions.
[2023-03-20 20:33:17] [INFO ] Found NUPN structural information;
[2023-03-20 20:33:17] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 16) seen :12
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2253 rows 2003 cols
[2023-03-20 20:33:18] [INFO ] Computed 201 place invariants in 28 ms
[2023-03-20 20:33:19] [INFO ] [Real]Absence check using 201 positive place invariants in 63 ms returned sat
[2023-03-20 20:33:19] [INFO ] After 759ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 20:33:19] [INFO ] [Nat]Absence check using 201 positive place invariants in 57 ms returned sat
[2023-03-20 20:33:24] [INFO ] After 5131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 20:33:25] [INFO ] Deduced a trap composed of 24 places in 616 ms of which 34 ms to minimize.
[2023-03-20 20:33:26] [INFO ] Deduced a trap composed of 30 places in 579 ms of which 2 ms to minimize.
[2023-03-20 20:33:27] [INFO ] Deduced a trap composed of 37 places in 558 ms of which 1 ms to minimize.
[2023-03-20 20:33:27] [INFO ] Deduced a trap composed of 17 places in 535 ms of which 3 ms to minimize.
[2023-03-20 20:33:28] [INFO ] Deduced a trap composed of 36 places in 483 ms of which 2 ms to minimize.
[2023-03-20 20:33:28] [INFO ] Deduced a trap composed of 42 places in 471 ms of which 1 ms to minimize.
[2023-03-20 20:33:29] [INFO ] Deduced a trap composed of 35 places in 465 ms of which 1 ms to minimize.
[2023-03-20 20:33:29] [INFO ] Deduced a trap composed of 38 places in 400 ms of which 1 ms to minimize.
[2023-03-20 20:33:30] [INFO ] Deduced a trap composed of 44 places in 437 ms of which 1 ms to minimize.
[2023-03-20 20:33:30] [INFO ] Deduced a trap composed of 23 places in 402 ms of which 1 ms to minimize.
[2023-03-20 20:33:31] [INFO ] Deduced a trap composed of 19 places in 442 ms of which 1 ms to minimize.
[2023-03-20 20:33:31] [INFO ] Deduced a trap composed of 24 places in 391 ms of which 1 ms to minimize.
[2023-03-20 20:33:32] [INFO ] Deduced a trap composed of 32 places in 453 ms of which 1 ms to minimize.
[2023-03-20 20:33:32] [INFO ] Deduced a trap composed of 37 places in 426 ms of which 2 ms to minimize.
[2023-03-20 20:33:33] [INFO ] Deduced a trap composed of 21 places in 457 ms of which 1 ms to minimize.
[2023-03-20 20:33:33] [INFO ] Deduced a trap composed of 54 places in 468 ms of which 1 ms to minimize.
[2023-03-20 20:33:34] [INFO ] Deduced a trap composed of 37 places in 462 ms of which 1 ms to minimize.
[2023-03-20 20:33:35] [INFO ] Deduced a trap composed of 43 places in 484 ms of which 2 ms to minimize.
[2023-03-20 20:33:35] [INFO ] Deduced a trap composed of 25 places in 422 ms of which 1 ms to minimize.
[2023-03-20 20:33:36] [INFO ] Deduced a trap composed of 47 places in 358 ms of which 1 ms to minimize.
[2023-03-20 20:33:36] [INFO ] Deduced a trap composed of 60 places in 341 ms of which 1 ms to minimize.
[2023-03-20 20:33:36] [INFO ] Deduced a trap composed of 37 places in 367 ms of which 1 ms to minimize.
[2023-03-20 20:33:37] [INFO ] Deduced a trap composed of 39 places in 345 ms of which 1 ms to minimize.
[2023-03-20 20:33:37] [INFO ] Deduced a trap composed of 39 places in 412 ms of which 1 ms to minimize.
[2023-03-20 20:33:38] [INFO ] Deduced a trap composed of 26 places in 413 ms of which 1 ms to minimize.
[2023-03-20 20:33:38] [INFO ] Deduced a trap composed of 38 places in 434 ms of which 1 ms to minimize.
[2023-03-20 20:33:39] [INFO ] Deduced a trap composed of 44 places in 431 ms of which 1 ms to minimize.
[2023-03-20 20:33:39] [INFO ] Deduced a trap composed of 42 places in 355 ms of which 2 ms to minimize.
[2023-03-20 20:33:40] [INFO ] Deduced a trap composed of 43 places in 383 ms of which 1 ms to minimize.
[2023-03-20 20:33:40] [INFO ] Deduced a trap composed of 37 places in 409 ms of which 1 ms to minimize.
[2023-03-20 20:33:41] [INFO ] Deduced a trap composed of 54 places in 384 ms of which 1 ms to minimize.
[2023-03-20 20:33:41] [INFO ] Deduced a trap composed of 46 places in 384 ms of which 1 ms to minimize.
[2023-03-20 20:33:42] [INFO ] Deduced a trap composed of 36 places in 378 ms of which 1 ms to minimize.
[2023-03-20 20:33:42] [INFO ] Deduced a trap composed of 42 places in 353 ms of which 4 ms to minimize.
[2023-03-20 20:33:42] [INFO ] Deduced a trap composed of 57 places in 350 ms of which 1 ms to minimize.
[2023-03-20 20:33:43] [INFO ] Deduced a trap composed of 49 places in 408 ms of which 1 ms to minimize.
[2023-03-20 20:33:43] [INFO ] Deduced a trap composed of 64 places in 406 ms of which 1 ms to minimize.
[2023-03-20 20:33:44] [INFO ] Deduced a trap composed of 52 places in 320 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 20:33:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:33:44] [INFO ] After 25051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 351 ms.
Support contains 133 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Drop transitions removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 2003 transition count 2080
Reduce places removed 173 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 180 rules applied. Total rules applied 353 place count 1830 transition count 2073
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 360 place count 1823 transition count 2073
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 240 Pre rules applied. Total rules applied 360 place count 1823 transition count 1833
Deduced a syphon composed of 240 places in 6 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 3 with 480 rules applied. Total rules applied 840 place count 1583 transition count 1833
Discarding 317 places :
Symmetric choice reduction at 3 with 317 rule applications. Total rules 1157 place count 1266 transition count 1516
Iterating global reduction 3 with 317 rules applied. Total rules applied 1474 place count 1266 transition count 1516
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 1474 place count 1266 transition count 1408
Deduced a syphon composed of 108 places in 8 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 1690 place count 1158 transition count 1408
Performed 329 Post agglomeration using F-continuation condition.Transition count delta: 329
Deduced a syphon composed of 329 places in 6 ms
Reduce places removed 329 places and 0 transitions.
Iterating global reduction 3 with 658 rules applied. Total rules applied 2348 place count 829 transition count 1079
Partial Free-agglomeration rule applied 89 times.
Drop transitions removed 89 transitions
Iterating global reduction 3 with 89 rules applied. Total rules applied 2437 place count 829 transition count 1079
Applied a total of 2437 rules in 606 ms. Remains 829 /2003 variables (removed 1174) and now considering 1079/2253 (removed 1174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 607 ms. Remains : 829/2003 places, 1079/2253 transitions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 4) seen :1
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1079 rows 829 cols
[2023-03-20 20:33:45] [INFO ] Computed 201 place invariants in 6 ms
[2023-03-20 20:33:45] [INFO ] [Real]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-20 20:33:45] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 20:33:46] [INFO ] [Nat]Absence check using 201 positive place invariants in 32 ms returned sat
[2023-03-20 20:33:46] [INFO ] After 859ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 20:33:47] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 1 ms to minimize.
[2023-03-20 20:33:47] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 1 ms to minimize.
[2023-03-20 20:33:47] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
[2023-03-20 20:33:47] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2023-03-20 20:33:47] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2023-03-20 20:33:48] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2023-03-20 20:33:48] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 0 ms to minimize.
[2023-03-20 20:33:48] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2023-03-20 20:33:48] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
[2023-03-20 20:33:48] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 1 ms to minimize.
[2023-03-20 20:33:48] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2016 ms
[2023-03-20 20:33:49] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 1 ms to minimize.
[2023-03-20 20:33:49] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 0 ms to minimize.
[2023-03-20 20:33:49] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 1 ms to minimize.
[2023-03-20 20:33:49] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 1 ms to minimize.
[2023-03-20 20:33:50] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 1 ms to minimize.
[2023-03-20 20:33:50] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2023-03-20 20:33:50] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 1 ms to minimize.
[2023-03-20 20:33:50] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 3 ms to minimize.
[2023-03-20 20:33:50] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 0 ms to minimize.
[2023-03-20 20:33:51] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2023-03-20 20:33:51] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 0 ms to minimize.
[2023-03-20 20:33:51] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 0 ms to minimize.
[2023-03-20 20:33:51] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 0 ms to minimize.
[2023-03-20 20:33:51] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2023-03-20 20:33:51] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2023-03-20 20:33:52] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
[2023-03-20 20:33:52] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2023-03-20 20:33:52] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 3 ms to minimize.
[2023-03-20 20:33:52] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 0 ms to minimize.
[2023-03-20 20:33:52] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 3 ms to minimize.
[2023-03-20 20:33:52] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2023-03-20 20:33:53] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2023-03-20 20:33:53] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2023-03-20 20:33:53] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2023-03-20 20:33:53] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2023-03-20 20:33:53] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2023-03-20 20:33:53] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 4534 ms
[2023-03-20 20:33:54] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2023-03-20 20:33:54] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 1 ms to minimize.
[2023-03-20 20:33:54] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 0 ms to minimize.
[2023-03-20 20:33:54] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 0 ms to minimize.
[2023-03-20 20:33:55] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 0 ms to minimize.
[2023-03-20 20:33:55] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2023-03-20 20:33:55] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 1 ms to minimize.
[2023-03-20 20:33:55] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 1 ms to minimize.
[2023-03-20 20:33:56] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2023-03-20 20:33:56] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-20 20:33:56] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 0 ms to minimize.
[2023-03-20 20:33:56] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 0 ms to minimize.
[2023-03-20 20:33:56] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2023-03-20 20:33:57] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2023-03-20 20:33:57] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2023-03-20 20:33:57] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
[2023-03-20 20:33:57] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2023-03-20 20:33:57] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2023-03-20 20:33:58] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 1 ms to minimize.
[2023-03-20 20:33:58] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2023-03-20 20:33:58] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2023-03-20 20:33:58] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2023-03-20 20:33:58] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 0 ms to minimize.
[2023-03-20 20:33:58] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2023-03-20 20:33:59] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2023-03-20 20:33:59] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2023-03-20 20:33:59] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2023-03-20 20:33:59] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2023-03-20 20:33:59] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 5597 ms
[2023-03-20 20:33:59] [INFO ] After 13593ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 668 ms.
[2023-03-20 20:34:00] [INFO ] After 14450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 101 ms.
Support contains 130 out of 829 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 829/829 places, 1079/1079 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 829 transition count 1078
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 828 transition count 1078
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 827 transition count 1077
Applied a total of 4 rules in 100 ms. Remains 827 /829 variables (removed 2) and now considering 1077/1079 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 827/829 places, 1077/1079 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 1077 rows 827 cols
[2023-03-20 20:34:01] [INFO ] Computed 201 place invariants in 6 ms
[2023-03-20 20:34:01] [INFO ] [Real]Absence check using 201 positive place invariants in 37 ms returned sat
[2023-03-20 20:34:01] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 20:34:01] [INFO ] [Nat]Absence check using 201 positive place invariants in 35 ms returned sat
[2023-03-20 20:34:02] [INFO ] After 567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 20:34:02] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 0 ms to minimize.
[2023-03-20 20:34:02] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 0 ms to minimize.
[2023-03-20 20:34:02] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2023-03-20 20:34:02] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 1 ms to minimize.
[2023-03-20 20:34:03] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2023-03-20 20:34:03] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2023-03-20 20:34:03] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2023-03-20 20:34:03] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2023-03-20 20:34:03] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2023-03-20 20:34:03] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2023-03-20 20:34:03] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2023-03-20 20:34:04] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2023-03-20 20:34:04] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2023-03-20 20:34:04] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2023-03-20 20:34:04] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 0 ms to minimize.
[2023-03-20 20:34:04] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 1 ms to minimize.
[2023-03-20 20:34:04] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2023-03-20 20:34:04] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2023-03-20 20:34:05] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2023-03-20 20:34:05] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
[2023-03-20 20:34:05] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2023-03-20 20:34:05] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2023-03-20 20:34:05] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2023-03-20 20:34:05] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3183 ms
[2023-03-20 20:34:05] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 0 ms to minimize.
[2023-03-20 20:34:05] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2023-03-20 20:34:06] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2023-03-20 20:34:06] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-20 20:34:06] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 0 ms to minimize.
[2023-03-20 20:34:06] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2023-03-20 20:34:06] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2023-03-20 20:34:06] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2023-03-20 20:34:06] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2023-03-20 20:34:07] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 0 ms to minimize.
[2023-03-20 20:34:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1639 ms
[2023-03-20 20:34:07] [INFO ] After 5570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 274 ms.
[2023-03-20 20:34:07] [INFO ] After 6041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 41 ms.
Support contains 51 out of 827 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 827/827 places, 1077/1077 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 827 transition count 1070
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 820 transition count 1070
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 14 place count 820 transition count 1054
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 46 place count 804 transition count 1054
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 803 transition count 1053
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 803 transition count 1053
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 48 place count 803 transition count 1052
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 802 transition count 1052
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 2 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 154 place count 750 transition count 1000
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 162 place count 750 transition count 1000
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 163 place count 749 transition count 999
Applied a total of 163 rules in 229 ms. Remains 749 /827 variables (removed 78) and now considering 999/1077 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 749/827 places, 999/1077 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 191067 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 191067 steps, saw 53499 distinct states, run finished after 3003 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 999 rows 749 cols
[2023-03-20 20:34:11] [INFO ] Computed 201 place invariants in 11 ms
[2023-03-20 20:34:11] [INFO ] [Real]Absence check using 201 positive place invariants in 24 ms returned sat
[2023-03-20 20:34:11] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 20:34:11] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-20 20:34:11] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 20:34:11] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 1 ms to minimize.
[2023-03-20 20:34:12] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 0 ms to minimize.
[2023-03-20 20:34:12] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2023-03-20 20:34:12] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 0 ms to minimize.
[2023-03-20 20:34:12] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2023-03-20 20:34:12] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2023-03-20 20:34:12] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 1 ms to minimize.
[2023-03-20 20:34:13] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 1 ms to minimize.
[2023-03-20 20:34:13] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 0 ms to minimize.
[2023-03-20 20:34:13] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2023-03-20 20:34:13] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 0 ms to minimize.
[2023-03-20 20:34:13] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2023-03-20 20:34:14] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 1 ms to minimize.
[2023-03-20 20:34:14] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 1 ms to minimize.
[2023-03-20 20:34:14] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 0 ms to minimize.
[2023-03-20 20:34:14] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2023-03-20 20:34:14] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2023-03-20 20:34:14] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2963 ms
[2023-03-20 20:34:14] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2023-03-20 20:34:15] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2023-03-20 20:34:15] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2023-03-20 20:34:15] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2023-03-20 20:34:15] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2023-03-20 20:34:15] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2023-03-20 20:34:15] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2023-03-20 20:34:15] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 0 ms to minimize.
[2023-03-20 20:34:16] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2023-03-20 20:34:16] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2023-03-20 20:34:16] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2023-03-20 20:34:16] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2023-03-20 20:34:16] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2023-03-20 20:34:16] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1814 ms
[2023-03-20 20:34:16] [INFO ] After 5322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-20 20:34:16] [INFO ] After 5620ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 52 ms.
Support contains 51 out of 749 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 999/999 transitions.
Applied a total of 0 rules in 42 ms. Remains 749 /749 variables (removed 0) and now considering 999/999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 749/749 places, 999/999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 999/999 transitions.
Applied a total of 0 rules in 34 ms. Remains 749 /749 variables (removed 0) and now considering 999/999 (removed 0) transitions.
[2023-03-20 20:34:16] [INFO ] Invariant cache hit.
[2023-03-20 20:34:17] [INFO ] Implicit Places using invariants in 702 ms returned []
[2023-03-20 20:34:17] [INFO ] Invariant cache hit.
[2023-03-20 20:34:18] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
[2023-03-20 20:34:18] [INFO ] Redundant transitions in 233 ms returned []
[2023-03-20 20:34:18] [INFO ] Invariant cache hit.
[2023-03-20 20:34:19] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2286 ms. Remains : 749/749 places, 999/999 transitions.
Applied a total of 0 rules in 21 ms. Remains 749 /749 variables (removed 0) and now considering 999/999 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 20:34:19] [INFO ] Invariant cache hit.
[2023-03-20 20:34:19] [INFO ] [Real]Absence check using 201 positive place invariants in 21 ms returned sat
[2023-03-20 20:34:19] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 20:34:19] [INFO ] [Nat]Absence check using 201 positive place invariants in 20 ms returned sat
[2023-03-20 20:34:19] [INFO ] After 342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 20:34:19] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 0 ms to minimize.
[2023-03-20 20:34:20] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2023-03-20 20:34:20] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
[2023-03-20 20:34:20] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2023-03-20 20:34:20] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 0 ms to minimize.
[2023-03-20 20:34:20] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 0 ms to minimize.
[2023-03-20 20:34:20] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2023-03-20 20:34:20] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 1 ms to minimize.
[2023-03-20 20:34:21] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2023-03-20 20:34:21] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 1 ms to minimize.
[2023-03-20 20:34:21] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2023-03-20 20:34:21] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2023-03-20 20:34:21] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2023-03-20 20:34:21] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2023-03-20 20:34:21] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2023-03-20 20:34:21] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2023-03-20 20:34:21] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2166 ms
[2023-03-20 20:34:22] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 1 ms to minimize.
[2023-03-20 20:34:22] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
[2023-03-20 20:34:22] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 0 ms to minimize.
[2023-03-20 20:34:22] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2023-03-20 20:34:23] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2023-03-20 20:34:23] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2023-03-20 20:34:23] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 0 ms to minimize.
[2023-03-20 20:34:23] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 0 ms to minimize.
[2023-03-20 20:34:23] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2023-03-20 20:34:23] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2023-03-20 20:34:23] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2023-03-20 20:34:24] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2023-03-20 20:34:24] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2071 ms
[2023-03-20 20:34:24] [INFO ] After 4759ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-20 20:34:24] [INFO ] After 5034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 20:34:24] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2023-03-20 20:34:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 749 places, 999 transitions and 4687 arcs took 11 ms.
[2023-03-20 20:34:24] [INFO ] Flatten gal took : 163 ms
Total runtime 67182 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: ShieldRVs_PT_050B
(NrP: 749 NrTr: 999 NrArc: 4687)

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

net check time: 0m 0.000sec

init dd package: 0m 3.059sec


before gc: list nodes free: 1200306

after gc: idd nodes used:802218, unused:63197782; list nodes free:283785524

before gc: list nodes free: 575997

after gc: idd nodes used:1169718, unused:62830282; list nodes free:284242086

before gc: list nodes free: 165457

after gc: idd nodes used:1331186, unused:62668814; list nodes free:283497356

before gc: list nodes free: 113426

after gc: idd nodes used:1456008, unused:62543992; list nodes free:282921613

before gc: list nodes free: 1018286

after gc: idd nodes used:1636402, unused:62363598; list nodes free:282129838

before gc: list nodes free: 481985

after gc: idd nodes used:1653154, unused:62346846; list nodes free:282040369
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6193460 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098600 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.004sec

438186 622858 805746 1017144 928048 1109680 1171800 1328970 1243222 1411710 1539808 1615748 1755222 1757644 1804976

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="ShieldRVs-PT-050B"
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 ShieldRVs-PT-050B, 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 r426-tajo-167905978600159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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