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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K 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 150K 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-23-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717404210859

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-23
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-06-03 08:43:33] [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-06-03 08:43:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 08:43:34] [INFO ] Load time of PNML (sax parser for PT used): 364 ms
[2024-06-03 08:43:34] [INFO ] Transformed 378 places.
[2024-06-03 08:43:34] [INFO ] Transformed 614 transitions.
[2024-06-03 08:43:34] [INFO ] Found NUPN structural information;
[2024-06-03 08:43:34] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 629 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
[2024-06-03 08:43:35] [INFO ] Flatten gal took : 435 ms
RANDOM walk for 40000 steps (16 resets) in 3841 ms. (10 steps per ms) remains 9/16 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (43 resets) in 442 ms. (90 steps per ms) remains 8/9 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-03 08:43:35] [INFO ] Flatten gal took : 192 ms
BEST_FIRST walk for 40003 steps (9 resets) in 541 ms. (73 steps per ms) remains 7/8 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-03 08:43:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4315279653671039802.gal : 85 ms
[2024-06-03 08:43:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2461183729086994369.prop : 4 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/ReachabilityCardinality4315279653671039802.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2461183729086994369.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 ...328
BEST_FIRST walk for 40002 steps (62 resets) in 478 ms. (83 steps per ms) remains 6/7 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (38 resets) in 178 ms. (223 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality2461183729086994369.prop.
BEST_FIRST walk for 40003 steps (45 resets) in 330 ms. (120 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (23 resets) in 789 ms. (50 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (34 resets) in 409 ms. (97 steps per ms) remains 5/6 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
BEST_FIRST walk for 40003 steps (9 resets) in 288 ms. (138 steps per ms) remains 5/5 properties
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :7 after 36
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :36 after 42
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :42 after 63
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :63 after 97
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :97 after 143
// Phase 1: matrix 614 rows 378 cols
[2024-06-03 08:43:36] [INFO ] Computed 11 invariants in 30 ms
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :143 after 2593
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :2593 after 5498
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem MedleyA-PT-23-ReachabilityFireability-2024-13 is UNSAT
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 225/293 variables, 9/77 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 225/302 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/302 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :5498 after 168242
Problem MedleyA-PT-23-ReachabilityFireability-2024-09 is UNSAT
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 85/378 variables, 2/304 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 85/389 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/389 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 614/992 variables, 378/767 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/992 variables, 0/767 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/992 variables, 0/767 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 992/992 variables, and 767 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1081 ms.
Refiners :[Domain max(s): 378/378 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 378/378 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/23 variables, 23/23 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 261/284 variables, 9/32 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 261/293 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/293 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem MedleyA-PT-23-ReachabilityFireability-2024-01 is UNSAT
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 94/378 variables, 2/295 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 94/389 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/389 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 614/992 variables, 378/767 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/992 variables, 2/769 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/992 variables, 0/769 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/992 variables, 0/769 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 992/992 variables, and 769 constraints, problems are : Problem set: 3 solved, 2 unsolved in 919 ms.
Refiners :[Domain max(s): 378/378 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2273ms problems are : Problem set: 3 solved, 2 unsolved
Parikh walk visited 0 properties in 479 ms.
Support contains 20 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 614/614 transitions.
Graph (trivial) has 308 edges and 378 vertex of which 36 / 378 are part of one of the 3 SCC in 6 ms
Free SCC test removed 33 places
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 1039 edges and 345 vertex of which 342 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 342 transition count 465
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 110 rules applied. Total rules applied 217 place count 240 transition count 457
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 222 place count 235 transition count 457
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 222 place count 235 transition count 452
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 232 place count 230 transition count 452
Discarding 71 places :
Symmetric choice reduction at 3 with 71 rule applications. Total rules 303 place count 159 transition count 381
Iterating global reduction 3 with 71 rules applied. Total rules applied 374 place count 159 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 375 place count 159 transition count 380
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 375 place count 159 transition count 374
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 387 place count 153 transition count 374
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 416 place count 124 transition count 287
Iterating global reduction 4 with 29 rules applied. Total rules applied 445 place count 124 transition count 287
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 11 rules applied. Total rules applied 456 place count 124 transition count 276
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 460 place count 122 transition count 274
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 461 place count 121 transition count 272
Iterating global reduction 6 with 1 rules applied. Total rules applied 462 place count 121 transition count 272
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 490 place count 107 transition count 258
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 504 place count 100 transition count 272
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 517 place count 100 transition count 259
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 520 place count 97 transition count 250
Iterating global reduction 6 with 3 rules applied. Total rules applied 523 place count 97 transition count 250
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 526 place count 97 transition count 247
Free-agglomeration rule applied 25 times.
Iterating global reduction 7 with 25 rules applied. Total rules applied 551 place count 97 transition count 222
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 576 place count 72 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 585 place count 72 transition count 213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 586 place count 71 transition count 212
Applied a total of 586 rules in 273 ms. Remains 71 /378 variables (removed 307) and now considering 212/614 (removed 402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 71/378 places, 212/614 transitions.
RANDOM walk for 40000 steps (11 resets) in 541 ms. (73 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (17 resets) in 110 ms. (360 steps per ms) remains 1/2 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (29 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
[2024-06-03 08:43:40] [INFO ] Flow matrix only has 205 transitions (discarded 7 similar events)
// Phase 1: matrix 205 rows 71 cols
[2024-06-03 08:43:40] [INFO ] Computed 11 invariants in 2 ms
[2024-06-03 08:43:40] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/61 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/71 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 205/276 variables, 71/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/276 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 84 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 2/2 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/61 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/71 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 205/276 variables, 71/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/276 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 361ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-10 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 9 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 6995 ms.

BK_STOP 1717404220470

--------------------
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="MedleyA-PT-23"
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 MedleyA-PT-23, 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 r576-smll-171734920200183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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