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-171640602700142.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-20b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602700142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 13 08:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 08:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 08:28 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 1.5M 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-20b-ReachabilityCardinality-2024-00
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-01
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-02
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-03
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-04
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-05
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-06
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-07
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-08
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-09
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-10
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-11
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-12
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-13
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-14
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716432247158

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-20b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-23 02:44:08] [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-05-23 02:44:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:44:08] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2024-05-23 02:44:08] [INFO ] Transformed 5372 places.
[2024-05-23 02:44:08] [INFO ] Transformed 6193 transitions.
[2024-05-23 02:44:08] [INFO ] Found NUPN structural information;
[2024-05-23 02:44:08] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 380 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (298 resets) in 2490 ms. (16 steps per ms) remains 10/13 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (21 resets) in 502 ms. (79 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (22 resets) in 218 ms. (182 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (21 resets) in 292 ms. (136 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (23 resets) in 310 ms. (128 steps per ms) remains 10/10 properties
[2024-05-23 02:44:10] [INFO ] Flatten gal took : 744 ms
BEST_FIRST walk for 40003 steps (22 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (22 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (22 resets) in 233 ms. (170 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (20 resets) in 153 ms. (259 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (22 resets) in 176 ms. (226 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (22 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
[2024-05-23 02:44:10] [INFO ] Flatten gal took : 328 ms
// Phase 1: matrix 6193 rows 5372 cols
[2024-05-23 02:44:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5964522336511130407.gal : 145 ms
[2024-05-23 02:44:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17772109084570030714.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/ReachabilityCardinality5964522336511130407.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17772109084570030714.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2024-05-23 02:44:10] [INFO ] Computed 22 invariants in 242 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Loading property file /tmp/ReachabilityCardinality17772109084570030714.prop.
At refinement iteration 2 (OVERLAPS) 5253/5360 variables, 21/128 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5360 variables, 5253/5381 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5360 variables, 0/5381 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 12/5372 variables, 1/5382 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5372 variables, 12/5394 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5372 variables, 0/5394 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 6193/11565 variables, 5372/10766 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11565/11565 variables, and 10766 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5046 ms.
Refiners :[Domain max(s): 5372/5372 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 5372/5372 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 5253/5360 variables, 21/128 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5360 variables, 5253/5381 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 02:44:21] [INFO ] Deduced a trap composed of 2058 places in 4748 ms of which 240 ms to minimize.
SMT process timed out in 11332ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 107 out of 5372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 4414 edges and 5372 vertex of which 104 / 5372 are part of one of the 17 SCC in 17 ms
Free SCC test removed 87 places
Drop transitions (Empty/Sink Transition effects.) removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 902 transitions
Trivial Post-agglo rules discarded 902 transitions
Performed 902 trivial Post agglomeration. Transition count delta: 902
Iterating post reduction 0 with 902 rules applied. Total rules applied 903 place count 5285 transition count 5186
Reduce places removed 902 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 926 rules applied. Total rules applied 1829 place count 4383 transition count 5162
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 1853 place count 4359 transition count 5162
Performed 695 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 695 Pre rules applied. Total rules applied 1853 place count 4359 transition count 4467
Deduced a syphon composed of 695 places in 5 ms
Reduce places removed 695 places and 0 transitions.
Iterating global reduction 3 with 1390 rules applied. Total rules applied 3243 place count 3664 transition count 4467
Discarding 2141 places :
Symmetric choice reduction at 3 with 2141 rule applications. Total rules 5384 place count 1523 transition count 2326
Iterating global reduction 3 with 2141 rules applied. Total rules applied 7525 place count 1523 transition count 2326
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 7525 place count 1523 transition count 2316
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 7545 place count 1513 transition count 2316
Discarding 320 places :
Symmetric choice reduction at 3 with 320 rule applications. Total rules 7865 place count 1193 transition count 1996
Iterating global reduction 3 with 320 rules applied. Total rules applied 8185 place count 1193 transition count 1996
Ensure Unique test removed 292 transitions
Reduce isomorphic transitions removed 292 transitions.
Iterating post reduction 3 with 292 rules applied. Total rules applied 8477 place count 1193 transition count 1704
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 1 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 4 with 234 rules applied. Total rules applied 8711 place count 1076 transition count 1587
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 8728 place count 1076 transition count 1570
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 8744 place count 1060 transition count 1554
Iterating global reduction 5 with 16 rules applied. Total rules applied 8760 place count 1060 transition count 1554
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8764 place count 1058 transition count 1554
Free-agglomeration rule applied 435 times.
Iterating global reduction 5 with 435 rules applied. Total rules applied 9199 place count 1058 transition count 1119
Reduce places removed 435 places and 0 transitions.
Iterating post reduction 5 with 435 rules applied. Total rules applied 9634 place count 623 transition count 1119
Discarding 71 places :
Symmetric choice reduction at 6 with 71 rule applications. Total rules 9705 place count 552 transition count 1048
Iterating global reduction 6 with 71 rules applied. Total rules applied 9776 place count 552 transition count 1048
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 6 with 71 rules applied. Total rules applied 9847 place count 552 transition count 977
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 7 with 42 rules applied. Total rules applied 9889 place count 552 transition count 935
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 9892 place count 552 transition count 935
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 9893 place count 552 transition count 934
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 9894 place count 551 transition count 933
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t5358.t4252.t4253.t4231.t4232 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 100 edges and 549 vertex of which 30 / 549 are part of one of the 14 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 8 rules applied. Total rules applied 9902 place count 533 transition count 926
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 9 with 35 rules applied. Total rules applied 9937 place count 528 transition count 896
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 21 Pre rules applied. Total rules applied 9937 place count 528 transition count 875
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 10 with 42 rules applied. Total rules applied 9979 place count 507 transition count 875
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 9987 place count 499 transition count 867
Iterating global reduction 10 with 8 rules applied. Total rules applied 9995 place count 499 transition count 867
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 10003 place count 499 transition count 859
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 11 with 36 rules applied. Total rules applied 10039 place count 481 transition count 841
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 10041 place count 480 transition count 841
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 11 with 15 rules applied. Total rules applied 10056 place count 480 transition count 826
Free-agglomeration rule applied 17 times.
Iterating global reduction 11 with 17 rules applied. Total rules applied 10073 place count 480 transition count 809
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 32 rules applied. Total rules applied 10105 place count 463 transition count 794
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 10106 place count 463 transition count 793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 10107 place count 462 transition count 793
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 10109 place count 462 transition count 793
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 10110 place count 462 transition count 792
Applied a total of 10110 rules in 1549 ms. Remains 462 /5372 variables (removed 4910) and now considering 792/6193 (removed 5401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1558 ms. Remains : 462/5372 places, 792/6193 transitions.
RANDOM walk for 40000 steps (8 resets) in 750 ms. (53 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 238 ms. (167 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 225 ms. (176 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 224 ms. (177 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 220 ms. (180 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 252 ms. (158 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 303 ms. (131 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 175 ms. (227 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 227 ms. (175 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 213012 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 10
Probabilistic random walk after 213012 steps, saw 172133 distinct states, run finished after 3004 ms. (steps per millisecond=70 ) properties seen :0
[2024-05-23 02:44:27] [INFO ] Flow matrix only has 770 transitions (discarded 22 similar events)
// Phase 1: matrix 770 rows 462 cols
[2024-05-23 02:44:27] [INFO ] Computed 21 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 355/462 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 770/1232 variables, 462/483 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
At refinement iteration 4 (INCLUDED_ONLY) 0/1232 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/1232 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1232/1232 variables, and 483 constraints, problems are : Problem set: 0 solved, 10 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 355/462 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 02:44:28] [INFO ] Deduced a trap composed of 321 places in 166 ms of which 3 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 8
[2024-05-23 02:44:28] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 3 ms to minimize.
SDD size :5 after 10
[2024-05-23 02:44:28] [INFO ] Deduced a trap composed of 315 places in 153 ms of which 4 ms to minimize.
[2024-05-23 02:44:28] [INFO ] Deduced a trap composed of 325 places in 148 ms of which 3 ms to minimize.
[2024-05-23 02:44:28] [INFO ] Deduced a trap composed of 324 places in 144 ms of which 3 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 19
[2024-05-23 02:44:29] [INFO ] Deduced a trap composed of 320 places in 147 ms of which 6 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :19 after 68
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :68 after 2324
[2024-05-23 02:44:29] [INFO ] Deduced a trap composed of 322 places in 152 ms of which 3 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :2324 after 110659
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :110659 after 2.54917e+08
[2024-05-23 02:44:29] [INFO ] Deduced a trap composed of 319 places in 151 ms of which 3 ms to minimize.
[2024-05-23 02:44:29] [INFO ] Deduced a trap composed of 325 places in 142 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :2.54917e+08 after 1.35321e+15
[2024-05-23 02:44:29] [INFO ] Deduced a trap composed of 316 places in 147 ms of which 2 ms to minimize.
[2024-05-23 02:44:29] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :1.35321e+15 after 7.94424e+26
[2024-05-23 02:44:30] [INFO ] Deduced a trap composed of 324 places in 139 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 02:44:30] [INFO ] Deduced a trap composed of 319 places in 137 ms of which 3 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :7.94424e+26 after 4.4807e+33
[2024-05-23 02:44:30] [INFO ] Deduced a trap composed of 319 places in 135 ms of which 2 ms to minimize.
[2024-05-23 02:44:30] [INFO ] Deduced a trap composed of 324 places in 134 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 770/1232 variables, 462/498 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1232 variables, 10/508 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 02:44:31] [INFO ] Deduced a trap composed of 321 places in 138 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1232 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1232 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/1232 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1232/1232 variables, and 509 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4206 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 16/16 constraints]
After SMT, in 4875ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 6 properties in 1940 ms.
Support contains 29 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 792/792 transitions.
Graph (trivial) has 409 edges and 462 vertex of which 13 / 462 are part of one of the 5 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 15 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 396 edges and 453 vertex of which 2 / 453 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 452 transition count 755
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 73 place count 430 transition count 729
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 118 place count 385 transition count 684
Iterating global reduction 2 with 45 rules applied. Total rules applied 163 place count 385 transition count 684
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 167 place count 385 transition count 680
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 170 place count 382 transition count 677
Iterating global reduction 3 with 3 rules applied. Total rules applied 173 place count 382 transition count 677
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 176 place count 382 transition count 674
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3523.t3524.t3526.t4585.t4586.t4650.t6028 and 1 places that fell out of Prefix Of Interest.
Iterating global reduction 4 with 19 rules applied. Total rules applied 195 place count 360 transition count 655
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2641.t3523.t3524.t3568.t5802.t2810.t2811.t2638.t2639 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 310 edges and 359 vertex of which 8 / 359 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 4 with 12 rules applied. Total rules applied 207 place count 352 transition count 644
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 221 place count 352 transition count 630
Discarding 91 places :
Symmetric choice reduction at 6 with 91 rule applications. Total rules 312 place count 261 transition count 539
Iterating global reduction 6 with 91 rules applied. Total rules applied 403 place count 261 transition count 539
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Iterating post reduction 6 with 91 rules applied. Total rules applied 494 place count 261 transition count 448
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 497 place count 261 transition count 445
Free-agglomeration rule applied 205 times with reduction of 7 identical transitions.
Iterating global reduction 7 with 205 rules applied. Total rules applied 702 place count 261 transition count 233
Reduce places removed 208 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 163 transitions
Reduce isomorphic transitions removed 163 transitions.
Iterating post reduction 7 with 371 rules applied. Total rules applied 1073 place count 53 transition count 70
Applied a total of 1073 rules in 113 ms. Remains 53 /462 variables (removed 409) and now considering 70/792 (removed 722) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 53/462 places, 70/792 transitions.
RANDOM walk for 40000 steps (8 resets) in 90 ms. (439 steps per ms) remains 3/4 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 205 ms. (194 steps per ms) remains 2/3 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 88 ms. (449 steps per ms) remains 1/2 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 70 rows 53 cols
[2024-05-23 02:44:34] [INFO ] Computed 14 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/46 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/109 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/109 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/123 variables, and 57 constraints, problems are : Problem set: 0 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, State Equation: 46/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/46 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/109 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/110 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/111 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/113 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/113 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/123 variables, and 61 constraints, problems are : Problem set: 0 solved, 1 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, State Equation: 48/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 164ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 5 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 26450 ms.

BK_STOP 1716432274783

--------------------
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="FlexibleBarrier-PT-20b"
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 FlexibleBarrier-PT-20b, 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 r180-tall-171640602700142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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