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.r576-smll-171734920000110.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 MedleyA-PT-14, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920000110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 17K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 46K Jun 2 16:33 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 MedleyA-PT-14-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-14-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-14-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-14-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-14-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-14-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-14-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-14-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-14-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-14-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-14-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-14-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-14-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-14-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-14-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-14-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717369032334

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-06-02 22:57:14] [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]
[2024-06-02 22:57:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:57:15] [INFO ] Load time of PNML (sax parser for PT used): 304 ms
[2024-06-02 22:57:15] [INFO ] Transformed 184 places.
[2024-06-02 22:57:15] [INFO ] Transformed 178 transitions.
[2024-06-02 22:57:15] [INFO ] Found NUPN structural information;
[2024-06-02 22:57:15] [INFO ] Parsed PT model containing 184 places and 178 transitions and 492 arcs in 620 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 60 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA MedleyA-PT-14-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:57:16] [INFO ] Flatten gal took : 151 ms
RANDOM walk for 40000 steps (8 resets) in 3047 ms. (13 steps per ms) remains 5/11 properties
FORMULA MedleyA-PT-14-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-14-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-14-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-14-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-14-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-14-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-02 22:57:16] [INFO ] Flatten gal took : 50 ms
[2024-06-02 22:57:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12210789908353864938.gal : 38 ms
[2024-06-02 22:57:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5451460546636955058.prop : 6 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/ReachabilityCardinality12210789908353864938.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5451460546636955058.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40001 steps (8 resets) in 546 ms. (73 steps per ms) remains 4/5 properties
FORMULA MedleyA-PT-14-ReachabilityCardinality-2024-03 TRUE 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 ...329
Loading property file /tmp/ReachabilityCardinality5451460546636955058.prop.
BEST_FIRST walk for 40002 steps (8 resets) in 782 ms. (51 steps per ms) remains 4/4 properties
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :2 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :9 after 29
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :29 after 35
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :35 after 65
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :65 after 1830
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :1830 after 18048
BEST_FIRST walk for 40003 steps (8 resets) in 720 ms. (55 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1186 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 523 ms. (76 steps per ms) remains 4/4 properties
// Phase 1: matrix 178 rows 184 cols
[2024-06-02 22:57:17] [INFO ] Computed 24 invariants in 28 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MedleyA-PT-14-ReachabilityCardinality-2024-08 is UNSAT
FORMULA MedleyA-PT-14-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 78/162 variables, 15/99 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 78/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 22/184 variables, 9/186 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 22/208 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/208 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 178/362 variables, 184/392 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/392 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/392 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 392 constraints, problems are : Problem set: 1 solved, 3 unsolved in 664 ms.
Refiners :[Domain max(s): 184/184 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 92/160 variables, 15/83 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 92/175 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-02 22:57:18] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 14 ms to minimize.
[2024-06-02 22:57:18] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 6 ms to minimize.
[2024-06-02 22:57:18] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-06-02 22:57:19] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 2 ms to minimize.
[2024-06-02 22:57:19] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
Problem MedleyA-PT-14-ReachabilityCardinality-2024-13 is UNSAT
FORMULA MedleyA-PT-14-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-02 22:57:19] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-06-02 22:57:19] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-06-02 22:57:19] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 8/183 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/183 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 24/184 variables, 9/192 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 24/216 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-02 22:57:19] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
[2024-06-02 22:57:19] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
Problem MedleyA-PT-14-ReachabilityCardinality-2024-04 is UNSAT
FORMULA MedleyA-PT-14-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-02 22:57:19] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 3/219 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/219 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 178/362 variables, 184/403 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 1/404 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/404 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/362 variables, 0/404 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 404 constraints, problems are : Problem set: 3 solved, 1 unsolved in 1705 ms.
Refiners :[Domain max(s): 184/184 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 11/11 constraints]
After SMT, in 2565ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 43 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 178/178 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 184 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 183 transition count 177
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 183 transition count 173
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 179 transition count 173
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 32 place count 157 transition count 151
Iterating global reduction 2 with 22 rules applied. Total rules applied 54 place count 157 transition count 151
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 54 place count 157 transition count 145
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 66 place count 151 transition count 145
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 148 transition count 142
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 148 transition count 142
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 112 place count 128 transition count 122
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 132 place count 118 transition count 142
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 136 place count 118 transition count 138
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 140 place count 114 transition count 138
Applied a total of 140 rules in 161 ms. Remains 114 /184 variables (removed 70) and now considering 138/178 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 114/184 places, 138/178 transitions.
RANDOM walk for 40000 steps (8 resets) in 574 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 537 ms. (74 steps per ms) remains 1/1 properties
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1.73003e+06 after 2.4383e+06
Interrupted probabilistic random walk after 1910797 steps, run timeout after 3001 ms. (steps per millisecond=636 ) properties seen :0 out of 1
Probabilistic random walk after 1910797 steps, saw 295007 distinct states, run finished after 3006 ms. (steps per millisecond=635 ) properties seen :0
// Phase 1: matrix 138 rows 114 cols
[2024-06-02 22:57:23] [INFO ] Computed 24 invariants in 2 ms
[2024-06-02 22:57:23] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/95 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/114 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 138/252 variables, 114/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 8/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/252 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 114/114 constraints, ReadFeed: 8/8 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/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/95 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:57:24] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:57:24] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 19/114 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:57:24] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2024-06-02 22:57:24] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:57:24] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 138/252 variables, 114/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 8/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:57:24] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:57:24] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/252 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 899 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 114/114 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1176ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 600 steps, including 25 resets, run visited all 1 properties in 3 ms. (steps per millisecond=200 )
FORMULA MedleyA-PT-14-ReachabilityCardinality-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 14 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 10384 ms.

BK_STOP 1717369045097

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

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-14.tgz
mv MedleyA-PT-14 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;