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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K 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.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K 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.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 158K 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-18-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717381056266

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-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-06-03 02:17:37] [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-03 02:17:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 02:17:38] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-06-03 02:17:38] [INFO ] Transformed 252 places.
[2024-06-03 02:17:38] [INFO ] Transformed 543 transitions.
[2024-06-03 02:17:38] [INFO ] Found NUPN structural information;
[2024-06-03 02:17:38] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 405 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1534 resets) in 2693 ms. (14 steps per ms) remains 12/14 properties
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-03 02:17:39] [INFO ] Flatten gal took : 282 ms
BEST_FIRST walk for 40003 steps (356 resets) in 351 ms. (113 steps per ms) remains 12/12 properties
[2024-06-03 02:17:39] [INFO ] Flatten gal took : 203 ms
BEST_FIRST walk for 40004 steps (435 resets) in 801 ms. (49 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (353 resets) in 280 ms. (142 steps per ms) remains 12/12 properties
[2024-06-03 02:17:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2679357280932933233.gal : 118 ms
[2024-06-03 02:17:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6571786368413722777.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/ReachabilityCardinality2679357280932933233.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6571786368413722777.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
Loading property file /tmp/ReachabilityCardinality6571786368413722777.prop.
BEST_FIRST walk for 40003 steps (345 resets) in 1914 ms. (20 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (356 resets) in 206 ms. (193 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :3 after 10
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :10 after 57
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :57 after 123
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :123 after 221
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :221 after 284
BEST_FIRST walk for 40002 steps (351 resets) in 232 ms. (171 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (354 resets) in 143 ms. (277 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (350 resets) in 142 ms. (279 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (354 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (364 resets) in 138 ms. (287 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (352 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (369 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 256
// Phase 1: matrix 541 rows 252 cols
SDD size :284 after 5371
[2024-06-03 02:17:41] [INFO ] Computed 7 invariants in 36 ms
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :5371 after 5405
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :5405 after 5549
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :5549 after 6417
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Reachability property MedleyA-PT-18-ReachabilityCardinality-2024-15 is true.
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :6417 after 76848
Problem MedleyA-PT-18-ReachabilityCardinality-2024-03 is UNSAT
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 121/252 variables, 7/138 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 121/259 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/259 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 541/793 variables, 252/511 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 0/511 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/793 variables, 0/511 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 793/793 variables, and 511 constraints, problems are : Problem set: 2 solved, 10 unsolved in 1667 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/98 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem MedleyA-PT-18-ReachabilityCardinality-2024-01 is UNSAT
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 154/252 variables, 7/105 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 154/259 constraints. Problems are: Problem set: 3 solved, 9 unsolved
[2024-06-03 02:17:43] [INFO ] Deduced a trap composed of 20 places in 380 ms of which 45 ms to minimize.
Invariant property MedleyA-PT-18-ReachabilityCardinality-2024-09 does not hold.
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
[2024-06-03 02:17:44] [INFO ] Deduced a trap composed of 28 places in 302 ms of which 5 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :76848 after 136392
[2024-06-03 02:17:44] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-06-03 02:17:44] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 3 ms to minimize.
[2024-06-03 02:17:44] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 3 ms to minimize.
[2024-06-03 02:17:44] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 4 ms to minimize.
[2024-06-03 02:17:45] [INFO ] Deduced a trap composed of 28 places in 220 ms of which 2 ms to minimize.
[2024-06-03 02:17:45] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 8/267 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/267 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 541/793 variables, 252/519 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/793 variables, 8/527 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-03 02:17:46] [INFO ] Deduced a trap composed of 48 places in 183 ms of which 3 ms to minimize.
[2024-06-03 02:17:47] [INFO ] Deduced a trap composed of 45 places in 262 ms of which 4 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :136392 after 149396
[2024-06-03 02:17:47] [INFO ] Deduced a trap composed of 41 places in 276 ms of which 3 ms to minimize.
[2024-06-03 02:17:47] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 793/793 variables, and 531 constraints, problems are : Problem set: 4 solved, 8 unsolved in 5008 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 8/12 constraints, Known Traps: 12/12 constraints]
After SMT, in 7000ms problems are : Problem set: 4 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 541/541 transitions.
Graph (trivial) has 207 edges and 252 vertex of which 5 / 252 are part of one of the 1 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 248 transition count 504
Reduce places removed 32 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 42 rules applied. Total rules applied 75 place count 216 transition count 494
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 87 place count 206 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 205 transition count 492
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 88 place count 205 transition count 485
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 102 place count 198 transition count 485
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 131 place count 169 transition count 434
Iterating global reduction 4 with 29 rules applied. Total rules applied 160 place count 169 transition count 434
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 2 rules applied. Total rules applied 162 place count 169 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 163 place count 168 transition count 432
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 163 place count 168 transition count 429
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 169 place count 165 transition count 429
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 172 place count 162 transition count 399
Iterating global reduction 6 with 3 rules applied. Total rules applied 175 place count 162 transition count 399
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 176 place count 161 transition count 397
Iterating global reduction 6 with 1 rules applied. Total rules applied 177 place count 161 transition count 397
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 207 place count 146 transition count 382
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 209 place count 146 transition count 380
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 241 place count 130 transition count 444
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 244 place count 130 transition count 441
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 8 with 24 rules applied. Total rules applied 268 place count 130 transition count 417
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 274 place count 127 transition count 414
Free-agglomeration rule applied 18 times.
Iterating global reduction 8 with 18 rules applied. Total rules applied 292 place count 127 transition count 396
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 312 place count 109 transition count 394
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 318 place count 109 transition count 388
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 319 place count 108 transition count 387
Applied a total of 319 rules in 244 ms. Remains 108 /252 variables (removed 144) and now considering 387/541 (removed 154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 108/252 places, 387/541 transitions.
RANDOM walk for 40000 steps (3857 resets) in 753 ms. (53 steps per ms) remains 4/8 properties
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (1287 resets) in 108 ms. (367 steps per ms) remains 3/4 properties
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (699 resets) in 115 ms. (344 steps per ms) remains 1/3 properties
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (1189 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
[2024-06-03 02:17:48] [INFO ] Flow matrix only has 378 transitions (discarded 9 similar events)
// Phase 1: matrix 378 rows 108 cols
[2024-06-03 02:17:48] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 02:17:48] [INFO ] State equation strengthened by 142 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/106 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 02:17:48] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2024-06-03 02:17:48] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-06-03 02:17:49] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2024-06-03 02:17:49] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 378/484 variables, 106/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 142/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/486 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 02:17:49] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/486 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 965 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/106 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 378/484 variables, 106/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 142/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 02:17:50] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2024-06-03 02:17:50] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-06-03 02:17:50] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 2 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :149396 after 173181
[2024-06-03 02:17:50] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-06-03 02:17:50] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 5/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/486 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 02:17:50] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-06-03 02:17:50] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/486 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/486 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/486 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1465 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 2456ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 387/387 transitions.
Graph (trivial) has 104 edges and 108 vertex of which 6 / 108 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 104 transition count 375
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 375
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 13 place count 98 transition count 370
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 93 transition count 370
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 33 place count 83 transition count 350
Iterating global reduction 2 with 10 rules applied. Total rules applied 43 place count 83 transition count 350
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 2 with 1 rules applied. Total rules applied 44 place count 83 transition count 349
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 46 place count 82 transition count 348
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 46 place count 82 transition count 347
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 48 place count 81 transition count 347
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 66 place count 72 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 72 transition count 337
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 85 place count 63 transition count 379
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 101 place count 63 transition count 363
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 102 place count 62 transition count 359
Iterating global reduction 6 with 1 rules applied. Total rules applied 103 place count 62 transition count 359
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 105 place count 61 transition count 378
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 6 with 27 rules applied. Total rules applied 132 place count 61 transition count 351
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 134 place count 60 transition count 358
Free-agglomeration rule applied 11 times with reduction of 2 identical transitions.
Iterating global reduction 6 with 11 rules applied. Total rules applied 145 place count 60 transition count 345
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 187 place count 49 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 189 place count 48 transition count 329
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 7 with 31 rules applied. Total rules applied 220 place count 48 transition count 298
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 222 place count 48 transition count 326
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 224 place count 46 transition count 326
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 225 place count 45 transition count 325
Applied a total of 225 rules in 109 ms. Remains 45 /108 variables (removed 63) and now considering 325/387 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 45/108 places, 325/387 transitions.
RANDOM walk for 18718 steps (747 resets) in 330 ms. (56 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_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 13575 ms.

BK_STOP 1717381071561

--------------------
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-18"
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-18, 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-171734920100142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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