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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K 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 95K 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 160K 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-11-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717364664738

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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-06-02 21:44:27] [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 21:44:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:44:27] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2024-06-02 21:44:27] [INFO ] Transformed 150 places.
[2024-06-02 21:44:27] [INFO ] Transformed 478 transitions.
[2024-06-02 21:44:27] [INFO ] Found NUPN structural information;
[2024-06-02 21:44:27] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 460 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 43 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 21:44:29] [INFO ] Flatten gal took : 338 ms
[2024-06-02 21:44:29] [INFO ] Flatten gal took : 154 ms
[2024-06-02 21:44:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13467281419354906409.gal : 112 ms
RANDOM walk for 40000 steps (3116 resets) in 4980 ms. (8 steps per ms) remains 7/10 properties
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-02 21:44:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2604754687956117318.prop : 3 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/ReachabilityCardinality13467281419354906409.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2604754687956117318.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (544 resets) in 323 ms. (123 steps per ms) remains 7/7 properties
Loading property file /tmp/ReachabilityCardinality2604754687956117318.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :13 after 37
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :37 after 347
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :347 after 392
BEST_FIRST walk for 40004 steps (610 resets) in 868 ms. (46 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :392 after 1071
BEST_FIRST walk for 40003 steps (629 resets) in 306 ms. (130 steps per ms) remains 7/7 properties
Invariant property MedleyA-PT-11-ReachabilityCardinality-2024-07 does not hold.
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property MedleyA-PT-11-ReachabilityCardinality-2024-01 does not hold.
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :1071 after 19619
BEST_FIRST walk for 40002 steps (547 resets) in 549 ms. (72 steps per ms) remains 7/7 properties
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :19619 after 23481
BEST_FIRST walk for 40004 steps (540 resets) in 967 ms. (41 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (547 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :23481 after 40851
BEST_FIRST walk for 40003 steps (551 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
[2024-06-02 21:44:30] [INFO ] Flow matrix only has 397 transitions (discarded 72 similar events)
// Phase 1: matrix 397 rows 150 cols
[2024-06-02 21:44:30] [INFO ] Computed 23 invariants in 31 ms
[2024-06-02 21:44:30] [INFO ] State equation strengthened by 171 read => feed constraints.
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :40851 after 49529
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem MedleyA-PT-11-ReachabilityCardinality-2024-02 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 42/102 variables, 9/69 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 42/111 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem MedleyA-PT-11-ReachabilityCardinality-2024-09 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 44/146 variables, 14/125 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 44/169 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :49529 after 284903
At refinement iteration 8 (OVERLAPS) 394/540 variables, 146/315 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 171/486 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/486 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 7/547 variables, 4/490 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 4/494 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/547 variables, 0/494 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/547 variables, 0/494 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 494 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1098 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 150/150 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem MedleyA-PT-11-ReachabilityCardinality-2024-15 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 56/64 variables, 6/14 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 56/70 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/70 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/73 variables, 3/73 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 9/82 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/82 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 67/140 variables, 12/94 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 67/161 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-06-02 21:44:33] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 41 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :284903 after 365897
[2024-06-02 21:44:33] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 2 ms to minimize.
[2024-06-02 21:44:33] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 2 ms to minimize.
[2024-06-02 21:44:33] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 2 ms to minimize.
[2024-06-02 21:44:33] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 2 ms to minimize.
[2024-06-02 21:44:34] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 2 ms to minimize.
[2024-06-02 21:44:34] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-06-02 21:44:34] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 4 ms to minimize.
[2024-06-02 21:44:34] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2024-06-02 21:44:34] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 2 ms to minimize.
[2024-06-02 21:44:34] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 11/172 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/146 variables, 2/174 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 6/180 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-06-02 21:44:34] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:44:34] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 2/182 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 0/182 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 394/540 variables, 146/328 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/540 variables, 171/499 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/540 variables, 1/500 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-06-02 21:44:35] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2024-06-02 21:44:35] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/540 variables, 2/502 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/540 variables, 0/502 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 7/547 variables, 4/506 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/547 variables, 4/510 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/547 variables, 1/511 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/547 variables, 0/511 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/547 variables, 0/511 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 547/547 variables, and 511 constraints, problems are : Problem set: 3 solved, 2 unsolved in 3930 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 150/150 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 15/15 constraints]
After SMT, in 5446ms problems are : Problem set: 3 solved, 2 unsolved
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :365897 after 909909
Parikh walk visited 0 properties in 372 ms.
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 469/469 transitions.
Graph (complete) has 749 edges and 150 vertex of which 147 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 36 place count 112 transition count 414
Iterating global reduction 0 with 35 rules applied. Total rules applied 71 place count 112 transition count 414
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 80 place count 103 transition count 364
Iterating global reduction 0 with 9 rules applied. Total rules applied 89 place count 103 transition count 364
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 93 place count 99 transition count 348
Iterating global reduction 0 with 4 rules applied. Total rules applied 97 place count 99 transition count 348
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 105 place count 95 transition count 371
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 127 place count 95 transition count 349
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 129 place count 94 transition count 361
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 0 with 16 rules applied. Total rules applied 145 place count 94 transition count 610
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 185 place count 78 transition count 586
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 186 place count 78 transition count 586
Applied a total of 186 rules in 335 ms. Remains 78 /150 variables (removed 72) and now considering 586/469 (removed -117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 366 ms. Remains : 78/150 places, 586/469 transitions.
RANDOM walk for 40000 steps (5783 resets) in 1015 ms. (39 steps per ms) remains 1/2 properties
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (1868 resets) in 225 ms. (177 steps per ms) remains 1/1 properties
[2024-06-02 21:44:37] [INFO ] Flow matrix only has 454 transitions (discarded 132 similar events)
// Phase 1: matrix 454 rows 78 cols
[2024-06-02 21:44:37] [INFO ] Computed 23 invariants in 6 ms
[2024-06-02 21:44:37] [INFO ] State equation strengthened by 262 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/40 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/73 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/77 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 454/531 variables, 77/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 262/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/532 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/532 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/532 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 363 constraints, problems are : Problem set: 0 solved, 1 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 78/78 constraints, ReadFeed: 262/262 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/40 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/73 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/77 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:44:37] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 454/531 variables, 77/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 262/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/532 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/532 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/532 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/532 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 78/78 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1178ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 586/586 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 77 transition count 598
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 76 transition count 569
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 76 transition count 569
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 75 transition count 565
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 75 transition count 565
Applied a total of 6 rules in 38 ms. Remains 75 /78 variables (removed 3) and now considering 565/586 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 75/78 places, 565/586 transitions.
RANDOM walk for 40000 steps (5742 resets) in 685 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1914 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 168164 steps, run visited all 1 properties in 822 ms. (steps per millisecond=204 )
Probabilistic random walk after 168164 steps, saw 37954 distinct states, run finished after 852 ms. (steps per millisecond=197 ) properties seen :1
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
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 12304 ms.

BK_STOP 1717364679825

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-11"
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-11, 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-171734920000086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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