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

About the Execution of LoLa+red for ShieldRVs-PT-050B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
475.640 66890.00 91939.00 102.20 TTFFFTTFTTTTTFFT normal

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.r423-tajo-167905976300159.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 lolaxred
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 r423-tajo-167905976300159
=====================================================================

--------------------
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 1679243203897

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=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 16:26:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 16:26:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:26:46] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2023-03-19 16:26:46] [INFO ] Transformed 2003 places.
[2023-03-19 16:26:46] [INFO ] Transformed 2253 transitions.
[2023-03-19 16:26:46] [INFO ] Found NUPN structural information;
[2023-03-19 16:26:46] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 420 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 508 ms. (steps per millisecond=19 ) properties (out of 16) seen :11
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-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 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2253 rows 2003 cols
[2023-03-19 16:26:47] [INFO ] Computed 201 place invariants in 43 ms
[2023-03-19 16:26:48] [INFO ] [Real]Absence check using 201 positive place invariants in 71 ms returned sat
[2023-03-19 16:26:48] [INFO ] After 872ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 16:26:48] [INFO ] [Nat]Absence check using 201 positive place invariants in 58 ms returned sat
[2023-03-19 16:26:52] [INFO ] After 4001ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 16:26:53] [INFO ] Deduced a trap composed of 27 places in 680 ms of which 8 ms to minimize.
[2023-03-19 16:26:54] [INFO ] Deduced a trap composed of 25 places in 771 ms of which 2 ms to minimize.
[2023-03-19 16:26:55] [INFO ] Deduced a trap composed of 25 places in 704 ms of which 2 ms to minimize.
[2023-03-19 16:26:56] [INFO ] Deduced a trap composed of 25 places in 655 ms of which 3 ms to minimize.
[2023-03-19 16:26:56] [INFO ] Deduced a trap composed of 28 places in 661 ms of which 2 ms to minimize.
[2023-03-19 16:26:57] [INFO ] Deduced a trap composed of 40 places in 634 ms of which 1 ms to minimize.
[2023-03-19 16:26:58] [INFO ] Deduced a trap composed of 18 places in 651 ms of which 1 ms to minimize.
[2023-03-19 16:26:59] [INFO ] Deduced a trap composed of 33 places in 693 ms of which 1 ms to minimize.
[2023-03-19 16:26:59] [INFO ] Deduced a trap composed of 36 places in 625 ms of which 2 ms to minimize.
[2023-03-19 16:27:00] [INFO ] Deduced a trap composed of 40 places in 654 ms of which 1 ms to minimize.
[2023-03-19 16:27:01] [INFO ] Deduced a trap composed of 30 places in 653 ms of which 1 ms to minimize.
[2023-03-19 16:27:02] [INFO ] Deduced a trap composed of 33 places in 657 ms of which 2 ms to minimize.
[2023-03-19 16:27:02] [INFO ] Deduced a trap composed of 22 places in 639 ms of which 2 ms to minimize.
[2023-03-19 16:27:03] [INFO ] Deduced a trap composed of 34 places in 612 ms of which 2 ms to minimize.
[2023-03-19 16:27:04] [INFO ] Deduced a trap composed of 47 places in 628 ms of which 1 ms to minimize.
[2023-03-19 16:27:04] [INFO ] Deduced a trap composed of 46 places in 656 ms of which 2 ms to minimize.
[2023-03-19 16:27:06] [INFO ] Deduced a trap composed of 32 places in 1023 ms of which 2 ms to minimize.
[2023-03-19 16:27:07] [INFO ] Deduced a trap composed of 30 places in 928 ms of which 1 ms to minimize.
[2023-03-19 16:27:08] [INFO ] Deduced a trap composed of 44 places in 902 ms of which 2 ms to minimize.
[2023-03-19 16:27:09] [INFO ] Deduced a trap composed of 25 places in 847 ms of which 3 ms to minimize.
[2023-03-19 16:27:10] [INFO ] Deduced a trap composed of 25 places in 1029 ms of which 2 ms to minimize.
[2023-03-19 16:27:11] [INFO ] Deduced a trap composed of 24 places in 885 ms of which 2 ms to minimize.
[2023-03-19 16:27:12] [INFO ] Deduced a trap composed of 33 places in 866 ms of which 1 ms to minimize.
[2023-03-19 16:27:13] [INFO ] Deduced a trap composed of 28 places in 691 ms of which 2 ms to minimize.
[2023-03-19 16:27:14] [INFO ] Deduced a trap composed of 24 places in 915 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 16:27:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 16:27:14] [INFO ] After 25935ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 354 ms.
Support contains 134 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 5 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 316 places :
Symmetric choice reduction at 3 with 316 rule applications. Total rules 1156 place count 1267 transition count 1517
Iterating global reduction 3 with 316 rules applied. Total rules applied 1472 place count 1267 transition count 1517
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 1472 place count 1267 transition count 1409
Deduced a syphon composed of 108 places in 10 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 1688 place count 1159 transition count 1409
Performed 329 Post agglomeration using F-continuation condition.Transition count delta: 329
Deduced a syphon composed of 329 places in 7 ms
Reduce places removed 329 places and 0 transitions.
Iterating global reduction 3 with 658 rules applied. Total rules applied 2346 place count 830 transition count 1080
Partial Free-agglomeration rule applied 89 times.
Drop transitions removed 89 transitions
Iterating global reduction 3 with 89 rules applied. Total rules applied 2435 place count 830 transition count 1080
Applied a total of 2435 rules in 624 ms. Remains 830 /2003 variables (removed 1173) and now considering 1080/2253 (removed 1173) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 624 ms. Remains : 830/2003 places, 1080/2253 transitions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 5) seen :2
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) 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 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1080 rows 830 cols
[2023-03-19 16:27:15] [INFO ] Computed 201 place invariants in 10 ms
[2023-03-19 16:27:15] [INFO ] [Real]Absence check using 201 positive place invariants in 35 ms returned sat
[2023-03-19 16:27:15] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 16:27:15] [INFO ] [Nat]Absence check using 201 positive place invariants in 28 ms returned sat
[2023-03-19 16:27:16] [INFO ] After 783ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 16:27:17] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2023-03-19 16:27:17] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2023-03-19 16:27:17] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2023-03-19 16:27:17] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 0 ms to minimize.
[2023-03-19 16:27:17] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 1 ms to minimize.
[2023-03-19 16:27:18] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 0 ms to minimize.
[2023-03-19 16:27:18] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2023-03-19 16:27:18] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2023-03-19 16:27:18] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2023-03-19 16:27:18] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2023-03-19 16:27:18] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2023-03-19 16:27:19] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 0 ms to minimize.
[2023-03-19 16:27:19] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2023-03-19 16:27:19] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 1 ms to minimize.
[2023-03-19 16:27:19] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 2 ms to minimize.
[2023-03-19 16:27:19] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2023-03-19 16:27:19] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2023-03-19 16:27:20] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2023-03-19 16:27:20] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 0 ms to minimize.
[2023-03-19 16:27:20] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2023-03-19 16:27:20] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2023-03-19 16:27:20] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3830 ms
[2023-03-19 16:27:20] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 0 ms to minimize.
[2023-03-19 16:27:21] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2023-03-19 16:27:21] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 0 ms to minimize.
[2023-03-19 16:27:21] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2023-03-19 16:27:21] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2023-03-19 16:27:21] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 0 ms to minimize.
[2023-03-19 16:27:21] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 1 ms to minimize.
[2023-03-19 16:27:22] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2023-03-19 16:27:22] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2023-03-19 16:27:22] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 13 ms to minimize.
[2023-03-19 16:27:22] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 0 ms to minimize.
[2023-03-19 16:27:22] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 0 ms to minimize.
[2023-03-19 16:27:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2075 ms
[2023-03-19 16:27:23] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2023-03-19 16:27:23] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 0 ms to minimize.
[2023-03-19 16:27:23] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 0 ms to minimize.
[2023-03-19 16:27:24] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 0 ms to minimize.
[2023-03-19 16:27:24] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2023-03-19 16:27:24] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 1 ms to minimize.
[2023-03-19 16:27:24] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
[2023-03-19 16:27:25] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 5 ms to minimize.
[2023-03-19 16:27:25] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 0 ms to minimize.
[2023-03-19 16:27:25] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 0 ms to minimize.
[2023-03-19 16:27:25] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 2 ms to minimize.
[2023-03-19 16:27:25] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 0 ms to minimize.
[2023-03-19 16:27:26] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 1 ms to minimize.
[2023-03-19 16:27:26] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 0 ms to minimize.
[2023-03-19 16:27:26] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2023-03-19 16:27:26] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 0 ms to minimize.
[2023-03-19 16:27:27] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2023-03-19 16:27:27] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 0 ms to minimize.
[2023-03-19 16:27:27] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2023-03-19 16:27:27] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 0 ms to minimize.
[2023-03-19 16:27:27] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2023-03-19 16:27:28] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2023-03-19 16:27:28] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2023-03-19 16:27:28] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 1 ms to minimize.
[2023-03-19 16:27:28] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5349 ms
[2023-03-19 16:27:28] [INFO ] After 12583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 596 ms.
[2023-03-19 16:27:29] [INFO ] After 13360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 116 ms.
Support contains 130 out of 830 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 830/830 places, 1080/1080 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 830 transition count 1079
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 2 place count 829 transition count 1079
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 0 with 4 rules applied. Total rules applied 6 place count 827 transition count 1077
Applied a total of 6 rules in 204 ms. Remains 827 /830 variables (removed 3) and now considering 1077/1080 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 827/830 places, 1077/1080 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) 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-19 16:27:29] [INFO ] Computed 201 place invariants in 17 ms
[2023-03-19 16:27:30] [INFO ] [Real]Absence check using 201 positive place invariants in 37 ms returned sat
[2023-03-19 16:27:30] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:27:30] [INFO ] [Nat]Absence check using 201 positive place invariants in 30 ms returned sat
[2023-03-19 16:27:30] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:27:30] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 0 ms to minimize.
[2023-03-19 16:27:31] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2023-03-19 16:27:31] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2023-03-19 16:27:31] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2023-03-19 16:27:31] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2023-03-19 16:27:31] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2023-03-19 16:27:31] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 1 ms to minimize.
[2023-03-19 16:27:31] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 0 ms to minimize.
[2023-03-19 16:27:32] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2023-03-19 16:27:32] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2023-03-19 16:27:32] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2023-03-19 16:27:32] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2023-03-19 16:27:32] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1766 ms
[2023-03-19 16:27:32] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 0 ms to minimize.
[2023-03-19 16:27:33] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2023-03-19 16:27:33] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2023-03-19 16:27:33] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 0 ms to minimize.
[2023-03-19 16:27:33] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2023-03-19 16:27:33] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 1 ms to minimize.
[2023-03-19 16:27:34] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 0 ms to minimize.
[2023-03-19 16:27:34] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 0 ms to minimize.
[2023-03-19 16:27:34] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2023-03-19 16:27:34] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 0 ms to minimize.
[2023-03-19 16:27:34] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2023-03-19 16:27:35] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 0 ms to minimize.
[2023-03-19 16:27:35] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 0 ms to minimize.
[2023-03-19 16:27:35] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2023-03-19 16:27:35] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2023-03-19 16:27:35] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 1 ms to minimize.
[2023-03-19 16:27:35] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 0 ms to minimize.
[2023-03-19 16:27:35] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3214 ms
[2023-03-19 16:27:35] [INFO ] After 5628ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 239 ms.
[2023-03-19 16:27:36] [INFO ] After 6010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 45 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 2 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 3 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 183 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 183 ms. Remains : 749/827 places, 999/1077 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 166813 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166813 steps, saw 49405 distinct states, run finished after 3003 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 999 rows 749 cols
[2023-03-19 16:27:39] [INFO ] Computed 201 place invariants in 15 ms
[2023-03-19 16:27:39] [INFO ] [Real]Absence check using 201 positive place invariants in 24 ms returned sat
[2023-03-19 16:27:39] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:27:40] [INFO ] [Nat]Absence check using 201 positive place invariants in 29 ms returned sat
[2023-03-19 16:27:40] [INFO ] After 446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:27:40] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2023-03-19 16:27:40] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 1 ms to minimize.
[2023-03-19 16:27:40] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2023-03-19 16:27:41] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2023-03-19 16:27:41] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2023-03-19 16:27:41] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2023-03-19 16:27:41] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2023-03-19 16:27:41] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2023-03-19 16:27:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1061 ms
[2023-03-19 16:27:41] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2023-03-19 16:27:41] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2023-03-19 16:27:42] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2023-03-19 16:27:42] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2023-03-19 16:27:42] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2023-03-19 16:27:42] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 1 ms to minimize.
[2023-03-19 16:27:42] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 1 ms to minimize.
[2023-03-19 16:27:42] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2023-03-19 16:27:43] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 0 ms to minimize.
[2023-03-19 16:27:43] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2023-03-19 16:27:43] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2023-03-19 16:27:43] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2023-03-19 16:27:43] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2023-03-19 16:27:43] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2023-03-19 16:27:43] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2041 ms
[2023-03-19 16:27:43] [INFO ] After 3707ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 196 ms.
[2023-03-19 16:27:43] [INFO ] After 4068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 34 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 39 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 40 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 29 ms. Remains 749 /749 variables (removed 0) and now considering 999/999 (removed 0) transitions.
[2023-03-19 16:27:44] [INFO ] Invariant cache hit.
[2023-03-19 16:27:44] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-19 16:27:44] [INFO ] Invariant cache hit.
[2023-03-19 16:27:45] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
[2023-03-19 16:27:45] [INFO ] Redundant transitions in 99 ms returned []
[2023-03-19 16:27:45] [INFO ] Invariant cache hit.
[2023-03-19 16:27:45] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1779 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-19 16:27:45] [INFO ] Invariant cache hit.
[2023-03-19 16:27:45] [INFO ] [Real]Absence check using 201 positive place invariants in 30 ms returned sat
[2023-03-19 16:27:45] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:27:46] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-19 16:27:46] [INFO ] After 430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:27:46] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 0 ms to minimize.
[2023-03-19 16:27:46] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 0 ms to minimize.
[2023-03-19 16:27:46] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2023-03-19 16:27:47] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2023-03-19 16:27:47] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2023-03-19 16:27:47] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2023-03-19 16:27:47] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2023-03-19 16:27:47] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2023-03-19 16:27:47] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2023-03-19 16:27:47] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2023-03-19 16:27:47] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2023-03-19 16:27:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1402 ms
[2023-03-19 16:27:48] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 0 ms to minimize.
[2023-03-19 16:27:48] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2023-03-19 16:27:48] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2023-03-19 16:27:48] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2023-03-19 16:27:48] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2023-03-19 16:27:48] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2023-03-19 16:27:49] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2023-03-19 16:27:49] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2023-03-19 16:27:49] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1128 ms
[2023-03-19 16:27:49] [INFO ] After 3099ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 170 ms.
[2023-03-19 16:27:49] [INFO ] After 3429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-19 16:27:49] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2023-03-19 16:27:49] [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-19 16:27:49] [INFO ] Flatten gal took : 148 ms
Total runtime 63842 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVs-PT-050B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
ReachabilityFireability

FORMULA ShieldRVs-PT-050B-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-050B-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679243270787

--------------------
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:
++ 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
++ sed s/.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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 10 (type EXCL) for 0 ShieldRVs-PT-050B-ReachabilityFireability-02
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 0 ShieldRVs-PT-050B-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 0 ShieldRVs-PT-050B-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 9 (type SRCH) for 0 ShieldRVs-PT-050B-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 9 (type SRCH) for ShieldRVs-PT-050B-ReachabilityFireability-02
lola: result : false
lola: markings : 133
lola: fired transitions : 132
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 6 (type FNDP) for ShieldRVs-PT-050B-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 7 (type EQUN) for ShieldRVs-PT-050B-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 10 (type EXCL) for ShieldRVs-PT-050B-ReachabilityFireability-02 (obsolete)
lola: LAUNCH task # 17 (type EXCL) for 3 ShieldRVs-PT-050B-ReachabilityFireability-13
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 3 ShieldRVs-PT-050B-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 3 ShieldRVs-PT-050B-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 16 (type SRCH) for 3 ShieldRVs-PT-050B-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type FNDP) for ShieldRVs-PT-050B-ReachabilityFireability-02
lola: result : unknown
lola: fired transitions : 1
lola: tried executions : 2
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 13 (type FNDP) for ShieldRVs-PT-050B-ReachabilityFireability-13
lola: result : true
lola: fired transitions : 103
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 14 (type EQUN) for ShieldRVs-PT-050B-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 16 (type SRCH) for ShieldRVs-PT-050B-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 17 (type EXCL) for ShieldRVs-PT-050B-ReachabilityFireability-13 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-050B-ReachabilityFireability-02: EF false tandem / insertion
ShieldRVs-PT-050B-ReachabilityFireability-13: AG false findpath


Time elapsed: 0 secs. Pages in use: 2

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="lolaxred"
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 lolaxred"
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 r423-tajo-167905976300159"
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 ;