About the Execution of ITS-Tools for FlexibleBarrier-PT-04b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
254.088 | 5415.00 | 14016.00 | 92.70 | FTFTTFTTTFFTTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r165-tall-167838850400454.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is FlexibleBarrier-PT-04b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850400454
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 12:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 12:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 25 12:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 69K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679497714056
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=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-04b
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-22 15:08:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 15:08:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:08:35] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-22 15:08:35] [INFO ] Transformed 268 places.
[2023-03-22 15:08:35] [INFO ] Transformed 305 transitions.
[2023-03-22 15:08:35] [INFO ] Found NUPN structural information;
[2023-03-22 15:08:35] [INFO ] Parsed PT model containing 268 places and 305 transitions and 743 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 15:08:36] [INFO ] Flatten gal took : 117 ms
[2023-03-22 15:08:36] [INFO ] Flatten gal took : 34 ms
[2023-03-22 15:08:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16950702807078649012.gal : 16 ms
[2023-03-22 15:08:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3868498663823521610.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16950702807078649012.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3868498663823521610.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3868498663823521610.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :11 after 20
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :20 after 260
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :260 after 4115
Incomplete random walk after 10000 steps, including 238 resets, run finished after 638 ms. (steps per millisecond=15 ) properties (out of 9) seen :4
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :1
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :4115 after 1.11342e+06
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 305 rows 268 cols
[2023-03-22 15:08:36] [INFO ] Computed 6 place invariants in 11 ms
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :1.11342e+06 after 1.19518e+06
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :1.19518e+06 after 1.47851e+06
[2023-03-22 15:08:37] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :1.47851e+06 after 2.07732e+06
[2023-03-22 15:08:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-22 15:08:37] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-22 15:08:37] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 4 ms to minimize.
[2023-03-22 15:08:37] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 1 ms to minimize.
[2023-03-22 15:08:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
[2023-03-22 15:08:37] [INFO ] After 451ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-22 15:08:37] [INFO ] After 636ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 45 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 305/305 transitions.
Graph (trivial) has 158 edges and 268 vertex of which 6 / 268 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 263 transition count 256
Reduce places removed 43 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 51 rules applied. Total rules applied 95 place count 220 transition count 248
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 103 place count 212 transition count 248
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 103 place count 212 transition count 234
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 131 place count 198 transition count 234
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 185 place count 144 transition count 180
Iterating global reduction 3 with 54 rules applied. Total rules applied 239 place count 144 transition count 180
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 239 place count 144 transition count 178
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 243 place count 142 transition count 178
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 246 place count 139 transition count 175
Iterating global reduction 3 with 3 rules applied. Total rules applied 249 place count 139 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 251 place count 139 transition count 173
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 299 place count 115 transition count 149
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 300 place count 115 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 304 place count 113 transition count 153
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 305 place count 113 transition count 152
Free-agglomeration rule applied 16 times.
Iterating global reduction 5 with 16 rules applied. Total rules applied 321 place count 113 transition count 136
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 337 place count 97 transition count 136
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 340 place count 97 transition count 133
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 342 place count 97 transition count 133
Applied a total of 342 rules in 78 ms. Remains 97 /268 variables (removed 171) and now considering 133/305 (removed 172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 97/268 places, 133/305 transitions.
Invariant property FlexibleBarrier-PT-04b-ReachabilityCardinality-10 does not hold.
Reachability property FlexibleBarrier-PT-04b-ReachabilityCardinality-07 is true.
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :2.07732e+06 after 3.22256e+06
Incomplete random walk after 10000 steps, including 199 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :1
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 133 rows 97 cols
[2023-03-22 15:08:38] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-22 15:08:38] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 15:08:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 15:08:38] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 15:08:38] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-22 15:08:38] [INFO ] After 14ms SMT Verify possible using 33 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 15:08:38] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-22 15:08:38] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 23 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 133/133 transitions.
Graph (trivial) has 35 edges and 97 vertex of which 2 / 97 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 96 transition count 125
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 90 transition count 125
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 90 transition count 122
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 87 transition count 122
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 27 place count 79 transition count 114
Iterating global reduction 2 with 8 rules applied. Total rules applied 35 place count 79 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 78 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 78 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 78 transition count 112
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 48 place count 73 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 73 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50 place count 72 transition count 105
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 72 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 52 place count 72 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 54 place count 71 transition count 104
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 60 place count 71 transition count 98
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 65 place count 71 transition count 93
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 70 place count 66 transition count 93
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 72 place count 66 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 73 place count 65 transition count 92
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 3 rules applied. Total rules applied 76 place count 64 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 78 place count 62 transition count 90
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 78 place count 62 transition count 86
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 86 place count 58 transition count 86
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 94 place count 54 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 96 place count 53 transition count 82
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 97 place count 53 transition count 81
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 98 place count 53 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 99 place count 52 transition count 80
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 100 place count 52 transition count 80
Applied a total of 100 rules in 50 ms. Remains 52 /97 variables (removed 45) and now considering 80/133 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 52/97 places, 80/133 transitions.
Incomplete random walk after 10000 steps, including 304 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1072 steps, run visited all 1 properties in 15 ms. (steps per millisecond=71 )
Probabilistic random walk after 1072 steps, saw 852 distinct states, run finished after 15 ms. (steps per millisecond=71 ) properties seen :1
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 2658 ms.
BK_STOP 1679497719471
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="FlexibleBarrier-PT-04b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is FlexibleBarrier-PT-04b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r165-tall-167838850400454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-04b.tgz
mv FlexibleBarrier-PT-04b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;