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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Feb 25 12:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 12:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:31 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:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 25 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 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 1.5M 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-20b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679515344134

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-20b
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-22 20:02:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 20:02:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 20:02:26] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2023-03-22 20:02:26] [INFO ] Transformed 5372 places.
[2023-03-22 20:02:26] [INFO ] Transformed 6193 transitions.
[2023-03-22 20:02:26] [INFO ] Found NUPN structural information;
[2023-03-22 20:02:26] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 74 resets, run finished after 761 ms. (steps per millisecond=13 ) properties (out of 16) seen :2
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-22 20:02:27] [INFO ] Flatten gal took : 510 ms
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
[2023-03-22 20:02:27] [INFO ] Flatten gal took : 373 ms
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
[2023-03-22 20:02:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7562290084600707353.gal : 86 ms
[2023-03-22 20:02:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7691177650946684464.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/ReachabilityCardinality7562290084600707353.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7691177650946684464.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0

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 ...328
Running SMT prover for 14 properties.
// Phase 1: matrix 6193 rows 5372 cols
[2023-03-22 20:02:27] [INFO ] Computed 22 place invariants in 177 ms
Loading property file /tmp/ReachabilityCardinality7691177650946684464.prop.
[2023-03-22 20:02:30] [INFO ] After 2079ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-22 20:02:32] [INFO ] [Nat]Absence check using 22 positive place invariants in 49 ms returned sat
[2023-03-22 20:02:41] [INFO ] After 8180ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :12
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :19 after 68
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :68 after 2324
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :2324 after 110659
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :110659 after 2.54917e+08
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :2.54917e+08 after 1.35321e+15
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :1.35321e+15 after 7.94424e+26
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :7.94424e+26 after 4.4807e+33
[2023-03-22 20:02:48] [INFO ] Deduced a trap composed of 1904 places in 2710 ms of which 8 ms to minimize.
[2023-03-22 20:02:52] [INFO ] Deduced a trap composed of 182 places in 3421 ms of which 4 ms to minimize.
[2023-03-22 20:02:55] [INFO ] Deduced a trap composed of 1860 places in 2513 ms of which 6 ms to minimize.
[2023-03-22 20:02:55] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 9333 ms
[2023-03-22 20:02:55] [INFO ] After 22058ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :11
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 20:02:55] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :11
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 12 different solutions.
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 303 ms.
Support contains 79 out of 5372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 4191 edges and 5372 vertex of which 68 / 5372 are part of one of the 11 SCC in 33 ms
Free SCC test removed 57 places
Drop transitions removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 920 transitions
Trivial Post-agglo rules discarded 920 transitions
Performed 920 trivial Post agglomeration. Transition count delta: 920
Iterating post reduction 0 with 920 rules applied. Total rules applied 921 place count 5315 transition count 5204
Reduce places removed 920 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 936 rules applied. Total rules applied 1857 place count 4395 transition count 5188
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 1873 place count 4379 transition count 5188
Performed 727 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 727 Pre rules applied. Total rules applied 1873 place count 4379 transition count 4461
Deduced a syphon composed of 727 places in 3 ms
Reduce places removed 727 places and 0 transitions.
Iterating global reduction 3 with 1454 rules applied. Total rules applied 3327 place count 3652 transition count 4461
Discarding 2165 places :
Symmetric choice reduction at 3 with 2165 rule applications. Total rules 5492 place count 1487 transition count 2296
Iterating global reduction 3 with 2165 rules applied. Total rules applied 7657 place count 1487 transition count 2296
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 7657 place count 1487 transition count 2286
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 7677 place count 1477 transition count 2286
Discarding 332 places :
Symmetric choice reduction at 3 with 332 rule applications. Total rules 8009 place count 1145 transition count 1954
Iterating global reduction 3 with 332 rules applied. Total rules applied 8341 place count 1145 transition count 1954
Ensure Unique test removed 323 transitions
Reduce isomorphic transitions removed 323 transitions.
Iterating post reduction 3 with 323 rules applied. Total rules applied 8664 place count 1145 transition count 1631
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 4 with 256 rules applied. Total rules applied 8920 place count 1017 transition count 1503
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 8939 place count 1017 transition count 1484
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 8957 place count 999 transition count 1466
Iterating global reduction 5 with 18 rules applied. Total rules applied 8975 place count 999 transition count 1466
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 8987 place count 993 transition count 1466
Free-agglomeration rule applied 284 times.
Iterating global reduction 5 with 284 rules applied. Total rules applied 9271 place count 993 transition count 1182
Reduce places removed 284 places and 0 transitions.
Iterating post reduction 5 with 284 rules applied. Total rules applied 9555 place count 709 transition count 1182
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 9562 place count 702 transition count 1175
Iterating global reduction 6 with 7 rules applied. Total rules applied 9569 place count 702 transition count 1175
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 9576 place count 702 transition count 1168
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 7 with 17 rules applied. Total rules applied 9593 place count 702 transition count 1151
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 9600 place count 702 transition count 1151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 9601 place count 701 transition count 1150
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 103 edges and 700 vertex of which 24 / 700 are part of one of the 11 SCC in 0 ms
Free SCC test removed 13 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 4 rules applied. Total rules applied 9605 place count 687 transition count 1148
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 8 with 26 rules applied. Total rules applied 9631 place count 685 transition count 1124
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 21 Pre rules applied. Total rules applied 9631 place count 685 transition count 1103
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 42 rules applied. Total rules applied 9673 place count 664 transition count 1103
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 9678 place count 659 transition count 1098
Iterating global reduction 9 with 5 rules applied. Total rules applied 9683 place count 659 transition count 1098
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 9688 place count 659 transition count 1093
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 10 with 56 rules applied. Total rules applied 9744 place count 631 transition count 1065
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 9746 place count 631 transition count 1063
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 9756 place count 626 transition count 1063
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 9766 place count 626 transition count 1053
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 12 with 12 rules applied. Total rules applied 9778 place count 626 transition count 1041
Free-agglomeration rule applied 12 times.
Iterating global reduction 12 with 12 rules applied. Total rules applied 9790 place count 626 transition count 1029
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 12 with 23 rules applied. Total rules applied 9813 place count 614 transition count 1018
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 9814 place count 614 transition count 1018
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 9815 place count 614 transition count 1017
Applied a total of 9815 rules in 2114 ms. Remains 614 /5372 variables (removed 4758) and now considering 1017/6193 (removed 5176) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2115 ms. Remains : 614/5372 places, 1017/6193 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-22 20:02:58] [INFO ] Flow matrix only has 999 transitions (discarded 18 similar events)
// Phase 1: matrix 999 rows 614 cols
[2023-03-22 20:02:58] [INFO ] Computed 21 place invariants in 20 ms
[2023-03-22 20:02:58] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 20:02:58] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-22 20:02:58] [INFO ] After 507ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 20:02:58] [INFO ] State equation strengthened by 129 read => feed constraints.
[2023-03-22 20:02:59] [INFO ] After 322ms SMT Verify possible using 129 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 20:02:59] [INFO ] After 774ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 326 ms.
[2023-03-22 20:02:59] [INFO ] After 1774ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 36 ms.
Support contains 21 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1017/1017 transitions.
Graph (trivial) has 531 edges and 614 vertex of which 21 / 614 are part of one of the 8 SCC in 1 ms
Free SCC test removed 13 places
Drop transitions removed 22 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 601 transition count 985
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 592 transition count 985
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 38 place count 573 transition count 966
Iterating global reduction 2 with 19 rules applied. Total rules applied 57 place count 573 transition count 966
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 64 place count 573 transition count 959
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 116 place count 546 transition count 934
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 460 edges and 546 vertex of which 3 / 546 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 3 with 5 rules applied. Total rules applied 121 place count 544 transition count 930
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 148 place count 544 transition count 903
Discarding 30 places :
Symmetric choice reduction at 5 with 30 rule applications. Total rules 178 place count 514 transition count 873
Iterating global reduction 5 with 30 rules applied. Total rules applied 208 place count 514 transition count 873
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 238 place count 514 transition count 843
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 242 place count 512 transition count 843
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 244 place count 512 transition count 841
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 250 place count 512 transition count 835
Free-agglomeration rule applied 423 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 423 rules applied. Total rules applied 673 place count 512 transition count 410
Reduce places removed 424 places and 0 transitions.
Drop transitions removed 218 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 222 transitions.
Iterating post reduction 7 with 646 rules applied. Total rules applied 1319 place count 88 transition count 188
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1325 place count 82 transition count 182
Iterating global reduction 8 with 6 rules applied. Total rules applied 1331 place count 82 transition count 182
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1337 place count 82 transition count 176
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 9 with 55 rules applied. Total rules applied 1392 place count 82 transition count 121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1393 place count 81 transition count 120
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1396 place count 78 transition count 120
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 1402 place count 72 transition count 114
Iterating global reduction 10 with 6 rules applied. Total rules applied 1408 place count 72 transition count 114
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1414 place count 72 transition count 108
Applied a total of 1414 rules in 253 ms. Remains 72 /614 variables (removed 542) and now considering 108/1017 (removed 909) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 72/614 places, 108/1017 transitions.
Finished random walk after 1500 steps, including 3 resets, run visited all 2 properties in 10 ms. (steps per millisecond=150 )
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_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 34511 ms.

BK_STOP 1679515382181

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-20b"
export BK_EXAMINATION="ReachabilityFireability"
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-20b, 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 r165-tall-167838850600583"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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