fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r114-smll-171624275300127
Last Updated
July 7, 2024

About the Execution of ITS-Tools for DLCround-PT-03b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
572.056 14414.00 44364.00 133.70 FFFTTFTFTFTTFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r114-smll-171624275300127.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DLCround-PT-03b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-171624275300127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 936K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 13 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 12:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 13 12:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 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 DLCround-PT-03b-ReachabilityFireability-2024-00
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-01
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-02
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-03
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-04
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-05
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-06
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-07
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-08
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-09
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-10
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-11
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-12
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-13
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-14
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716342215205

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-22 01:43:36] [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]
[2024-05-22 01:43:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 01:43:37] [INFO ] Load time of PNML (sax parser for PT used): 267 ms
[2024-05-22 01:43:37] [INFO ] Transformed 1383 places.
[2024-05-22 01:43:37] [INFO ] Transformed 1887 transitions.
[2024-05-22 01:43:37] [INFO ] Found NUPN structural information;
[2024-05-22 01:43:37] [INFO ] Parsed PT model containing 1383 places and 1887 transitions and 4809 arcs in 469 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2809 ms. (14 steps per ms) remains 5/16 properties
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 989 ms. (40 steps per ms) remains 5/5 properties
[2024-05-22 01:43:39] [INFO ] Flatten gal took : 487 ms
BEST_FIRST walk for 40003 steps (8 resets) in 578 ms. (69 steps per ms) remains 5/5 properties
[2024-05-22 01:43:39] [INFO ] Flatten gal took : 324 ms
BEST_FIRST walk for 40002 steps (8 resets) in 1742 ms. (22 steps per ms) remains 5/5 properties
[2024-05-22 01:43:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6098401332562603610.gal : 168 ms
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 5/5 properties
[2024-05-22 01:43:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5614048433424138191.prop : 14 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6098401332562603610.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5614048433424138191.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 4/5 properties
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
// Phase 1: matrix 1887 rows 1383 cols
[2024-05-22 01:43:39] [INFO ] Computed 52 invariants in 47 ms
Loading property file /tmp/ReachabilityCardinality5614048433424138191.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 140/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem DLCround-PT-03b-ReachabilityFireability-2024-01 is UNSAT
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1243/1383 variables, 52/192 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1383 variables, 1243/1435 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1383 variables, 0/1435 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1887/3270 variables, 1383/2818 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3270 variables, 0/2818 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
At refinement iteration 7 (OVERLAPS) 0/3270 variables, 0/2818 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 22
After SMT solving in domain Real declared 3270/3270 variables, and 2818 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2267 ms.
Refiners :[Domain max(s): 1383/1383 constraints, Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 1383/1383 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :22 after 131
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :131 after 1339
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1339 after 2406
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :2406 after 28185
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :28185 after 34645
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :34645 after 49101
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 113/113 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :49101 after 242081
At refinement iteration 2 (OVERLAPS) 1270/1383 variables, 52/165 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :242081 after 9.00399e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/1383 variables, 1270/1435 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :9.00399e+06 after 2.87294e+07
[2024-05-22 01:43:43] [INFO ] Deduced a trap composed of 134 places in 357 ms of which 38 ms to minimize.
[2024-05-22 01:43:43] [INFO ] Deduced a trap composed of 163 places in 246 ms of which 4 ms to minimize.
[2024-05-22 01:43:44] [INFO ] Deduced a trap composed of 117 places in 260 ms of which 4 ms to minimize.
[2024-05-22 01:43:44] [INFO ] Deduced a trap composed of 127 places in 267 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1383 variables, 4/1439 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1383 variables, 0/1439 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :2.87294e+07 after 2.67656e+10
At refinement iteration 6 (OVERLAPS) 1887/3270 variables, 1383/2822 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3270 variables, 3/2825 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3270 variables, 0/2825 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/3270 variables, 0/2825 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3270/3270 variables, and 2825 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5013 ms.
Refiners :[Domain max(s): 1383/1383 constraints, Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 1383/1383 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 7623ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 113 out of 1383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1383/1383 places, 1887/1887 transitions.
Graph (trivial) has 1089 edges and 1383 vertex of which 101 / 1383 are part of one of the 14 SCC in 13 ms
Free SCC test removed 87 places
Drop transitions (Empty/Sink Transition effects.) removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 519 transitions
Trivial Post-agglo rules discarded 519 transitions
Performed 519 trivial Post agglomeration. Transition count delta: 519
Iterating post reduction 0 with 519 rules applied. Total rules applied 520 place count 1296 transition count 1266
Reduce places removed 519 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 528 rules applied. Total rules applied 1048 place count 777 transition count 1257
Reduce places removed 4 places and 0 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Iterating post reduction 2 with 50 rules applied. Total rules applied 1098 place count 773 transition count 1211
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 51 rules applied. Total rules applied 1149 place count 727 transition count 1206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1150 place count 726 transition count 1206
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 49 Pre rules applied. Total rules applied 1150 place count 726 transition count 1157
Deduced a syphon composed of 49 places in 8 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 1248 place count 677 transition count 1157
Discarding 145 places :
Symmetric choice reduction at 5 with 145 rule applications. Total rules 1393 place count 532 transition count 1012
Iterating global reduction 5 with 145 rules applied. Total rules applied 1538 place count 532 transition count 1012
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 5 with 17 rules applied. Total rules applied 1555 place count 532 transition count 995
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 9 rules applied. Total rules applied 1564 place count 527 transition count 991
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1566 place count 525 transition count 991
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 38 Pre rules applied. Total rules applied 1566 place count 525 transition count 953
Deduced a syphon composed of 38 places in 5 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 8 with 76 rules applied. Total rules applied 1642 place count 487 transition count 953
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1654 place count 475 transition count 899
Iterating global reduction 8 with 12 rules applied. Total rules applied 1666 place count 475 transition count 899
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1670 place count 475 transition count 895
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 9 with 204 rules applied. Total rules applied 1874 place count 373 transition count 793
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1876 place count 373 transition count 791
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1879 place count 370 transition count 770
Iterating global reduction 10 with 3 rules applied. Total rules applied 1882 place count 370 transition count 770
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -239
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 10 with 78 rules applied. Total rules applied 1960 place count 331 transition count 1009
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 10 with 21 rules applied. Total rules applied 1981 place count 331 transition count 988
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1985 place count 327 transition count 944
Iterating global reduction 11 with 4 rules applied. Total rules applied 1989 place count 327 transition count 944
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1991 place count 326 transition count 957
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1994 place count 326 transition count 954
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 12 with 22 rules applied. Total rules applied 2016 place count 326 transition count 932
Free-agglomeration rule applied 48 times.
Iterating global reduction 12 with 48 rules applied. Total rules applied 2064 place count 326 transition count 884
Reduce places removed 48 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 12 with 86 rules applied. Total rules applied 2150 place count 278 transition count 846
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 2171 place count 278 transition count 825
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 13 with 9 rules applied. Total rules applied 2180 place count 278 transition count 825
SDD proceeding with computation,5 properties remain. new max is 32768
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 2184 place count 278 transition count 821
SDD size :2.67656e+10 after 9.75169e+13
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 2185 place count 278 transition count 821
Applied a total of 2185 rules in 744 ms. Remains 278 /1383 variables (removed 1105) and now considering 821/1887 (removed 1066) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 768 ms. Remains : 278/1383 places, 821/1887 transitions.
RANDOM walk for 40000 steps (8 resets) in 756 ms. (52 steps per ms) remains 1/3 properties
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
[2024-05-22 01:43:48] [INFO ] Flow matrix only has 624 transitions (discarded 197 similar events)
// Phase 1: matrix 624 rows 278 cols
[2024-05-22 01:43:48] [INFO ] Computed 52 invariants in 3 ms
[2024-05-22 01:43:48] [INFO ] State equation strengthened by 104 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 231/272 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/278 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 624/902 variables, 278/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 104/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/902 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 902/902 variables, and 434 constraints, problems are : Problem set: 0 solved, 1 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 278/278 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 231/272 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/278 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 624/902 variables, 278/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 104/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/902 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/902 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 902/902 variables, and 435 constraints, problems are : Problem set: 0 solved, 1 unsolved in 520 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 278/278 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 941ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 505 steps, including 3 resets, run visited all 1 properties in 4 ms. (steps per millisecond=126 )
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 12 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 12625 ms.

BK_STOP 1716342229619

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="DLCround-PT-03b"
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-5568"
echo " Executing tool itstools"
echo " Input is DLCround-PT-03b, 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 r114-smll-171624275300127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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