About the Execution of ITS-Tools for FlexibleBarrier-PT-14b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
739.947 | 24924.00 | 71312.00 | 83.00 | TTTTTFTFTTFTFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r180-tall-171640602600095.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 FlexibleBarrier-PT-14b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602600095
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 08:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 13 08:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 13 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 13 08:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 726K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716424631261
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-14b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-23 00:37:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 00:37:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:37:12] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2024-05-23 00:37:12] [INFO ] Transformed 2678 places.
[2024-05-23 00:37:12] [INFO ] Transformed 3085 transitions.
[2024-05-23 00:37:12] [INFO ] Found NUPN structural information;
[2024-05-23 00:37:12] [INFO ] Parsed PT model containing 2678 places and 3085 transitions and 7733 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (405 resets) in 2748 ms. (14 steps per ms) remains 14/16 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-23 00:37:13] [INFO ] Flatten gal took : 375 ms
BEST_FIRST walk for 40004 steps (34 resets) in 216 ms. (184 steps per ms) remains 13/14 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-23 00:37:13] [INFO ] Flatten gal took : 281 ms
BEST_FIRST walk for 40004 steps (36 resets) in 1227 ms. (32 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (19 resets) in 161 ms. (246 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (36 resets) in 253 ms. (157 steps per ms) remains 13/13 properties
[2024-05-23 00:37:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16963765727705201163.gal : 159 ms
[2024-05-23 00:37:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16949639999947111691.prop : 2 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/ReachabilityCardinality16963765727705201163.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16949639999947111691.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 ...330
BEST_FIRST walk for 40004 steps (37 resets) in 468 ms. (85 steps per ms) remains 12/13 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (35 resets) in 107 ms. (370 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (35 resets) in 97 ms. (408 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (36 resets) in 185 ms. (215 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (35 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
Loading property file /tmp/ReachabilityCardinality16949639999947111691.prop.
BEST_FIRST walk for 40002 steps (36 resets) in 80 ms. (493 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 23 ms. (1666 steps per ms) remains 12/12 properties
// Phase 1: matrix 3085 rows 2678 cols
[2024-05-23 00:37:14] [INFO ] Computed 16 invariants in 110 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 2541/2678 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2678 variables, 2541/2694 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2678 variables, 0/2694 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :20 after 50
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :50 after 1310
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :1310 after 46705
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :46705 after 6.05142e+07
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :6.05142e+07 after 1.01641e+14
At refinement iteration 5 (OVERLAPS) 3085/5763 variables, 2678/5372 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :1.01641e+14 after 6.65797e+21
At refinement iteration 6 (INCLUDED_ONLY) 0/5763 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/5763 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5763/5763 variables, and 5372 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4982 ms.
Refiners :[Domain max(s): 2678/2678 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 2678/2678 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem FlexibleBarrier-PT-14b-ReachabilityFireability-2024-06 is UNSAT
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2541/2678 variables, 16/153 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2678 variables, 2541/2694 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-23 00:37:22] [INFO ] Deduced a trap composed of 243 places in 1593 ms of which 122 ms to minimize.
[2024-05-23 00:37:24] [INFO ] Deduced a trap composed of 1039 places in 1639 ms of which 16 ms to minimize.
[2024-05-23 00:37:25] [INFO ] Deduced a trap composed of 980 places in 1226 ms of which 17 ms to minimize.
SMT process timed out in 10896ms, After SMT, problems are : Problem set: 1 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 133 out of 2678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2678/2678 places, 3085/3085 transitions.
Graph (trivial) has 1891 edges and 2678 vertex of which 32 / 2678 are part of one of the 5 SCC in 16 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 447 transitions
Trivial Post-agglo rules discarded 447 transitions
Performed 447 trivial Post agglomeration. Transition count delta: 447
Iterating post reduction 0 with 447 rules applied. Total rules applied 448 place count 2651 transition count 2605
Reduce places removed 447 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 467 rules applied. Total rules applied 915 place count 2204 transition count 2585
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 935 place count 2184 transition count 2585
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 313 Pre rules applied. Total rules applied 935 place count 2184 transition count 2272
Deduced a syphon composed of 313 places in 2 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 1561 place count 1871 transition count 2272
Discarding 972 places :
Symmetric choice reduction at 3 with 972 rule applications. Total rules 2533 place count 899 transition count 1300
Iterating global reduction 3 with 972 rules applied. Total rules applied 3505 place count 899 transition count 1300
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 3505 place count 899 transition count 1294
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 3517 place count 893 transition count 1294
Discarding 133 places :
Symmetric choice reduction at 3 with 133 rule applications. Total rules 3650 place count 760 transition count 1161
Iterating global reduction 3 with 133 rules applied. Total rules applied 3783 place count 760 transition count 1161
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 3 with 116 rules applied. Total rules applied 3899 place count 760 transition count 1045
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 4 with 180 rules applied. Total rules applied 4079 place count 670 transition count 955
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 4095 place count 662 transition count 955
Free-agglomeration rule applied 88 times.
Iterating global reduction 4 with 88 rules applied. Total rules applied 4183 place count 662 transition count 867
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 4 with 88 rules applied. Total rules applied 4271 place count 574 transition count 867
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4272 place count 573 transition count 866
Iterating global reduction 5 with 1 rules applied. Total rules applied 4273 place count 573 transition count 866
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4274 place count 573 transition count 865
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 4283 place count 573 transition count 856
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 4294 place count 573 transition count 856
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 4296 place count 573 transition count 856
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4297 place count 572 transition count 855
Applied a total of 4297 rules in 999 ms. Remains 572 /2678 variables (removed 2106) and now considering 855/3085 (removed 2230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1012 ms. Remains : 572/2678 places, 855/3085 transitions.
RANDOM walk for 40000 steps (1000 resets) in 765 ms. (52 steps per ms) remains 6/11 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (56 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (53 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (53 resets) in 153 ms. (259 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (54 resets) in 104 ms. (380 steps per ms) remains 5/6 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (54 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (56 resets) in 31 ms. (1250 steps per ms) remains 5/5 properties
[2024-05-23 00:37:27] [INFO ] Flow matrix only has 841 transitions (discarded 14 similar events)
// Phase 1: matrix 841 rows 572 cols
[2024-05-23 00:37:27] [INFO ] Computed 16 invariants in 8 ms
[2024-05-23 00:37:27] [INFO ] State equation strengthened by 81 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 484/564 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/564 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8/572 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 841/1413 variables, 572/588 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1413 variables, 81/669 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1413 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1413 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1413/1413 variables, and 669 constraints, problems are : Problem set: 0 solved, 5 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 572/572 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 484/564 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 00:37:28] [INFO ] Deduced a trap composed of 237 places in 196 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/564 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 00:37:28] [INFO ] Deduced a trap composed of 223 places in 194 ms of which 4 ms to minimize.
[2024-05-23 00:37:29] [INFO ] Deduced a trap composed of 267 places in 1293 ms of which 18 ms to minimize.
[2024-05-23 00:37:30] [INFO ] Deduced a trap composed of 222 places in 166 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/564 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 00:37:30] [INFO ] Deduced a trap composed of 56 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:37:30] [INFO ] Deduced a trap composed of 236 places in 204 ms of which 3 ms to minimize.
[2024-05-23 00:37:30] [INFO ] Deduced a trap composed of 240 places in 189 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 00:37:31] [INFO ] Deduced a trap composed of 241 places in 171 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 8/572 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 00:37:31] [INFO ] Deduced a trap composed of 238 places in 224 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 841/1413 variables, 572/597 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1413 variables, 81/678 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1413 variables, 5/683 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 00:37:32] [INFO ] Deduced a trap composed of 255 places in 200 ms of which 3 ms to minimize.
[2024-05-23 00:37:32] [INFO ] Deduced a trap composed of 240 places in 196 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1413 variables, 2/685 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 00:37:33] [INFO ] Deduced a trap composed of 232 places in 181 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1413 variables, 1/686 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1413 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/1413 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1413/1413 variables, and 686 constraints, problems are : Problem set: 0 solved, 5 unsolved in 6262 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 572/572 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 12/12 constraints]
After SMT, in 7072ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 1513 ms.
Support contains 6 out of 572 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 572/572 places, 855/855 transitions.
Graph (trivial) has 473 edges and 572 vertex of which 18 / 572 are part of one of the 8 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 562 transition count 803
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 528 transition count 803
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 69 place count 528 transition count 799
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 77 place count 524 transition count 799
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 89 place count 524 transition count 787
Discarding 76 places :
Symmetric choice reduction at 3 with 76 rule applications. Total rules 165 place count 448 transition count 711
Iterating global reduction 3 with 76 rules applied. Total rules applied 241 place count 448 transition count 711
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 244 place count 448 transition count 708
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 244 place count 448 transition count 707
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 246 place count 447 transition count 707
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 258 place count 447 transition count 695
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 260 place count 445 transition count 693
Iterating global reduction 5 with 2 rules applied. Total rules applied 262 place count 445 transition count 693
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 264 place count 445 transition count 691
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 320 place count 417 transition count 663
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 325 place count 417 transition count 658
Discarding 37 places :
Symmetric choice reduction at 7 with 37 rule applications. Total rules 362 place count 380 transition count 621
Iterating global reduction 7 with 37 rules applied. Total rules applied 399 place count 380 transition count 621
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 430 place count 380 transition count 590
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 439 place count 380 transition count 581
Free-agglomeration rule applied 284 times with reduction of 4 identical transitions.
Iterating global reduction 8 with 284 rules applied. Total rules applied 723 place count 380 transition count 293
Reduce places removed 285 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Graph (trivial) has 72 edges and 95 vertex of which 26 / 95 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 428 rules applied. Total rules applied 1151 place count 82 transition count 151
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 9 with 27 rules applied. Total rules applied 1178 place count 81 transition count 125
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 14 Pre rules applied. Total rules applied 1178 place count 81 transition count 111
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 10 with 28 rules applied. Total rules applied 1206 place count 67 transition count 111
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 1217 place count 67 transition count 100
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 11 with 30 rules applied. Total rules applied 1247 place count 52 transition count 85
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1250 place count 52 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1251 place count 52 transition count 81
Free-agglomeration rule applied 13 times.
Iterating global reduction 12 with 13 rules applied. Total rules applied 1264 place count 52 transition count 68
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 12 with 25 rules applied. Total rules applied 1289 place count 39 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1290 place count 38 transition count 55
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 13 with 19 rules applied. Total rules applied 1309 place count 28 transition count 46
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 1318 place count 19 transition count 37
Iterating global reduction 14 with 9 rules applied. Total rules applied 1327 place count 19 transition count 37
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 14 with 9 rules applied. Total rules applied 1336 place count 19 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 1339 place count 19 transition count 25
Free-agglomeration rule applied 2 times.
Iterating global reduction 15 with 2 rules applied. Total rules applied 1341 place count 19 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 1343 place count 17 transition count 23
Applied a total of 1343 rules in 250 ms. Remains 17 /572 variables (removed 555) and now considering 23/855 (removed 832) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 17/572 places, 23/855 transitions.
RANDOM walk for 294 steps (0 resets) in 6 ms. (42 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-00 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 23687 ms.
BK_STOP 1716424656185
--------------------
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="FlexibleBarrier-PT-14b"
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 FlexibleBarrier-PT-14b, 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 r180-tall-171640602600095"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-14b.tgz
mv FlexibleBarrier-PT-14b 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 '
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 ;